./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.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/rfi007_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi007_tso.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 17:45:04,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 17:45:04,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 17:45:04,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 17:45:04,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 17:45:04,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 17:45:04,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 17:45:04,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 17:45:04,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 17:45:04,616 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 17:45:04,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 17:45:04,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 17:45:04,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 17:45:04,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 17:45:04,618 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 17:45:04,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 17:45:04,619 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 17:45:04,619 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 17:45:04,619 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 17:45:04,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 17:45:04,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 17:45:04,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 17:45:04,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 17:45:04,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 17:45:04,621 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 17:45:04,621 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 17:45:04,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 17:45:04,622 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 17:45:04,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 17:45:04,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 17:45:04,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 17:45:04,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 17:45:04,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:45:04,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 17:45:04,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 17:45:04,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 17:45:04,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 17:45:04,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 17:45:04,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 17:45:04,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 17:45:04,626 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 17:45:04,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 17:45:04,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 17:45:04,627 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 17:45:04,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 17:45:04,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 17:45:04,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 17:45:04,920 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 17:45:04,920 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 17:45:04,922 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/rfi007_tso.yml/witness.yml [2024-06-04 17:45:05,127 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 17:45:05,127 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 17:45:05,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.i [2024-06-04 17:45:06,278 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 17:45:06,591 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 17:45:06,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_tso.i [2024-06-04 17:45:06,603 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41bcbfb70/8bbcedb7499142bca5db0b23ed47395e/FLAGb7b26ebfe [2024-06-04 17:45:06,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41bcbfb70/8bbcedb7499142bca5db0b23ed47395e [2024-06-04 17:45:06,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 17:45:06,617 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 17:45:06,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 17:45:06,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 17:45:06,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 17:45:06,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:45:05" (1/2) ... [2024-06-04 17:45:06,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48cdee6f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:45:06, skipping insertion in model container [2024-06-04 17:45:06,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:45:05" (1/2) ... [2024-06-04 17:45:06,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@40f4557b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:45:06, skipping insertion in model container [2024-06-04 17:45:06,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:45:06" (2/2) ... [2024-06-04 17:45:06,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48cdee6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:45:06, skipping insertion in model container [2024-06-04 17:45:06,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:45:06" (2/2) ... [2024-06-04 17:45:06,627 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 17:45:06,688 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 17:45:06,689 INFO L97 edCorrectnessWitness]: Location invariant before [L813-L813] (((((((((((((((! multithreaded || y$r_buff0_thd1 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_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_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__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_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )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_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )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_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (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_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$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_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$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_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$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_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$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_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (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 )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 17:45:06,689 INFO L97 edCorrectnessWitness]: Location invariant before [L814-L814] (((((((((((((((! multithreaded || y$r_buff0_thd1 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_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_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__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_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )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_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )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_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (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_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$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_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$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_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$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_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$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_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (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 )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 17:45:06,690 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 17:45:06,690 INFO L106 edCorrectnessWitness]: ghost_update [L811-L811] multithreaded = 1; [2024-06-04 17:45:06,721 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 17:45:07,040 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:45:07,053 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 17:45:07,343 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:45:07,381 INFO L206 MainTranslator]: Completed translation [2024-06-04 17:45:07,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:45:07 WrapperNode [2024-06-04 17:45:07,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 17:45:07,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 17:45:07,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 17:45:07,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 17:45:07,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:45:07" (1/1) ... [2024-06-04 17:45:07,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:45:07" (1/1) ... [2024-06-04 17:45:07,518 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154 [2024-06-04 17:45:07,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 17:45:07,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 17:45:07,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 17:45:07,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 17:45:07,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:45:07" (1/1) ... [2024-06-04 17:45:07,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:45:07" (1/1) ... [2024-06-04 17:45:07,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:45:07" (1/1) ... [2024-06-04 17:45:07,579 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 17:45:07,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:45:07" (1/1) ... [2024-06-04 17:45:07,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:45:07" (1/1) ... [2024-06-04 17:45:07,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:45:07" (1/1) ... [2024-06-04 17:45:07,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:45:07" (1/1) ... [2024-06-04 17:45:07,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:45:07" (1/1) ... [2024-06-04 17:45:07,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:45:07" (1/1) ... [2024-06-04 17:45:07,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 17:45:07,657 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 17:45:07,657 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 17:45:07,657 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 17:45:07,658 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:45:07" (1/1) ... [2024-06-04 17:45:07,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:45:07,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 17:45:07,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 17:45:07,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 17:45:07,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 17:45:07,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 17:45:07,729 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 17:45:07,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 17:45:07,729 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 17:45:07,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 17:45:07,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 17:45:07,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 17:45:07,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 17:45:07,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 17:45:07,732 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 17:45:07,887 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 17:45:07,889 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 17:45:08,752 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 17:45:08,752 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 17:45:08,960 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 17:45:08,960 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 17:45:08,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:45:08 BoogieIcfgContainer [2024-06-04 17:45:08,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 17:45:08,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 17:45:08,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 17:45:08,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 17:45:08,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:45:05" (1/4) ... [2024-06-04 17:45:08,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffdde9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:45:08, skipping insertion in model container [2024-06-04 17:45:08,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:45:06" (2/4) ... [2024-06-04 17:45:08,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffdde9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:45:08, skipping insertion in model container [2024-06-04 17:45:08,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:45:07" (3/4) ... [2024-06-04 17:45:08,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffdde9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:45:08, skipping insertion in model container [2024-06-04 17:45:08,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:45:08" (4/4) ... [2024-06-04 17:45:08,977 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_tso.i [2024-06-04 17:45:08,992 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 17:45:08,993 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 17:45:08,993 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 17:45:09,069 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 17:45:09,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-04 17:45:09,148 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-04 17:45:09,148 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:45:09,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 17:45:09,150 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-04 17:45:09,153 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-04 17:45:09,165 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 17:45:09,172 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;@1836a7e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 17:45:09,172 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 17:45:09,180 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 17:45:09,180 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 17:45:09,181 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:45:09,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:09,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 17:45:09,184 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:45:09,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:09,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1606705191, now seen corresponding path program 1 times [2024-06-04 17:45:09,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:09,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166317868] [2024-06-04 17:45:09,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:09,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:13,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:13,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166317868] [2024-06-04 17:45:13,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166317868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:13,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:13,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 17:45:13,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317068434] [2024-06-04 17:45:13,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:13,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 17:45:13,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:13,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 17:45:13,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 17:45:13,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 17:45:13,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:13,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:13,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 17:45:13,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:13,480 INFO L124 PetriNetUnfolderBase]: 162/309 cut-off events. [2024-06-04 17:45:13,480 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-04 17:45:13,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 309 events. 162/309 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1128 event pairs, 97 based on Foata normal form. 1/298 useless extension candidates. Maximal degree in co-relation 608. Up to 288 conditions per place. [2024-06-04 17:45:13,487 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 23 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-04 17:45:13,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 119 flow [2024-06-04 17:45:13,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 17:45:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 17:45:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-06-04 17:45:13,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5268817204301075 [2024-06-04 17:45:13,501 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 49 transitions. [2024-06-04 17:45:13,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 119 flow [2024-06-04 17:45:13,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 17:45:13,506 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-04 17:45:13,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-06-04 17:45:13,511 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-04 17:45:13,511 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-04 17:45:13,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:13,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:13,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:13,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 17:45:13,513 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:45:13,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:13,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2144571448, now seen corresponding path program 1 times [2024-06-04 17:45:13,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:13,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556725816] [2024-06-04 17:45:13,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:13,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:16,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-04 17:45:16,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:16,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556725816] [2024-06-04 17:45:16,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556725816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:16,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:16,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 17:45:16,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796592046] [2024-06-04 17:45:16,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:16,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 17:45:16,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:16,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 17:45:16,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 17:45:16,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:45:16,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:16,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:16,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:45:16,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:16,483 INFO L124 PetriNetUnfolderBase]: 186/337 cut-off events. [2024-06-04 17:45:16,484 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-06-04 17:45:16,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 337 events. 186/337 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1172 event pairs, 94 based on Foata normal form. 2/338 useless extension candidates. Maximal degree in co-relation 766. Up to 319 conditions per place. [2024-06-04 17:45:16,490 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 28 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-04 17:45:16,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 163 flow [2024-06-04 17:45:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 17:45:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 17:45:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2024-06-04 17:45:16,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47580645161290325 [2024-06-04 17:45:16,494 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 59 transitions. [2024-06-04 17:45:16,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 163 flow [2024-06-04 17:45:16,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 17:45:16,498 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-04 17:45:16,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-06-04 17:45:16,499 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-04 17:45:16,500 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-04 17:45:16,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:16,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:16,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:16,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 17:45:16,501 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:45:16,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:16,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2057206554, now seen corresponding path program 1 times [2024-06-04 17:45:16,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:16,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111763652] [2024-06-04 17:45:16,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:16,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:19,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:19,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:19,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111763652] [2024-06-04 17:45:19,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111763652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:19,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:19,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 17:45:19,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561669413] [2024-06-04 17:45:19,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:19,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 17:45:19,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:19,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 17:45:19,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 17:45:19,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:45:19,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:19,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:19,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:45:19,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:19,409 INFO L124 PetriNetUnfolderBase]: 180/327 cut-off events. [2024-06-04 17:45:19,409 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2024-06-04 17:45:19,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 327 events. 180/327 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1119 event pairs, 52 based on Foata normal form. 4/330 useless extension candidates. Maximal degree in co-relation 822. Up to 291 conditions per place. [2024-06-04 17:45:19,413 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 33 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-04 17:45:19,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 215 flow [2024-06-04 17:45:19,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:45:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:45:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2024-06-04 17:45:19,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645161290322581 [2024-06-04 17:45:19,415 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 72 transitions. [2024-06-04 17:45:19,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 215 flow [2024-06-04 17:45:19,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 206 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 17:45:19,417 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 119 flow [2024-06-04 17:45:19,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-06-04 17:45:19,418 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-04 17:45:19,418 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 119 flow [2024-06-04 17:45:19,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:19,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:19,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:19,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 17:45:19,419 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:45:19,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:19,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1290578649, now seen corresponding path program 1 times [2024-06-04 17:45:19,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:19,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484790365] [2024-06-04 17:45:19,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:19,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:22,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:22,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484790365] [2024-06-04 17:45:22,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484790365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:22,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:22,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:45:22,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935922318] [2024-06-04 17:45:22,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:22,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:45:22,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:22,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:45:22,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:45:22,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:45:22,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:22,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:22,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:45:22,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:22,937 INFO L124 PetriNetUnfolderBase]: 176/319 cut-off events. [2024-06-04 17:45:22,940 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2024-06-04 17:45:22,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 319 events. 176/319 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1082 event pairs, 30 based on Foata normal form. 4/322 useless extension candidates. Maximal degree in co-relation 873. Up to 265 conditions per place. [2024-06-04 17:45:22,944 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 33 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-06-04 17:45:22,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 229 flow [2024-06-04 17:45:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:45:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:45:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-06-04 17:45:22,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42473118279569894 [2024-06-04 17:45:22,949 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 119 flow. Second operand 6 states and 79 transitions. [2024-06-04 17:45:22,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 229 flow [2024-06-04 17:45:22,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 214 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 17:45:22,952 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 116 flow [2024-06-04 17:45:22,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2024-06-04 17:45:22,954 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-04 17:45:22,954 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 116 flow [2024-06-04 17:45:22,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:22,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:22,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:22,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 17:45:22,955 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:45:22,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:22,956 INFO L85 PathProgramCache]: Analyzing trace with hash 672537551, now seen corresponding path program 1 times [2024-06-04 17:45:22,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:22,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834362308] [2024-06-04 17:45:22,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:22,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:27,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:27,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834362308] [2024-06-04 17:45:27,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834362308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:27,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:27,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:45:27,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641695641] [2024-06-04 17:45:27,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:27,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:45:27,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:27,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:45:27,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:45:27,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:45:27,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:27,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:27,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:45:27,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:27,833 INFO L124 PetriNetUnfolderBase]: 147/283 cut-off events. [2024-06-04 17:45:27,833 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2024-06-04 17:45:27,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 283 events. 147/283 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 989 event pairs, 53 based on Foata normal form. 1/283 useless extension candidates. Maximal degree in co-relation 792. Up to 259 conditions per place. [2024-06-04 17:45:27,836 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 26 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2024-06-04 17:45:27,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 198 flow [2024-06-04 17:45:27,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:45:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:45:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2024-06-04 17:45:27,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-04 17:45:27,838 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 116 flow. Second operand 5 states and 59 transitions. [2024-06-04 17:45:27,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 198 flow [2024-06-04 17:45:27,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 178 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 17:45:27,844 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 123 flow [2024-06-04 17:45:27,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2024-06-04 17:45:27,850 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2024-06-04 17:45:27,850 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 123 flow [2024-06-04 17:45:27,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:27,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:27,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:27,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 17:45:27,852 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:45:27,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:27,853 INFO L85 PathProgramCache]: Analyzing trace with hash -616340437, now seen corresponding path program 1 times [2024-06-04 17:45:27,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:27,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621079308] [2024-06-04 17:45:27,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:27,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:32,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:32,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621079308] [2024-06-04 17:45:32,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621079308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:32,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:32,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:45:32,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433216870] [2024-06-04 17:45:32,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:32,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:45:32,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:32,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:45:32,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:45:32,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 17:45:32,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:32,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:32,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 17:45:32,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:32,850 INFO L124 PetriNetUnfolderBase]: 143/277 cut-off events. [2024-06-04 17:45:32,851 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2024-06-04 17:45:32,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 277 events. 143/277 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 962 event pairs, 51 based on Foata normal form. 2/278 useless extension candidates. Maximal degree in co-relation 803. Up to 247 conditions per place. [2024-06-04 17:45:32,854 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 28 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2024-06-04 17:45:32,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 219 flow [2024-06-04 17:45:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:45:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:45:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2024-06-04 17:45:32,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-04 17:45:32,857 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 123 flow. Second operand 6 states and 75 transitions. [2024-06-04 17:45:32,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 219 flow [2024-06-04 17:45:32,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 208 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 17:45:32,859 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 145 flow [2024-06-04 17:45:32,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2024-06-04 17:45:32,862 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2024-06-04 17:45:32,862 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 145 flow [2024-06-04 17:45:32,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:32,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:32,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:32,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 17:45:32,863 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:45:32,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:32,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1661963166, now seen corresponding path program 1 times [2024-06-04 17:45:32,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:32,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160954303] [2024-06-04 17:45:32,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:32,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:37,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:37,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160954303] [2024-06-04 17:45:37,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160954303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:37,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:37,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:45:37,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596019452] [2024-06-04 17:45:37,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:37,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:45:37,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:37,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:45:37,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:45:37,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:45:37,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 145 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:37,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:37,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:45:37,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:37,678 INFO L124 PetriNetUnfolderBase]: 171/312 cut-off events. [2024-06-04 17:45:37,679 INFO L125 PetriNetUnfolderBase]: For 716/716 co-relation queries the response was YES. [2024-06-04 17:45:37,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 312 events. 171/312 cut-off events. For 716/716 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1033 event pairs, 61 based on Foata normal form. 1/312 useless extension candidates. Maximal degree in co-relation 993. Up to 291 conditions per place. [2024-06-04 17:45:37,681 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 33 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-06-04 17:45:37,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 257 flow [2024-06-04 17:45:37,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:45:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:45:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2024-06-04 17:45:37,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-04 17:45:37,683 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 145 flow. Second operand 6 states and 66 transitions. [2024-06-04 17:45:37,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 257 flow [2024-06-04 17:45:37,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 240 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:45:37,687 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 161 flow [2024-06-04 17:45:37,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-06-04 17:45:37,688 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2024-06-04 17:45:37,688 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 161 flow [2024-06-04 17:45:37,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:37,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:37,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:37,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 17:45:37,689 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:45:37,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:37,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1926691336, now seen corresponding path program 2 times [2024-06-04 17:45:37,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:37,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211108937] [2024-06-04 17:45:37,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:37,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:41,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:41,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211108937] [2024-06-04 17:45:41,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211108937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:41,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:41,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:45:41,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476402388] [2024-06-04 17:45:41,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:41,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:45:41,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:41,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:45:41,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:45:41,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:45:41,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 161 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:41,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:41,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:45:41,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:41,907 INFO L124 PetriNetUnfolderBase]: 169/309 cut-off events. [2024-06-04 17:45:41,908 INFO L125 PetriNetUnfolderBase]: For 891/891 co-relation queries the response was YES. [2024-06-04 17:45:41,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 309 events. 169/309 cut-off events. For 891/891 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1018 event pairs, 61 based on Foata normal form. 1/309 useless extension candidates. Maximal degree in co-relation 1034. Up to 282 conditions per place. [2024-06-04 17:45:41,911 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 32 selfloop transitions, 12 changer transitions 0/46 dead transitions. [2024-06-04 17:45:41,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 285 flow [2024-06-04 17:45:41,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:45:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:45:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2024-06-04 17:45:41,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3456221198156682 [2024-06-04 17:45:41,913 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 161 flow. Second operand 7 states and 75 transitions. [2024-06-04 17:45:41,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 285 flow [2024-06-04 17:45:41,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 268 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:45:41,915 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 189 flow [2024-06-04 17:45:41,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=189, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2024-06-04 17:45:41,917 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2024-06-04 17:45:41,917 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 189 flow [2024-06-04 17:45:41,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:41,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:41,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:41,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 17:45:41,918 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:45:41,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:41,919 INFO L85 PathProgramCache]: Analyzing trace with hash -632825254, now seen corresponding path program 1 times [2024-06-04 17:45:41,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:41,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079470694] [2024-06-04 17:45:41,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:41,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:45,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:45,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079470694] [2024-06-04 17:45:45,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079470694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:45,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:45,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:45:45,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651381676] [2024-06-04 17:45:45,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:45,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:45:45,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:45,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:45:45,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:45:45,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:45:45,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 189 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:45,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:45,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:45:45,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:45,882 INFO L124 PetriNetUnfolderBase]: 175/319 cut-off events. [2024-06-04 17:45:45,882 INFO L125 PetriNetUnfolderBase]: For 1215/1215 co-relation queries the response was YES. [2024-06-04 17:45:45,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 319 events. 175/319 cut-off events. For 1215/1215 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1059 event pairs, 42 based on Foata normal form. 2/320 useless extension candidates. Maximal degree in co-relation 1136. Up to 277 conditions per place. [2024-06-04 17:45:45,885 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 44 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2024-06-04 17:45:45,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 363 flow [2024-06-04 17:45:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:45:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:45:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-04 17:45:45,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588709677419355 [2024-06-04 17:45:45,887 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 189 flow. Second operand 8 states and 89 transitions. [2024-06-04 17:45:45,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 363 flow [2024-06-04 17:45:45,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 334 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 17:45:45,890 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 216 flow [2024-06-04 17:45:45,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2024-06-04 17:45:45,891 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2024-06-04 17:45:45,891 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 216 flow [2024-06-04 17:45:45,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:45,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:45,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:45,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 17:45:45,891 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:45:45,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:45,892 INFO L85 PathProgramCache]: Analyzing trace with hash -632705098, now seen corresponding path program 1 times [2024-06-04 17:45:45,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:45,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097382857] [2024-06-04 17:45:45,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:45,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:50,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:50,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097382857] [2024-06-04 17:45:50,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097382857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:50,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:50,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:45:50,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279985465] [2024-06-04 17:45:50,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:50,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:45:50,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:50,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:45:50,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:45:50,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:45:50,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 216 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:50,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:50,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:45:50,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:50,353 INFO L124 PetriNetUnfolderBase]: 178/324 cut-off events. [2024-06-04 17:45:50,354 INFO L125 PetriNetUnfolderBase]: For 1500/1500 co-relation queries the response was YES. [2024-06-04 17:45:50,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 324 events. 178/324 cut-off events. For 1500/1500 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1076 event pairs, 41 based on Foata normal form. 1/324 useless extension candidates. Maximal degree in co-relation 1248. Up to 300 conditions per place. [2024-06-04 17:45:50,357 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 40 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2024-06-04 17:45:50,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 350 flow [2024-06-04 17:45:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:45:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:45:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-04 17:45:50,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34101382488479265 [2024-06-04 17:45:50,359 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 216 flow. Second operand 7 states and 74 transitions. [2024-06-04 17:45:50,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 350 flow [2024-06-04 17:45:50,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 323 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 17:45:50,362 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 228 flow [2024-06-04 17:45:50,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-06-04 17:45:50,364 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2024-06-04 17:45:50,364 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 228 flow [2024-06-04 17:45:50,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:50,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:50,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:50,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 17:45:50,365 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:45:50,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:50,365 INFO L85 PathProgramCache]: Analyzing trace with hash -632705284, now seen corresponding path program 2 times [2024-06-04 17:45:50,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:50,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603353975] [2024-06-04 17:45:50,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:50,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:53,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:53,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603353975] [2024-06-04 17:45:53,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603353975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:53,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:53,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:45:53,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694353492] [2024-06-04 17:45:53,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:53,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:45:53,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:53,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:45:53,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:45:53,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:45:53,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 228 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:53,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:53,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:45:53,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:54,124 INFO L124 PetriNetUnfolderBase]: 189/342 cut-off events. [2024-06-04 17:45:54,124 INFO L125 PetriNetUnfolderBase]: For 1937/1937 co-relation queries the response was YES. [2024-06-04 17:45:54,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 342 events. 189/342 cut-off events. For 1937/1937 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1170 event pairs, 41 based on Foata normal form. 2/343 useless extension candidates. Maximal degree in co-relation 1382. Up to 287 conditions per place. [2024-06-04 17:45:54,127 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 41 selfloop transitions, 16 changer transitions 0/59 dead transitions. [2024-06-04 17:45:54,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 428 flow [2024-06-04 17:45:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:45:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:45:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-04 17:45:54,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3686635944700461 [2024-06-04 17:45:54,130 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 228 flow. Second operand 7 states and 80 transitions. [2024-06-04 17:45:54,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 428 flow [2024-06-04 17:45:54,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 405 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 17:45:54,134 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 278 flow [2024-06-04 17:45:54,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-06-04 17:45:54,134 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2024-06-04 17:45:54,135 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 278 flow [2024-06-04 17:45:54,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:54,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:54,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:54,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 17:45:54,135 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:45:54,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:54,136 INFO L85 PathProgramCache]: Analyzing trace with hash -455573764, now seen corresponding path program 3 times [2024-06-04 17:45:54,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:54,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439523628] [2024-06-04 17:45:54,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:54,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:45:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:45:57,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:45:57,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439523628] [2024-06-04 17:45:57,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439523628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:45:57,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:45:57,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:45:57,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037733107] [2024-06-04 17:45:57,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:45:57,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:45:57,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:45:57,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:45:57,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:45:57,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:45:57,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 278 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:57,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:45:57,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:45:57,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:45:58,255 INFO L124 PetriNetUnfolderBase]: 185/337 cut-off events. [2024-06-04 17:45:58,255 INFO L125 PetriNetUnfolderBase]: For 2294/2297 co-relation queries the response was YES. [2024-06-04 17:45:58,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 337 events. 185/337 cut-off events. For 2294/2297 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1145 event pairs, 44 based on Foata normal form. 4/339 useless extension candidates. Maximal degree in co-relation 1417. Up to 269 conditions per place. [2024-06-04 17:45:58,258 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 39 selfloop transitions, 21 changer transitions 0/62 dead transitions. [2024-06-04 17:45:58,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 62 transitions, 476 flow [2024-06-04 17:45:58,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:45:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:45:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-04 17:45:58,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588709677419355 [2024-06-04 17:45:58,261 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 278 flow. Second operand 8 states and 89 transitions. [2024-06-04 17:45:58,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 62 transitions, 476 flow [2024-06-04 17:45:58,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 62 transitions, 454 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-04 17:45:58,265 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 327 flow [2024-06-04 17:45:58,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=327, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2024-06-04 17:45:58,266 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2024-06-04 17:45:58,266 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 327 flow [2024-06-04 17:45:58,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:45:58,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:45:58,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:45:58,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 17:45:58,267 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:45:58,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:45:58,267 INFO L85 PathProgramCache]: Analyzing trace with hash -455573578, now seen corresponding path program 2 times [2024-06-04 17:45:58,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:45:58,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729145655] [2024-06-04 17:45:58,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:45:58,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:45:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:02,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-04 17:46:02,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:02,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729145655] [2024-06-04 17:46:02,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729145655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:02,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:02,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:46:02,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562162718] [2024-06-04 17:46:02,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:02,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:46:02,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:02,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:46:02,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:46:02,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:46:02,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 327 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:02,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:02,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:46:02,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:02,990 INFO L124 PetriNetUnfolderBase]: 188/341 cut-off events. [2024-06-04 17:46:02,990 INFO L125 PetriNetUnfolderBase]: For 2589/2589 co-relation queries the response was YES. [2024-06-04 17:46:02,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 341 events. 188/341 cut-off events. For 2589/2589 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1163 event pairs, 41 based on Foata normal form. 1/341 useless extension candidates. Maximal degree in co-relation 1520. Up to 311 conditions per place. [2024-06-04 17:46:02,994 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 45 selfloop transitions, 14 changer transitions 0/61 dead transitions. [2024-06-04 17:46:02,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 485 flow [2024-06-04 17:46:02,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:46:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:46:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-04 17:46:02,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3346774193548387 [2024-06-04 17:46:02,995 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 327 flow. Second operand 8 states and 83 transitions. [2024-06-04 17:46:02,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 61 transitions, 485 flow [2024-06-04 17:46:02,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 430 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 17:46:03,000 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 323 flow [2024-06-04 17:46:03,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=323, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2024-06-04 17:46:03,001 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 33 predicate places. [2024-06-04 17:46:03,001 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 323 flow [2024-06-04 17:46:03,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:03,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:03,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:03,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 17:46:03,002 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:46:03,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:03,002 INFO L85 PathProgramCache]: Analyzing trace with hash -455336428, now seen corresponding path program 3 times [2024-06-04 17:46:03,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:03,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248056828] [2024-06-04 17:46:03,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:03,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:07,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:07,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248056828] [2024-06-04 17:46:07,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248056828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:07,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:07,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:46:07,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545847588] [2024-06-04 17:46:07,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:07,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:46:07,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:07,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:46:07,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:46:07,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:46:07,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 323 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:07,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:07,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:46:07,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:07,654 INFO L124 PetriNetUnfolderBase]: 186/339 cut-off events. [2024-06-04 17:46:07,654 INFO L125 PetriNetUnfolderBase]: For 2851/2854 co-relation queries the response was YES. [2024-06-04 17:46:07,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 339 events. 186/339 cut-off events. For 2851/2854 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1171 event pairs, 45 based on Foata normal form. 3/340 useless extension candidates. Maximal degree in co-relation 1515. Up to 299 conditions per place. [2024-06-04 17:46:07,657 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 41 selfloop transitions, 18 changer transitions 0/61 dead transitions. [2024-06-04 17:46:07,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 485 flow [2024-06-04 17:46:07,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:46:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:46:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-04 17:46:07,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34101382488479265 [2024-06-04 17:46:07,658 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 323 flow. Second operand 7 states and 74 transitions. [2024-06-04 17:46:07,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 485 flow [2024-06-04 17:46:07,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 450 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 17:46:07,665 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 372 flow [2024-06-04 17:46:07,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=372, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2024-06-04 17:46:07,666 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2024-06-04 17:46:07,666 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 372 flow [2024-06-04 17:46:07,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:07,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:07,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:07,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 17:46:07,667 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:46:07,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1003758989, now seen corresponding path program 1 times [2024-06-04 17:46:07,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:07,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045941358] [2024-06-04 17:46:07,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:11,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045941358] [2024-06-04 17:46:11,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045941358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:11,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:11,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:46:11,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105692081] [2024-06-04 17:46:11,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:11,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:46:11,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:11,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:46:11,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:46:11,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:46:11,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 372 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:11,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:11,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:46:11,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:12,143 INFO L124 PetriNetUnfolderBase]: 207/375 cut-off events. [2024-06-04 17:46:12,143 INFO L125 PetriNetUnfolderBase]: For 3344/3344 co-relation queries the response was YES. [2024-06-04 17:46:12,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 375 events. 207/375 cut-off events. For 3344/3344 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1338 event pairs, 41 based on Foata normal form. 1/375 useless extension candidates. Maximal degree in co-relation 1737. Up to 335 conditions per place. [2024-06-04 17:46:12,145 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 60 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2024-06-04 17:46:12,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 78 transitions, 637 flow [2024-06-04 17:46:12,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:46:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:46:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-04 17:46:12,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3467741935483871 [2024-06-04 17:46:12,146 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 372 flow. Second operand 8 states and 86 transitions. [2024-06-04 17:46:12,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 78 transitions, 637 flow [2024-06-04 17:46:12,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 78 transitions, 607 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-04 17:46:12,152 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 478 flow [2024-06-04 17:46:12,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=478, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2024-06-04 17:46:12,152 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 42 predicate places. [2024-06-04 17:46:12,152 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 478 flow [2024-06-04 17:46:12,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:12,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:12,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:12,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 17:46:12,153 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:46:12,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:12,153 INFO L85 PathProgramCache]: Analyzing trace with hash 577446209, now seen corresponding path program 2 times [2024-06-04 17:46:12,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:12,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094700468] [2024-06-04 17:46:12,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:12,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:15,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:15,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094700468] [2024-06-04 17:46:15,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094700468] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:15,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:15,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:46:15,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908178135] [2024-06-04 17:46:15,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:15,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:46:15,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:15,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:46:15,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:46:15,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:46:15,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 478 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:15,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:15,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:46:15,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:16,111 INFO L124 PetriNetUnfolderBase]: 205/372 cut-off events. [2024-06-04 17:46:16,111 INFO L125 PetriNetUnfolderBase]: For 3676/3676 co-relation queries the response was YES. [2024-06-04 17:46:16,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1840 conditions, 372 events. 205/372 cut-off events. For 3676/3676 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1319 event pairs, 40 based on Foata normal form. 1/372 useless extension candidates. Maximal degree in co-relation 1803. Up to 305 conditions per place. [2024-06-04 17:46:16,113 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 53 selfloop transitions, 22 changer transitions 0/77 dead transitions. [2024-06-04 17:46:16,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 666 flow [2024-06-04 17:46:16,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:46:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:46:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-04 17:46:16,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3640552995391705 [2024-06-04 17:46:16,116 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 478 flow. Second operand 7 states and 79 transitions. [2024-06-04 17:46:16,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 77 transitions, 666 flow [2024-06-04 17:46:16,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 77 transitions, 632 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-04 17:46:16,122 INFO L231 Difference]: Finished difference. Result has 75 places, 64 transitions, 502 flow [2024-06-04 17:46:16,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=502, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2024-06-04 17:46:16,123 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2024-06-04 17:46:16,123 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 502 flow [2024-06-04 17:46:16,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:16,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:16,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:16,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 17:46:16,124 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:46:16,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:16,125 INFO L85 PathProgramCache]: Analyzing trace with hash 577536574, now seen corresponding path program 1 times [2024-06-04 17:46:16,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:16,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269367994] [2024-06-04 17:46:16,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:16,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:20,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-04 17:46:20,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:20,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269367994] [2024-06-04 17:46:20,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269367994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:20,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:20,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:46:20,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369230173] [2024-06-04 17:46:20,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:20,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:46:20,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:20,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:46:20,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:46:20,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:46:20,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 502 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:20,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:20,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:46:20,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:21,019 INFO L124 PetriNetUnfolderBase]: 211/382 cut-off events. [2024-06-04 17:46:21,019 INFO L125 PetriNetUnfolderBase]: For 4262/4262 co-relation queries the response was YES. [2024-06-04 17:46:21,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1943 conditions, 382 events. 211/382 cut-off events. For 4262/4262 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1371 event pairs, 39 based on Foata normal form. 2/383 useless extension candidates. Maximal degree in co-relation 1905. Up to 309 conditions per place. [2024-06-04 17:46:21,022 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 62 selfloop transitions, 21 changer transitions 0/85 dead transitions. [2024-06-04 17:46:21,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 85 transitions, 742 flow [2024-06-04 17:46:21,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:46:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:46:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:46:21,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-04 17:46:21,024 INFO L175 Difference]: Start difference. First operand has 75 places, 64 transitions, 502 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:46:21,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 85 transitions, 742 flow [2024-06-04 17:46:21,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 85 transitions, 690 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 17:46:21,030 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 520 flow [2024-06-04 17:46:21,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=520, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-06-04 17:46:21,030 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2024-06-04 17:46:21,030 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 520 flow [2024-06-04 17:46:21,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:21,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:21,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:21,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 17:46:21,031 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:46:21,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:21,032 INFO L85 PathProgramCache]: Analyzing trace with hash 6644999, now seen corresponding path program 1 times [2024-06-04 17:46:21,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:21,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006353323] [2024-06-04 17:46:21,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:21,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:25,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-04 17:46:25,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:25,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006353323] [2024-06-04 17:46:25,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006353323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:25,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:25,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:46:25,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350270999] [2024-06-04 17:46:25,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:25,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:46:25,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:25,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:46:25,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:46:25,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:46:25,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 520 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:25,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:25,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:46:25,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:25,571 INFO L124 PetriNetUnfolderBase]: 214/387 cut-off events. [2024-06-04 17:46:25,571 INFO L125 PetriNetUnfolderBase]: For 4257/4257 co-relation queries the response was YES. [2024-06-04 17:46:25,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1999 conditions, 387 events. 214/387 cut-off events. For 4257/4257 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1398 event pairs, 40 based on Foata normal form. 1/387 useless extension candidates. Maximal degree in co-relation 1960. Up to 355 conditions per place. [2024-06-04 17:46:25,575 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 62 selfloop transitions, 14 changer transitions 0/78 dead transitions. [2024-06-04 17:46:25,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 78 transitions, 714 flow [2024-06-04 17:46:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:46:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:46:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-04 17:46:25,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33064516129032256 [2024-06-04 17:46:25,577 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 520 flow. Second operand 8 states and 82 transitions. [2024-06-04 17:46:25,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 78 transitions, 714 flow [2024-06-04 17:46:25,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 78 transitions, 662 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 17:46:25,585 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 521 flow [2024-06-04 17:46:25,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=521, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2024-06-04 17:46:25,585 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-06-04 17:46:25,585 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 521 flow [2024-06-04 17:46:25,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:25,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:25,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:25,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 17:46:25,588 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:46:25,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:25,589 INFO L85 PathProgramCache]: Analyzing trace with hash -619336118, now seen corresponding path program 2 times [2024-06-04 17:46:25,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:25,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921479755] [2024-06-04 17:46:25,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:25,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:29,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:29,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:29,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921479755] [2024-06-04 17:46:29,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921479755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:29,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:29,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:46:29,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399080503] [2024-06-04 17:46:29,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:29,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:46:29,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:29,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:46:29,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:46:29,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:46:29,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 521 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:29,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:29,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:46:29,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:29,715 INFO L124 PetriNetUnfolderBase]: 220/397 cut-off events. [2024-06-04 17:46:29,715 INFO L125 PetriNetUnfolderBase]: For 4874/4874 co-relation queries the response was YES. [2024-06-04 17:46:29,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 397 events. 220/397 cut-off events. For 4874/4874 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1434 event pairs, 40 based on Foata normal form. 2/398 useless extension candidates. Maximal degree in co-relation 2027. Up to 362 conditions per place. [2024-06-04 17:46:29,719 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 65 selfloop transitions, 14 changer transitions 0/81 dead transitions. [2024-06-04 17:46:29,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 81 transitions, 731 flow [2024-06-04 17:46:29,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:46:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:46:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-04 17:46:29,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3346774193548387 [2024-06-04 17:46:29,722 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 521 flow. Second operand 8 states and 83 transitions. [2024-06-04 17:46:29,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 81 transitions, 731 flow [2024-06-04 17:46:29,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 81 transitions, 694 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 17:46:29,730 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 543 flow [2024-06-04 17:46:29,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=543, PETRI_PLACES=81, PETRI_TRANSITIONS=70} [2024-06-04 17:46:29,731 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2024-06-04 17:46:29,731 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 543 flow [2024-06-04 17:46:29,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:29,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:29,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:29,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 17:46:29,732 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:46:29,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash 6639202, now seen corresponding path program 3 times [2024-06-04 17:46:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:29,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923681748] [2024-06-04 17:46:29,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:29,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:34,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:34,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:34,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923681748] [2024-06-04 17:46:34,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923681748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:34,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:34,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:46:34,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572521331] [2024-06-04 17:46:34,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:34,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:46:34,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:34,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:46:34,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:46:34,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:46:34,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 543 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:34,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:34,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:46:34,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:34,797 INFO L124 PetriNetUnfolderBase]: 231/415 cut-off events. [2024-06-04 17:46:34,797 INFO L125 PetriNetUnfolderBase]: For 5619/5619 co-relation queries the response was YES. [2024-06-04 17:46:34,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2242 conditions, 415 events. 231/415 cut-off events. For 5619/5619 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1516 event pairs, 44 based on Foata normal form. 2/416 useless extension candidates. Maximal degree in co-relation 2201. Up to 302 conditions per place. [2024-06-04 17:46:34,801 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 58 selfloop transitions, 29 changer transitions 0/89 dead transitions. [2024-06-04 17:46:34,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 89 transitions, 849 flow [2024-06-04 17:46:34,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:46:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:46:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-04 17:46:34,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36693548387096775 [2024-06-04 17:46:34,804 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 543 flow. Second operand 8 states and 91 transitions. [2024-06-04 17:46:34,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 89 transitions, 849 flow [2024-06-04 17:46:34,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 89 transitions, 806 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 17:46:34,812 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 619 flow [2024-06-04 17:46:34,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=619, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2024-06-04 17:46:34,813 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2024-06-04 17:46:34,813 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 619 flow [2024-06-04 17:46:34,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:34,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:34,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:34,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 17:46:34,814 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:46:34,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:34,815 INFO L85 PathProgramCache]: Analyzing trace with hash -411820905, now seen corresponding path program 2 times [2024-06-04 17:46:34,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:34,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749272524] [2024-06-04 17:46:34,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:34,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:38,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-04 17:46:38,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:38,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749272524] [2024-06-04 17:46:38,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749272524] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:38,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:38,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:46:38,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095703186] [2024-06-04 17:46:38,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:38,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:46:38,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:38,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:46:38,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:46:38,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:46:38,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 619 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:38,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:38,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:46:38,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:39,282 INFO L124 PetriNetUnfolderBase]: 234/420 cut-off events. [2024-06-04 17:46:39,282 INFO L125 PetriNetUnfolderBase]: For 6188/6188 co-relation queries the response was YES. [2024-06-04 17:46:39,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2345 conditions, 420 events. 234/420 cut-off events. For 6188/6188 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1543 event pairs, 50 based on Foata normal form. 1/420 useless extension candidates. Maximal degree in co-relation 2303. Up to 398 conditions per place. [2024-06-04 17:46:39,286 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 72 selfloop transitions, 12 changer transitions 0/86 dead transitions. [2024-06-04 17:46:39,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 86 transitions, 837 flow [2024-06-04 17:46:39,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:46:39,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:46:39,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2024-06-04 17:46:39,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3185483870967742 [2024-06-04 17:46:39,289 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 619 flow. Second operand 8 states and 79 transitions. [2024-06-04 17:46:39,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 86 transitions, 837 flow [2024-06-04 17:46:39,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 86 transitions, 795 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-04 17:46:39,299 INFO L231 Difference]: Finished difference. Result has 88 places, 78 transitions, 645 flow [2024-06-04 17:46:39,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=645, PETRI_PLACES=88, PETRI_TRANSITIONS=78} [2024-06-04 17:46:39,299 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 58 predicate places. [2024-06-04 17:46:39,300 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 78 transitions, 645 flow [2024-06-04 17:46:39,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:39,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:39,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:39,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 17:46:39,300 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:46:39,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:39,302 INFO L85 PathProgramCache]: Analyzing trace with hash -412088032, now seen corresponding path program 4 times [2024-06-04 17:46:39,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:39,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327417101] [2024-06-04 17:46:39,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:39,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:42,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:42,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327417101] [2024-06-04 17:46:42,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327417101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:42,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:42,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:46:42,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553284286] [2024-06-04 17:46:42,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:42,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:46:42,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:42,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:46:42,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:46:42,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:46:42,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 78 transitions, 645 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:42,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:42,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:46:42,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:42,970 INFO L124 PetriNetUnfolderBase]: 250/450 cut-off events. [2024-06-04 17:46:42,970 INFO L125 PetriNetUnfolderBase]: For 7571/7571 co-relation queries the response was YES. [2024-06-04 17:46:42,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2592 conditions, 450 events. 250/450 cut-off events. For 7571/7571 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1695 event pairs, 84 based on Foata normal form. 2/449 useless extension candidates. Maximal degree in co-relation 2547. Up to 381 conditions per place. [2024-06-04 17:46:42,974 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 66 selfloop transitions, 27 changer transitions 0/95 dead transitions. [2024-06-04 17:46:42,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 95 transitions, 979 flow [2024-06-04 17:46:42,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:46:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:46:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2024-06-04 17:46:42,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 17:46:42,976 INFO L175 Difference]: Start difference. First operand has 88 places, 78 transitions, 645 flow. Second operand 9 states and 93 transitions. [2024-06-04 17:46:42,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 95 transitions, 979 flow [2024-06-04 17:46:42,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 95 transitions, 937 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-04 17:46:42,986 INFO L231 Difference]: Finished difference. Result has 94 places, 84 transitions, 746 flow [2024-06-04 17:46:42,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=746, PETRI_PLACES=94, PETRI_TRANSITIONS=84} [2024-06-04 17:46:42,987 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 64 predicate places. [2024-06-04 17:46:42,987 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 84 transitions, 746 flow [2024-06-04 17:46:42,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:42,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:42,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:42,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 17:46:42,988 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:46:42,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:42,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1230526417, now seen corresponding path program 3 times [2024-06-04 17:46:42,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:42,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404858553] [2024-06-04 17:46:42,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:42,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:47,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:47,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404858553] [2024-06-04 17:46:47,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404858553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:47,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:47,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:46:47,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836965609] [2024-06-04 17:46:47,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:47,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:46:47,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:47,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:46:47,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:46:47,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:46:47,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 84 transitions, 746 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:47,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:47,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:46:47,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:47,473 INFO L124 PetriNetUnfolderBase]: 261/464 cut-off events. [2024-06-04 17:46:47,473 INFO L125 PetriNetUnfolderBase]: For 8754/8754 co-relation queries the response was YES. [2024-06-04 17:46:47,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2812 conditions, 464 events. 261/464 cut-off events. For 8754/8754 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1742 event pairs, 45 based on Foata normal form. 2/465 useless extension candidates. Maximal degree in co-relation 2764. Up to 385 conditions per place. [2024-06-04 17:46:47,477 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 72 selfloop transitions, 30 changer transitions 0/104 dead transitions. [2024-06-04 17:46:47,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 104 transitions, 1140 flow [2024-06-04 17:46:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:46:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:46:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-04 17:46:47,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-04 17:46:47,479 INFO L175 Difference]: Start difference. First operand has 94 places, 84 transitions, 746 flow. Second operand 9 states and 99 transitions. [2024-06-04 17:46:47,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 104 transitions, 1140 flow [2024-06-04 17:46:47,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 104 transitions, 1099 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-04 17:46:47,490 INFO L231 Difference]: Finished difference. Result has 100 places, 90 transitions, 840 flow [2024-06-04 17:46:47,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=840, PETRI_PLACES=100, PETRI_TRANSITIONS=90} [2024-06-04 17:46:47,491 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 70 predicate places. [2024-06-04 17:46:47,491 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 90 transitions, 840 flow [2024-06-04 17:46:47,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:47,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:47,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:47,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 17:46:47,492 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:46:47,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:47,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1582831412, now seen corresponding path program 5 times [2024-06-04 17:46:47,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:47,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147276774] [2024-06-04 17:46:47,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:47,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:51,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:51,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147276774] [2024-06-04 17:46:51,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147276774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:51,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:51,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:46:51,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064918214] [2024-06-04 17:46:51,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:51,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:46:51,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:51,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:46:51,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:46:51,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:46:51,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 840 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:51,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:51,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:46:51,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:52,318 INFO L124 PetriNetUnfolderBase]: 257/459 cut-off events. [2024-06-04 17:46:52,318 INFO L125 PetriNetUnfolderBase]: For 9027/9027 co-relation queries the response was YES. [2024-06-04 17:46:52,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2814 conditions, 459 events. 257/459 cut-off events. For 9027/9027 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1733 event pairs, 42 based on Foata normal form. 2/458 useless extension candidates. Maximal degree in co-relation 2763. Up to 360 conditions per place. [2024-06-04 17:46:52,322 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 71 selfloop transitions, 33 changer transitions 0/106 dead transitions. [2024-06-04 17:46:52,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 106 transitions, 1124 flow [2024-06-04 17:46:52,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:46:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:46:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 17:46:52,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-04 17:46:52,324 INFO L175 Difference]: Start difference. First operand has 100 places, 90 transitions, 840 flow. Second operand 9 states and 97 transitions. [2024-06-04 17:46:52,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 106 transitions, 1124 flow [2024-06-04 17:46:52,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 106 transitions, 1089 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-04 17:46:52,339 INFO L231 Difference]: Finished difference. Result has 105 places, 92 transitions, 914 flow [2024-06-04 17:46:52,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=914, PETRI_PLACES=105, PETRI_TRANSITIONS=92} [2024-06-04 17:46:52,339 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 75 predicate places. [2024-06-04 17:46:52,340 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 92 transitions, 914 flow [2024-06-04 17:46:52,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:52,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:52,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:52,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 17:46:52,340 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:46:52,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:52,341 INFO L85 PathProgramCache]: Analyzing trace with hash 725151971, now seen corresponding path program 4 times [2024-06-04 17:46:52,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:52,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150111098] [2024-06-04 17:46:52,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:52,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:46:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:46:56,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:46:56,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150111098] [2024-06-04 17:46:56,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150111098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:46:56,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:46:56,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:46:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054901718] [2024-06-04 17:46:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:46:56,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:46:56,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:46:56,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:46:56,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:46:56,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:46:56,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 92 transitions, 914 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:56,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:46:56,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:46:56,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:46:56,654 INFO L124 PetriNetUnfolderBase]: 255/455 cut-off events. [2024-06-04 17:46:56,654 INFO L125 PetriNetUnfolderBase]: For 9202/9202 co-relation queries the response was YES. [2024-06-04 17:46:56,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2866 conditions, 455 events. 255/455 cut-off events. For 9202/9202 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1697 event pairs, 45 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 2813. Up to 417 conditions per place. [2024-06-04 17:46:56,657 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 83 selfloop transitions, 19 changer transitions 0/104 dead transitions. [2024-06-04 17:46:56,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 104 transitions, 1168 flow [2024-06-04 17:46:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:46:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:46:56,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-04 17:46:56,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32616487455197135 [2024-06-04 17:46:56,658 INFO L175 Difference]: Start difference. First operand has 105 places, 92 transitions, 914 flow. Second operand 9 states and 91 transitions. [2024-06-04 17:46:56,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 104 transitions, 1168 flow [2024-06-04 17:46:56,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 104 transitions, 1075 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 17:46:56,669 INFO L231 Difference]: Finished difference. Result has 107 places, 94 transitions, 894 flow [2024-06-04 17:46:56,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=894, PETRI_PLACES=107, PETRI_TRANSITIONS=94} [2024-06-04 17:46:56,670 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 77 predicate places. [2024-06-04 17:46:56,670 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 94 transitions, 894 flow [2024-06-04 17:46:56,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:46:56,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:46:56,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:46:56,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 17:46:56,671 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:46:56,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:46:56,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1237878284, now seen corresponding path program 6 times [2024-06-04 17:46:56,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:46:56,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39227480] [2024-06-04 17:46:56,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:46:56,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:46:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:00,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-04 17:47:00,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:00,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39227480] [2024-06-04 17:47:00,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39227480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:00,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:00,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:47:00,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147428800] [2024-06-04 17:47:00,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:00,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:47:00,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:00,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:47:00,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:47:00,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:47:00,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 94 transitions, 894 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:00,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:00,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:47:00,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:00,895 INFO L124 PetriNetUnfolderBase]: 251/450 cut-off events. [2024-06-04 17:47:00,895 INFO L125 PetriNetUnfolderBase]: For 9353/9353 co-relation queries the response was YES. [2024-06-04 17:47:00,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2757 conditions, 450 events. 251/450 cut-off events. For 9353/9353 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1696 event pairs, 47 based on Foata normal form. 2/449 useless extension candidates. Maximal degree in co-relation 2703. Up to 408 conditions per place. [2024-06-04 17:47:00,899 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 82 selfloop transitions, 18 changer transitions 0/102 dead transitions. [2024-06-04 17:47:00,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 102 transitions, 1114 flow [2024-06-04 17:47:00,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:47:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:47:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-04 17:47:00,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33064516129032256 [2024-06-04 17:47:00,901 INFO L175 Difference]: Start difference. First operand has 107 places, 94 transitions, 894 flow. Second operand 8 states and 82 transitions. [2024-06-04 17:47:00,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 102 transitions, 1114 flow [2024-06-04 17:47:00,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 1049 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 17:47:00,914 INFO L231 Difference]: Finished difference. Result has 108 places, 94 transitions, 870 flow [2024-06-04 17:47:00,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=870, PETRI_PLACES=108, PETRI_TRANSITIONS=94} [2024-06-04 17:47:00,914 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2024-06-04 17:47:00,915 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 94 transitions, 870 flow [2024-06-04 17:47:00,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:00,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:00,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:00,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 17:47:00,915 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:47:00,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:00,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1230249587, now seen corresponding path program 1 times [2024-06-04 17:47:00,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:00,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975120284] [2024-06-04 17:47:00,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:00,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:05,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:05,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:05,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975120284] [2024-06-04 17:47:05,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975120284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:05,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:05,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:05,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914110894] [2024-06-04 17:47:05,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:05,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:05,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:05,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:05,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:05,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:47:05,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 94 transitions, 870 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:05,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:05,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:47:05,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:05,717 INFO L124 PetriNetUnfolderBase]: 248/444 cut-off events. [2024-06-04 17:47:05,717 INFO L125 PetriNetUnfolderBase]: For 9312/9312 co-relation queries the response was YES. [2024-06-04 17:47:05,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 444 events. 248/444 cut-off events. For 9312/9312 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1645 event pairs, 50 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 2636. Up to 416 conditions per place. [2024-06-04 17:47:05,721 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 88 selfloop transitions, 13 changer transitions 0/103 dead transitions. [2024-06-04 17:47:05,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 103 transitions, 1092 flow [2024-06-04 17:47:05,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2024-06-04 17:47:05,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30824372759856633 [2024-06-04 17:47:05,722 INFO L175 Difference]: Start difference. First operand has 108 places, 94 transitions, 870 flow. Second operand 9 states and 86 transitions. [2024-06-04 17:47:05,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 103 transitions, 1092 flow [2024-06-04 17:47:05,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 103 transitions, 1034 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 17:47:05,733 INFO L231 Difference]: Finished difference. Result has 110 places, 94 transitions, 842 flow [2024-06-04 17:47:05,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=842, PETRI_PLACES=110, PETRI_TRANSITIONS=94} [2024-06-04 17:47:05,733 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 80 predicate places. [2024-06-04 17:47:05,733 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 94 transitions, 842 flow [2024-06-04 17:47:05,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:05,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:05,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:05,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 17:47:05,734 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:47:05,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:05,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1737454873, now seen corresponding path program 1 times [2024-06-04 17:47:05,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:05,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311875704] [2024-06-04 17:47:05,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:05,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:09,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:09,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311875704] [2024-06-04 17:47:09,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311875704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:09,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:09,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:09,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980520934] [2024-06-04 17:47:09,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:09,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:09,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:09,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:09,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:09,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:47:09,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 94 transitions, 842 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:09,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:09,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:47:09,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:10,143 INFO L124 PetriNetUnfolderBase]: 252/452 cut-off events. [2024-06-04 17:47:10,144 INFO L125 PetriNetUnfolderBase]: For 9835/9835 co-relation queries the response was YES. [2024-06-04 17:47:10,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2724 conditions, 452 events. 252/452 cut-off events. For 9835/9835 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1705 event pairs, 24 based on Foata normal form. 2/453 useless extension candidates. Maximal degree in co-relation 2668. Up to 374 conditions per place. [2024-06-04 17:47:10,148 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 90 selfloop transitions, 17 changer transitions 0/109 dead transitions. [2024-06-04 17:47:10,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 109 transitions, 1108 flow [2024-06-04 17:47:10,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:47:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:47:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2024-06-04 17:47:10,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34274193548387094 [2024-06-04 17:47:10,150 INFO L175 Difference]: Start difference. First operand has 110 places, 94 transitions, 842 flow. Second operand 8 states and 85 transitions. [2024-06-04 17:47:10,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 109 transitions, 1108 flow [2024-06-04 17:47:10,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 1060 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-04 17:47:10,165 INFO L231 Difference]: Finished difference. Result has 109 places, 95 transitions, 848 flow [2024-06-04 17:47:10,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=848, PETRI_PLACES=109, PETRI_TRANSITIONS=95} [2024-06-04 17:47:10,171 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 79 predicate places. [2024-06-04 17:47:10,172 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 95 transitions, 848 flow [2024-06-04 17:47:10,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:10,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:10,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:10,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 17:47:10,173 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:47:10,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:10,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1737515447, now seen corresponding path program 1 times [2024-06-04 17:47:10,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:10,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983064667] [2024-06-04 17:47:10,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:10,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:14,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:14,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983064667] [2024-06-04 17:47:14,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983064667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:14,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:14,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:14,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12443703] [2024-06-04 17:47:14,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:14,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:14,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:14,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:14,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:14,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:47:14,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 95 transitions, 848 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:14,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:14,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:47:14,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:14,754 INFO L124 PetriNetUnfolderBase]: 250/449 cut-off events. [2024-06-04 17:47:14,755 INFO L125 PetriNetUnfolderBase]: For 9806/9806 co-relation queries the response was YES. [2024-06-04 17:47:14,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2698 conditions, 449 events. 250/449 cut-off events. For 9806/9806 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1688 event pairs, 38 based on Foata normal form. 1/449 useless extension candidates. Maximal degree in co-relation 2643. Up to 365 conditions per place. [2024-06-04 17:47:14,759 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 80 selfloop transitions, 27 changer transitions 0/109 dead transitions. [2024-06-04 17:47:14,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 109 transitions, 1104 flow [2024-06-04 17:47:14,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:47:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:47:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-04 17:47:14,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-04 17:47:14,761 INFO L175 Difference]: Start difference. First operand has 109 places, 95 transitions, 848 flow. Second operand 8 states and 88 transitions. [2024-06-04 17:47:14,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 109 transitions, 1104 flow [2024-06-04 17:47:14,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 109 transitions, 1050 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-04 17:47:14,773 INFO L231 Difference]: Finished difference. Result has 111 places, 95 transitions, 858 flow [2024-06-04 17:47:14,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=858, PETRI_PLACES=111, PETRI_TRANSITIONS=95} [2024-06-04 17:47:14,773 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 81 predicate places. [2024-06-04 17:47:14,774 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 95 transitions, 858 flow [2024-06-04 17:47:14,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:14,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:14,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:14,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 17:47:14,774 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:47:14,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash 720964103, now seen corresponding path program 2 times [2024-06-04 17:47:14,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:14,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299710915] [2024-06-04 17:47:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:14,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:18,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-04 17:47:18,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:18,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299710915] [2024-06-04 17:47:18,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299710915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:18,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:18,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:18,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938768672] [2024-06-04 17:47:18,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:18,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:18,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:18,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:18,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:47:18,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 95 transitions, 858 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:18,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:18,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:47:18,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:18,677 INFO L124 PetriNetUnfolderBase]: 254/457 cut-off events. [2024-06-04 17:47:18,677 INFO L125 PetriNetUnfolderBase]: For 11213/11213 co-relation queries the response was YES. [2024-06-04 17:47:18,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2769 conditions, 457 events. 254/457 cut-off events. For 11213/11213 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1742 event pairs, 38 based on Foata normal form. 2/458 useless extension candidates. Maximal degree in co-relation 2713. Up to 378 conditions per place. [2024-06-04 17:47:18,681 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 84 selfloop transitions, 24 changer transitions 0/110 dead transitions. [2024-06-04 17:47:18,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 110 transitions, 1130 flow [2024-06-04 17:47:18,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:47:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:47:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-04 17:47:18,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2024-06-04 17:47:18,686 INFO L175 Difference]: Start difference. First operand has 111 places, 95 transitions, 858 flow. Second operand 8 states and 87 transitions. [2024-06-04 17:47:18,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 110 transitions, 1130 flow [2024-06-04 17:47:18,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 110 transitions, 1059 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 17:47:18,704 INFO L231 Difference]: Finished difference. Result has 112 places, 96 transitions, 860 flow [2024-06-04 17:47:18,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=860, PETRI_PLACES=112, PETRI_TRANSITIONS=96} [2024-06-04 17:47:18,704 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 82 predicate places. [2024-06-04 17:47:18,705 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 96 transitions, 860 flow [2024-06-04 17:47:18,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:18,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:18,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:18,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 17:47:18,705 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:47:18,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:18,706 INFO L85 PathProgramCache]: Analyzing trace with hash 90525055, now seen corresponding path program 1 times [2024-06-04 17:47:18,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:18,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215767713] [2024-06-04 17:47:18,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:18,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:22,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:22,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215767713] [2024-06-04 17:47:22,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215767713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:22,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:22,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:22,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862035398] [2024-06-04 17:47:22,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:22,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:22,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:22,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:22,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:22,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:47:22,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 96 transitions, 860 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:22,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:22,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:47:22,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:23,229 INFO L124 PetriNetUnfolderBase]: 260/467 cut-off events. [2024-06-04 17:47:23,229 INFO L125 PetriNetUnfolderBase]: For 12044/12044 co-relation queries the response was YES. [2024-06-04 17:47:23,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2842 conditions, 467 events. 260/467 cut-off events. For 12044/12044 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1789 event pairs, 39 based on Foata normal form. 2/468 useless extension candidates. Maximal degree in co-relation 2785. Up to 386 conditions per place. [2024-06-04 17:47:23,233 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 89 selfloop transitions, 24 changer transitions 0/115 dead transitions. [2024-06-04 17:47:23,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 115 transitions, 1168 flow [2024-06-04 17:47:23,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 17:47:23,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-04 17:47:23,242 INFO L175 Difference]: Start difference. First operand has 112 places, 96 transitions, 860 flow. Second operand 9 states and 97 transitions. [2024-06-04 17:47:23,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 115 transitions, 1168 flow [2024-06-04 17:47:23,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 115 transitions, 1096 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 17:47:23,262 INFO L231 Difference]: Finished difference. Result has 114 places, 98 transitions, 873 flow [2024-06-04 17:47:23,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=873, PETRI_PLACES=114, PETRI_TRANSITIONS=98} [2024-06-04 17:47:23,263 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 84 predicate places. [2024-06-04 17:47:23,263 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 98 transitions, 873 flow [2024-06-04 17:47:23,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:23,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:23,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:23,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 17:47:23,264 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:47:23,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:23,264 INFO L85 PathProgramCache]: Analyzing trace with hash 839229723, now seen corresponding path program 2 times [2024-06-04 17:47:23,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:23,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548406894] [2024-06-04 17:47:23,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:23,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:26,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:26,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548406894] [2024-06-04 17:47:26,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548406894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:26,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:26,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:47:26,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107501348] [2024-06-04 17:47:26,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:26,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:47:26,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:26,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:47:26,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:47:26,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:47:26,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 98 transitions, 873 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:26,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:26,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:47:26,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:27,151 INFO L124 PetriNetUnfolderBase]: 301/533 cut-off events. [2024-06-04 17:47:27,152 INFO L125 PetriNetUnfolderBase]: For 16048/16048 co-relation queries the response was YES. [2024-06-04 17:47:27,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3417 conditions, 533 events. 301/533 cut-off events. For 16048/16048 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2123 event pairs, 41 based on Foata normal form. 2/534 useless extension candidates. Maximal degree in co-relation 3360. Up to 447 conditions per place. [2024-06-04 17:47:27,156 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 97 selfloop transitions, 23 changer transitions 0/122 dead transitions. [2024-06-04 17:47:27,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 122 transitions, 1399 flow [2024-06-04 17:47:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:47:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:47:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-04 17:47:27,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4153225806451613 [2024-06-04 17:47:27,158 INFO L175 Difference]: Start difference. First operand has 114 places, 98 transitions, 873 flow. Second operand 8 states and 103 transitions. [2024-06-04 17:47:27,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 122 transitions, 1399 flow [2024-06-04 17:47:27,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 122 transitions, 1330 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-04 17:47:27,179 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 1000 flow [2024-06-04 17:47:27,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1000, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2024-06-04 17:47:27,179 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 86 predicate places. [2024-06-04 17:47:27,180 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 1000 flow [2024-06-04 17:47:27,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:27,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:27,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:27,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 17:47:27,180 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:47:27,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:27,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2019543001, now seen corresponding path program 3 times [2024-06-04 17:47:27,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:27,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456939758] [2024-06-04 17:47:27,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:27,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:31,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:31,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456939758] [2024-06-04 17:47:31,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456939758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:31,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:31,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:31,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160253227] [2024-06-04 17:47:31,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:31,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:31,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:31,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:31,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:31,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:47:31,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 1000 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:31,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:31,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:47:31,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:31,536 INFO L124 PetriNetUnfolderBase]: 295/525 cut-off events. [2024-06-04 17:47:31,536 INFO L125 PetriNetUnfolderBase]: For 16327/16327 co-relation queries the response was YES. [2024-06-04 17:47:31,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3335 conditions, 525 events. 295/525 cut-off events. For 16327/16327 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2093 event pairs, 39 based on Foata normal form. 4/528 useless extension candidates. Maximal degree in co-relation 3277. Up to 446 conditions per place. [2024-06-04 17:47:31,539 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 96 selfloop transitions, 23 changer transitions 0/121 dead transitions. [2024-06-04 17:47:31,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 121 transitions, 1338 flow [2024-06-04 17:47:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:31,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:47:31,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-04 17:47:31,541 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 1000 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:47:31,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 121 transitions, 1338 flow [2024-06-04 17:47:31,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 121 transitions, 1269 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-06-04 17:47:31,562 INFO L231 Difference]: Finished difference. Result has 122 places, 107 transitions, 984 flow [2024-06-04 17:47:31,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=984, PETRI_PLACES=122, PETRI_TRANSITIONS=107} [2024-06-04 17:47:31,563 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 92 predicate places. [2024-06-04 17:47:31,563 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 107 transitions, 984 flow [2024-06-04 17:47:31,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:31,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:31,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:31,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:47:31,564 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:47:31,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2001108727, now seen corresponding path program 1 times [2024-06-04 17:47:31,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:31,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623069516] [2024-06-04 17:47:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:31,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:36,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:36,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623069516] [2024-06-04 17:47:36,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623069516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:36,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:36,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:36,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631339762] [2024-06-04 17:47:36,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:36,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:36,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:36,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:36,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:36,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:47:36,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 107 transitions, 984 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:36,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:36,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:47:36,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:36,564 INFO L124 PetriNetUnfolderBase]: 291/518 cut-off events. [2024-06-04 17:47:36,565 INFO L125 PetriNetUnfolderBase]: For 15254/15254 co-relation queries the response was YES. [2024-06-04 17:47:36,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3257 conditions, 518 events. 291/518 cut-off events. For 15254/15254 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2049 event pairs, 45 based on Foata normal form. 1/518 useless extension candidates. Maximal degree in co-relation 3196. Up to 483 conditions per place. [2024-06-04 17:47:36,568 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 98 selfloop transitions, 17 changer transitions 0/117 dead transitions. [2024-06-04 17:47:36,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 117 transitions, 1238 flow [2024-06-04 17:47:36,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2024-06-04 17:47:36,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-04 17:47:36,569 INFO L175 Difference]: Start difference. First operand has 122 places, 107 transitions, 984 flow. Second operand 9 states and 90 transitions. [2024-06-04 17:47:36,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 117 transitions, 1238 flow [2024-06-04 17:47:36,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 117 transitions, 1188 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 17:47:36,587 INFO L231 Difference]: Finished difference. Result has 124 places, 107 transitions, 973 flow [2024-06-04 17:47:36,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=973, PETRI_PLACES=124, PETRI_TRANSITIONS=107} [2024-06-04 17:47:36,587 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 94 predicate places. [2024-06-04 17:47:36,587 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 107 transitions, 973 flow [2024-06-04 17:47:36,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-04 17:47:36,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:36,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:36,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:47:36,588 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:47:36,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:36,588 INFO L85 PathProgramCache]: Analyzing trace with hash 205811265, now seen corresponding path program 3 times [2024-06-04 17:47:36,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:36,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151234673] [2024-06-04 17:47:36,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:36,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:40,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:40,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151234673] [2024-06-04 17:47:40,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151234673] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:40,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:40,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:40,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423222828] [2024-06-04 17:47:40,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:40,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:40,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:40,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:40,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:40,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:47:40,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 107 transitions, 973 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:40,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:40,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:47:40,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:40,782 INFO L124 PetriNetUnfolderBase]: 295/526 cut-off events. [2024-06-04 17:47:40,782 INFO L125 PetriNetUnfolderBase]: For 16628/16628 co-relation queries the response was YES. [2024-06-04 17:47:40,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3301 conditions, 526 events. 295/526 cut-off events. For 16628/16628 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2111 event pairs, 43 based on Foata normal form. 2/527 useless extension candidates. Maximal degree in co-relation 3239. Up to 442 conditions per place. [2024-06-04 17:47:40,787 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 94 selfloop transitions, 25 changer transitions 0/121 dead transitions. [2024-06-04 17:47:40,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 121 transitions, 1267 flow [2024-06-04 17:47:40,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:47:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:47:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-04 17:47:40,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2024-06-04 17:47:40,789 INFO L175 Difference]: Start difference. First operand has 124 places, 107 transitions, 973 flow. Second operand 8 states and 87 transitions. [2024-06-04 17:47:40,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 121 transitions, 1267 flow [2024-06-04 17:47:40,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 121 transitions, 1216 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-04 17:47:40,815 INFO L231 Difference]: Finished difference. Result has 125 places, 108 transitions, 996 flow [2024-06-04 17:47:40,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=996, PETRI_PLACES=125, PETRI_TRANSITIONS=108} [2024-06-04 17:47:40,816 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 95 predicate places. [2024-06-04 17:47:40,816 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 108 transitions, 996 flow [2024-06-04 17:47:40,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:40,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:40,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:40,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 17:47:40,817 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:47:40,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:40,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1855607963, now seen corresponding path program 4 times [2024-06-04 17:47:40,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:40,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046999407] [2024-06-04 17:47:40,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:40,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:45,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:45,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046999407] [2024-06-04 17:47:45,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046999407] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:45,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:45,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:45,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750612348] [2024-06-04 17:47:45,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:45,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:45,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:45,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:45,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:45,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:47:45,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 108 transitions, 996 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:45,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:45,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:47:45,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:45,831 INFO L124 PetriNetUnfolderBase]: 316/560 cut-off events. [2024-06-04 17:47:45,831 INFO L125 PetriNetUnfolderBase]: For 19473/19473 co-relation queries the response was YES. [2024-06-04 17:47:45,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3662 conditions, 560 events. 316/560 cut-off events. For 19473/19473 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2271 event pairs, 46 based on Foata normal form. 2/561 useless extension candidates. Maximal degree in co-relation 3599. Up to 369 conditions per place. [2024-06-04 17:47:45,836 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 87 selfloop transitions, 40 changer transitions 0/129 dead transitions. [2024-06-04 17:47:45,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 129 transitions, 1446 flow [2024-06-04 17:47:45,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-04 17:47:45,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3727598566308244 [2024-06-04 17:47:45,838 INFO L175 Difference]: Start difference. First operand has 125 places, 108 transitions, 996 flow. Second operand 9 states and 104 transitions. [2024-06-04 17:47:45,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 129 transitions, 1446 flow [2024-06-04 17:47:45,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 129 transitions, 1382 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 17:47:45,864 INFO L231 Difference]: Finished difference. Result has 129 places, 112 transitions, 1116 flow [2024-06-04 17:47:45,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1116, PETRI_PLACES=129, PETRI_TRANSITIONS=112} [2024-06-04 17:47:45,865 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 99 predicate places. [2024-06-04 17:47:45,865 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 112 transitions, 1116 flow [2024-06-04 17:47:45,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:45,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:45,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:45,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 17:47:45,866 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:47:45,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:45,867 INFO L85 PathProgramCache]: Analyzing trace with hash -117720533, now seen corresponding path program 2 times [2024-06-04 17:47:45,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:45,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133411822] [2024-06-04 17:47:45,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:45,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:50,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:50,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133411822] [2024-06-04 17:47:50,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133411822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:50,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:50,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:47:50,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318728537] [2024-06-04 17:47:50,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:50,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:47:50,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:50,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:47:50,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:47:50,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:47:50,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 112 transitions, 1116 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:50,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:50,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:47:50,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:50,766 INFO L124 PetriNetUnfolderBase]: 314/557 cut-off events. [2024-06-04 17:47:50,766 INFO L125 PetriNetUnfolderBase]: For 19405/19405 co-relation queries the response was YES. [2024-06-04 17:47:50,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3749 conditions, 557 events. 314/557 cut-off events. For 19405/19405 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2273 event pairs, 49 based on Foata normal form. 1/557 useless extension candidates. Maximal degree in co-relation 3684. Up to 516 conditions per place. [2024-06-04 17:47:50,770 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 100 selfloop transitions, 20 changer transitions 0/122 dead transitions. [2024-06-04 17:47:50,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 122 transitions, 1380 flow [2024-06-04 17:47:50,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:50,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2024-06-04 17:47:50,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32974910394265233 [2024-06-04 17:47:50,772 INFO L175 Difference]: Start difference. First operand has 129 places, 112 transitions, 1116 flow. Second operand 9 states and 92 transitions. [2024-06-04 17:47:50,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 122 transitions, 1380 flow [2024-06-04 17:47:50,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 122 transitions, 1309 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-04 17:47:50,799 INFO L231 Difference]: Finished difference. Result has 133 places, 112 transitions, 1091 flow [2024-06-04 17:47:50,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1091, PETRI_PLACES=133, PETRI_TRANSITIONS=112} [2024-06-04 17:47:50,800 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 103 predicate places. [2024-06-04 17:47:50,800 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 112 transitions, 1091 flow [2024-06-04 17:47:50,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:50,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:50,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:50,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 17:47:50,801 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:47:50,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:50,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1004875367, now seen corresponding path program 5 times [2024-06-04 17:47:50,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:50,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653918764] [2024-06-04 17:47:50,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:50,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:54,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:54,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653918764] [2024-06-04 17:47:54,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653918764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:54,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:54,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:47:54,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389858305] [2024-06-04 17:47:54,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:54,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:47:54,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:54,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:47:54,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:47:54,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:47:54,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 112 transitions, 1091 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:54,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:54,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:47:54,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:47:55,189 INFO L124 PetriNetUnfolderBase]: 346/610 cut-off events. [2024-06-04 17:47:55,189 INFO L125 PetriNetUnfolderBase]: For 25023/25023 co-relation queries the response was YES. [2024-06-04 17:47:55,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4236 conditions, 610 events. 346/610 cut-off events. For 25023/25023 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2531 event pairs, 55 based on Foata normal form. 4/611 useless extension candidates. Maximal degree in co-relation 4169. Up to 522 conditions per place. [2024-06-04 17:47:55,193 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 103 selfloop transitions, 25 changer transitions 0/130 dead transitions. [2024-06-04 17:47:55,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 130 transitions, 1551 flow [2024-06-04 17:47:55,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:47:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:47:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-04 17:47:55,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-04 17:47:55,195 INFO L175 Difference]: Start difference. First operand has 133 places, 112 transitions, 1091 flow. Second operand 9 states and 106 transitions. [2024-06-04 17:47:55,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 130 transitions, 1551 flow [2024-06-04 17:47:55,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 130 transitions, 1479 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-04 17:47:55,237 INFO L231 Difference]: Finished difference. Result has 133 places, 117 transitions, 1168 flow [2024-06-04 17:47:55,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1168, PETRI_PLACES=133, PETRI_TRANSITIONS=117} [2024-06-04 17:47:55,237 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 103 predicate places. [2024-06-04 17:47:55,238 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 117 transitions, 1168 flow [2024-06-04 17:47:55,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:55,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:47:55,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:47:55,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 17:47:55,238 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:47:55,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:47:55,239 INFO L85 PathProgramCache]: Analyzing trace with hash 516958611, now seen corresponding path program 3 times [2024-06-04 17:47:55,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:47:55,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143565726] [2024-06-04 17:47:55,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:47:55,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:47:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:47:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:47:59,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:47:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143565726] [2024-06-04 17:47:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143565726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:47:59,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:47:59,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:47:59,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089193849] [2024-06-04 17:47:59,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:47:59,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:47:59,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:47:59,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:47:59,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:47:59,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:47:59,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 117 transitions, 1168 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:47:59,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:47:59,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:47:59,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:00,226 INFO L124 PetriNetUnfolderBase]: 349/614 cut-off events. [2024-06-04 17:48:00,226 INFO L125 PetriNetUnfolderBase]: For 24426/24426 co-relation queries the response was YES. [2024-06-04 17:48:00,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4348 conditions, 614 events. 349/614 cut-off events. For 24426/24426 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2541 event pairs, 66 based on Foata normal form. 1/614 useless extension candidates. Maximal degree in co-relation 4281. Up to 582 conditions per place. [2024-06-04 17:48:00,231 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 109 selfloop transitions, 18 changer transitions 0/129 dead transitions. [2024-06-04 17:48:00,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 129 transitions, 1544 flow [2024-06-04 17:48:00,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:48:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:48:00,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2024-06-04 17:48:00,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31290322580645163 [2024-06-04 17:48:00,233 INFO L175 Difference]: Start difference. First operand has 133 places, 117 transitions, 1168 flow. Second operand 10 states and 97 transitions. [2024-06-04 17:48:00,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 129 transitions, 1544 flow [2024-06-04 17:48:00,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 129 transitions, 1467 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-04 17:48:00,276 INFO L231 Difference]: Finished difference. Result has 138 places, 119 transitions, 1158 flow [2024-06-04 17:48:00,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1158, PETRI_PLACES=138, PETRI_TRANSITIONS=119} [2024-06-04 17:48:00,277 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 108 predicate places. [2024-06-04 17:48:00,277 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 119 transitions, 1158 flow [2024-06-04 17:48:00,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:00,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:00,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:00,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 17:48:00,278 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:00,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:00,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2027913337, now seen corresponding path program 6 times [2024-06-04 17:48:00,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:00,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341149423] [2024-06-04 17:48:00,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:00,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:03,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:03,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341149423] [2024-06-04 17:48:03,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341149423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:03,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:03,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:48:03,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132802254] [2024-06-04 17:48:03,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:03,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:48:03,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:03,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:48:03,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:48:04,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:48:04,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 119 transitions, 1158 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:04,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:04,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:48:04,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:04,328 INFO L124 PetriNetUnfolderBase]: 373/654 cut-off events. [2024-06-04 17:48:04,328 INFO L125 PetriNetUnfolderBase]: For 29389/29389 co-relation queries the response was YES. [2024-06-04 17:48:04,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4651 conditions, 654 events. 373/654 cut-off events. For 29389/29389 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2768 event pairs, 68 based on Foata normal form. 4/657 useless extension candidates. Maximal degree in co-relation 4582. Up to 595 conditions per place. [2024-06-04 17:48:04,333 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 112 selfloop transitions, 21 changer transitions 0/135 dead transitions. [2024-06-04 17:48:04,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 135 transitions, 1624 flow [2024-06-04 17:48:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:48:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:48:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-04 17:48:04,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33691756272401435 [2024-06-04 17:48:04,341 INFO L175 Difference]: Start difference. First operand has 138 places, 119 transitions, 1158 flow. Second operand 9 states and 94 transitions. [2024-06-04 17:48:04,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 135 transitions, 1624 flow [2024-06-04 17:48:04,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 135 transitions, 1579 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 17:48:04,391 INFO L231 Difference]: Finished difference. Result has 140 places, 124 transitions, 1265 flow [2024-06-04 17:48:04,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1265, PETRI_PLACES=140, PETRI_TRANSITIONS=124} [2024-06-04 17:48:04,392 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 110 predicate places. [2024-06-04 17:48:04,392 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 124 transitions, 1265 flow [2024-06-04 17:48:04,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:04,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:04,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:04,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 17:48:04,393 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:04,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:04,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2027913585, now seen corresponding path program 4 times [2024-06-04 17:48:04,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:04,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703598221] [2024-06-04 17:48:04,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:04,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:08,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:08,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703598221] [2024-06-04 17:48:08,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703598221] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:08,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:08,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:48:08,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624250949] [2024-06-04 17:48:08,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:08,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:48:08,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:08,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:48:08,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:48:08,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:48:08,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 124 transitions, 1265 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:08,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:08,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:48:08,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:09,248 INFO L124 PetriNetUnfolderBase]: 369/647 cut-off events. [2024-06-04 17:48:09,248 INFO L125 PetriNetUnfolderBase]: For 28152/28152 co-relation queries the response was YES. [2024-06-04 17:48:09,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4660 conditions, 647 events. 369/647 cut-off events. For 28152/28152 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2723 event pairs, 71 based on Foata normal form. 1/647 useless extension candidates. Maximal degree in co-relation 4590. Up to 622 conditions per place. [2024-06-04 17:48:09,252 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 116 selfloop transitions, 14 changer transitions 0/132 dead transitions. [2024-06-04 17:48:09,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 132 transitions, 1543 flow [2024-06-04 17:48:09,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:48:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:48:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-04 17:48:09,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-04 17:48:09,254 INFO L175 Difference]: Start difference. First operand has 140 places, 124 transitions, 1265 flow. Second operand 9 states and 96 transitions. [2024-06-04 17:48:09,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 132 transitions, 1543 flow [2024-06-04 17:48:09,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 132 transitions, 1442 flow, removed 43 selfloop flow, removed 5 redundant places. [2024-06-04 17:48:09,291 INFO L231 Difference]: Finished difference. Result has 144 places, 124 transitions, 1197 flow [2024-06-04 17:48:09,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1197, PETRI_PLACES=144, PETRI_TRANSITIONS=124} [2024-06-04 17:48:09,292 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 114 predicate places. [2024-06-04 17:48:09,292 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 124 transitions, 1197 flow [2024-06-04 17:48:09,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:09,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:09,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:09,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 17:48:09,293 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:09,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:09,293 INFO L85 PathProgramCache]: Analyzing trace with hash 508387483, now seen corresponding path program 7 times [2024-06-04 17:48:09,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:09,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549073167] [2024-06-04 17:48:09,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:09,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:13,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:13,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549073167] [2024-06-04 17:48:13,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549073167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:13,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:13,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:48:13,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532334104] [2024-06-04 17:48:13,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:13,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:48:13,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:13,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:48:13,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:48:13,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:48:13,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 124 transitions, 1197 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:13,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:13,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:48:13,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:13,690 INFO L124 PetriNetUnfolderBase]: 401/699 cut-off events. [2024-06-04 17:48:13,690 INFO L125 PetriNetUnfolderBase]: For 34811/34811 co-relation queries the response was YES. [2024-06-04 17:48:13,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5120 conditions, 699 events. 401/699 cut-off events. For 34811/34811 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2995 event pairs, 64 based on Foata normal form. 4/702 useless extension candidates. Maximal degree in co-relation 5048. Up to 464 conditions per place. [2024-06-04 17:48:13,695 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 100 selfloop transitions, 47 changer transitions 0/149 dead transitions. [2024-06-04 17:48:13,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 149 transitions, 1921 flow [2024-06-04 17:48:13,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:48:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:48:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-04 17:48:13,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-04 17:48:13,697 INFO L175 Difference]: Start difference. First operand has 144 places, 124 transitions, 1197 flow. Second operand 10 states and 116 transitions. [2024-06-04 17:48:13,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 149 transitions, 1921 flow [2024-06-04 17:48:13,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 149 transitions, 1880 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-04 17:48:13,739 INFO L231 Difference]: Finished difference. Result has 145 places, 129 transitions, 1368 flow [2024-06-04 17:48:13,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1368, PETRI_PLACES=145, PETRI_TRANSITIONS=129} [2024-06-04 17:48:13,740 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2024-06-04 17:48:13,740 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 129 transitions, 1368 flow [2024-06-04 17:48:13,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:13,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:13,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:13,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 17:48:13,741 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:13,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:13,742 INFO L85 PathProgramCache]: Analyzing trace with hash 508380973, now seen corresponding path program 8 times [2024-06-04 17:48:13,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:13,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658776499] [2024-06-04 17:48:13,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:13,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:17,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:17,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658776499] [2024-06-04 17:48:17,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658776499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:17,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:17,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:48:17,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914741752] [2024-06-04 17:48:17,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:17,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:48:17,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:17,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:48:17,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:48:17,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:48:17,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 129 transitions, 1368 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:17,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:17,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:48:17,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:17,957 INFO L124 PetriNetUnfolderBase]: 397/693 cut-off events. [2024-06-04 17:48:17,958 INFO L125 PetriNetUnfolderBase]: For 33563/33563 co-relation queries the response was YES. [2024-06-04 17:48:17,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5203 conditions, 693 events. 397/693 cut-off events. For 33563/33563 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2974 event pairs, 61 based on Foata normal form. 2/694 useless extension candidates. Maximal degree in co-relation 5130. Up to 463 conditions per place. [2024-06-04 17:48:17,963 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 95 selfloop transitions, 53 changer transitions 0/150 dead transitions. [2024-06-04 17:48:17,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 150 transitions, 1966 flow [2024-06-04 17:48:17,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:48:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:48:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-04 17:48:17,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2024-06-04 17:48:17,964 INFO L175 Difference]: Start difference. First operand has 145 places, 129 transitions, 1368 flow. Second operand 10 states and 114 transitions. [2024-06-04 17:48:17,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 150 transitions, 1966 flow [2024-06-04 17:48:18,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 150 transitions, 1796 flow, removed 47 selfloop flow, removed 8 redundant places. [2024-06-04 17:48:18,012 INFO L231 Difference]: Finished difference. Result has 147 places, 131 transitions, 1363 flow [2024-06-04 17:48:18,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1363, PETRI_PLACES=147, PETRI_TRANSITIONS=131} [2024-06-04 17:48:18,012 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places. [2024-06-04 17:48:18,013 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 131 transitions, 1363 flow [2024-06-04 17:48:18,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:18,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:18,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:18,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 17:48:18,013 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:18,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:18,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2021242137, now seen corresponding path program 4 times [2024-06-04 17:48:18,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:18,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982304643] [2024-06-04 17:48:18,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:18,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:21,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-04 17:48:21,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:21,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982304643] [2024-06-04 17:48:21,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982304643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:21,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:21,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:48:21,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711921288] [2024-06-04 17:48:21,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:21,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:48:21,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:21,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:48:21,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:48:21,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:48:21,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 131 transitions, 1363 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:21,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:21,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:48:21,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:22,116 INFO L124 PetriNetUnfolderBase]: 394/689 cut-off events. [2024-06-04 17:48:22,116 INFO L125 PetriNetUnfolderBase]: For 32488/32488 co-relation queries the response was YES. [2024-06-04 17:48:22,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5009 conditions, 689 events. 394/689 cut-off events. For 32488/32488 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2945 event pairs, 55 based on Foata normal form. 2/688 useless extension candidates. Maximal degree in co-relation 4936. Up to 592 conditions per place. [2024-06-04 17:48:22,121 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 111 selfloop transitions, 32 changer transitions 0/145 dead transitions. [2024-06-04 17:48:22,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 145 transitions, 1689 flow [2024-06-04 17:48:22,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:48:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:48:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-04 17:48:22,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-04 17:48:22,123 INFO L175 Difference]: Start difference. First operand has 147 places, 131 transitions, 1363 flow. Second operand 9 states and 96 transitions. [2024-06-04 17:48:22,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 145 transitions, 1689 flow [2024-06-04 17:48:22,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 145 transitions, 1570 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-04 17:48:22,193 INFO L231 Difference]: Finished difference. Result has 149 places, 131 transitions, 1312 flow [2024-06-04 17:48:22,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1312, PETRI_PLACES=149, PETRI_TRANSITIONS=131} [2024-06-04 17:48:22,194 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 119 predicate places. [2024-06-04 17:48:22,194 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 131 transitions, 1312 flow [2024-06-04 17:48:22,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:22,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:22,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:22,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 17:48:22,195 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:22,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:22,196 INFO L85 PathProgramCache]: Analyzing trace with hash 280306843, now seen corresponding path program 9 times [2024-06-04 17:48:22,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:22,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647449991] [2024-06-04 17:48:22,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:22,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:26,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:26,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647449991] [2024-06-04 17:48:26,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647449991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:26,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:26,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:48:26,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659157034] [2024-06-04 17:48:26,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:26,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:48:26,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:26,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:48:26,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:48:26,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:48:26,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 131 transitions, 1312 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:26,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:26,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:48:26,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:27,180 INFO L124 PetriNetUnfolderBase]: 390/682 cut-off events. [2024-06-04 17:48:27,180 INFO L125 PetriNetUnfolderBase]: For 31735/31735 co-relation queries the response was YES. [2024-06-04 17:48:27,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4804 conditions, 682 events. 390/682 cut-off events. For 31735/31735 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2896 event pairs, 51 based on Foata normal form. 2/683 useless extension candidates. Maximal degree in co-relation 4730. Up to 304 conditions per place. [2024-06-04 17:48:27,184 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 79 selfloop transitions, 78 changer transitions 0/159 dead transitions. [2024-06-04 17:48:27,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 159 transitions, 2118 flow [2024-06-04 17:48:27,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:48:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:48:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-04 17:48:27,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 17:48:27,186 INFO L175 Difference]: Start difference. First operand has 149 places, 131 transitions, 1312 flow. Second operand 10 states and 120 transitions. [2024-06-04 17:48:27,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 159 transitions, 2118 flow [2024-06-04 17:48:27,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 159 transitions, 2017 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 17:48:27,232 INFO L231 Difference]: Finished difference. Result has 153 places, 137 transitions, 1569 flow [2024-06-04 17:48:27,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1569, PETRI_PLACES=153, PETRI_TRANSITIONS=137} [2024-06-04 17:48:27,233 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 123 predicate places. [2024-06-04 17:48:27,234 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 137 transitions, 1569 flow [2024-06-04 17:48:27,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:27,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:27,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:27,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 17:48:27,234 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:27,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:27,235 INFO L85 PathProgramCache]: Analyzing trace with hash 280479823, now seen corresponding path program 10 times [2024-06-04 17:48:27,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:27,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115454011] [2024-06-04 17:48:27,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:27,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:30,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-04 17:48:30,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115454011] [2024-06-04 17:48:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115454011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:30,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:30,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:48:30,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565374846] [2024-06-04 17:48:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:30,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:48:30,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:30,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:48:30,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:48:31,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:48:31,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 137 transitions, 1569 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:31,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:31,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:48:31,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:31,386 INFO L124 PetriNetUnfolderBase]: 386/676 cut-off events. [2024-06-04 17:48:31,386 INFO L125 PetriNetUnfolderBase]: For 30999/30999 co-relation queries the response was YES. [2024-06-04 17:48:31,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4968 conditions, 676 events. 386/676 cut-off events. For 30999/30999 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2886 event pairs, 59 based on Foata normal form. 2/677 useless extension candidates. Maximal degree in co-relation 4891. Up to 594 conditions per place. [2024-06-04 17:48:31,391 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 122 selfloop transitions, 28 changer transitions 0/152 dead transitions. [2024-06-04 17:48:31,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 152 transitions, 1997 flow [2024-06-04 17:48:31,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:48:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:48:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-04 17:48:31,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-04 17:48:31,392 INFO L175 Difference]: Start difference. First operand has 153 places, 137 transitions, 1569 flow. Second operand 10 states and 108 transitions. [2024-06-04 17:48:31,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 152 transitions, 1997 flow [2024-06-04 17:48:31,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 152 transitions, 1825 flow, removed 43 selfloop flow, removed 7 redundant places. [2024-06-04 17:48:31,446 INFO L231 Difference]: Finished difference. Result has 156 places, 137 transitions, 1458 flow [2024-06-04 17:48:31,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1458, PETRI_PLACES=156, PETRI_TRANSITIONS=137} [2024-06-04 17:48:31,446 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2024-06-04 17:48:31,447 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 137 transitions, 1458 flow [2024-06-04 17:48:31,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:31,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:31,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:31,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 17:48:31,447 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:31,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:31,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1577409179, now seen corresponding path program 1 times [2024-06-04 17:48:31,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:31,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68362817] [2024-06-04 17:48:31,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:31,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:35,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:35,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68362817] [2024-06-04 17:48:35,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68362817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:35,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:35,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:35,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851554521] [2024-06-04 17:48:35,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:35,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:35,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:35,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:35,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:35,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:48:35,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 137 transitions, 1458 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:35,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:35,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:48:35,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:36,265 INFO L124 PetriNetUnfolderBase]: 390/684 cut-off events. [2024-06-04 17:48:36,265 INFO L125 PetriNetUnfolderBase]: For 32654/32654 co-relation queries the response was YES. [2024-06-04 17:48:36,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4856 conditions, 684 events. 390/684 cut-off events. For 32654/32654 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2937 event pairs, 48 based on Foata normal form. 2/685 useless extension candidates. Maximal degree in co-relation 4779. Up to 598 conditions per place. [2024-06-04 17:48:36,271 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 134 selfloop transitions, 18 changer transitions 0/154 dead transitions. [2024-06-04 17:48:36,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 154 transitions, 1820 flow [2024-06-04 17:48:36,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:48:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:48:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2024-06-04 17:48:36,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 17:48:36,272 INFO L175 Difference]: Start difference. First operand has 156 places, 137 transitions, 1458 flow. Second operand 9 states and 93 transitions. [2024-06-04 17:48:36,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 154 transitions, 1820 flow [2024-06-04 17:48:36,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 154 transitions, 1736 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 17:48:36,326 INFO L231 Difference]: Finished difference. Result has 157 places, 138 transitions, 1432 flow [2024-06-04 17:48:36,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1374, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1432, PETRI_PLACES=157, PETRI_TRANSITIONS=138} [2024-06-04 17:48:36,326 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 127 predicate places. [2024-06-04 17:48:36,326 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 138 transitions, 1432 flow [2024-06-04 17:48:36,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:36,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:36,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:36,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 17:48:36,327 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:36,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:36,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1971598903, now seen corresponding path program 2 times [2024-06-04 17:48:36,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:36,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491019177] [2024-06-04 17:48:36,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:36,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:41,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:41,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491019177] [2024-06-04 17:48:41,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491019177] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:41,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:41,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:41,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748072963] [2024-06-04 17:48:41,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:41,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:41,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:41,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:41,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:41,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:48:41,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 138 transitions, 1432 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:41,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:41,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:48:41,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:41,787 INFO L124 PetriNetUnfolderBase]: 394/692 cut-off events. [2024-06-04 17:48:41,788 INFO L125 PetriNetUnfolderBase]: For 33851/33851 co-relation queries the response was YES. [2024-06-04 17:48:41,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4886 conditions, 692 events. 394/692 cut-off events. For 33851/33851 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2994 event pairs, 58 based on Foata normal form. 2/693 useless extension candidates. Maximal degree in co-relation 4808. Up to 605 conditions per place. [2024-06-04 17:48:41,793 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 128 selfloop transitions, 25 changer transitions 0/155 dead transitions. [2024-06-04 17:48:41,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 155 transitions, 1800 flow [2024-06-04 17:48:41,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:48:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:48:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-06-04 17:48:41,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34050179211469533 [2024-06-04 17:48:41,794 INFO L175 Difference]: Start difference. First operand has 157 places, 138 transitions, 1432 flow. Second operand 9 states and 95 transitions. [2024-06-04 17:48:41,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 155 transitions, 1800 flow [2024-06-04 17:48:41,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 155 transitions, 1752 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 17:48:41,852 INFO L231 Difference]: Finished difference. Result has 159 places, 139 transitions, 1458 flow [2024-06-04 17:48:41,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1458, PETRI_PLACES=159, PETRI_TRANSITIONS=139} [2024-06-04 17:48:41,852 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2024-06-04 17:48:41,853 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 139 transitions, 1458 flow [2024-06-04 17:48:41,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:41,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:41,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:41,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 17:48:41,853 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:41,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:41,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1971595183, now seen corresponding path program 3 times [2024-06-04 17:48:41,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:41,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153063240] [2024-06-04 17:48:41,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:41,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:46,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:46,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153063240] [2024-06-04 17:48:46,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153063240] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:46,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:46,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:46,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864765607] [2024-06-04 17:48:46,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:46,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:46,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:46,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:46,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:46,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:48:46,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 139 transitions, 1458 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:46,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:46,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:48:46,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:46,627 INFO L124 PetriNetUnfolderBase]: 398/700 cut-off events. [2024-06-04 17:48:46,627 INFO L125 PetriNetUnfolderBase]: For 35884/35884 co-relation queries the response was YES. [2024-06-04 17:48:46,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4970 conditions, 700 events. 398/700 cut-off events. For 35884/35884 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3057 event pairs, 60 based on Foata normal form. 2/701 useless extension candidates. Maximal degree in co-relation 4891. Up to 608 conditions per place. [2024-06-04 17:48:46,632 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 126 selfloop transitions, 28 changer transitions 0/156 dead transitions. [2024-06-04 17:48:46,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 156 transitions, 1832 flow [2024-06-04 17:48:46,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:48:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:48:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-04 17:48:46,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-04 17:48:46,633 INFO L175 Difference]: Start difference. First operand has 159 places, 139 transitions, 1458 flow. Second operand 9 states and 96 transitions. [2024-06-04 17:48:46,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 156 transitions, 1832 flow [2024-06-04 17:48:46,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 1768 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 17:48:46,699 INFO L231 Difference]: Finished difference. Result has 161 places, 140 transitions, 1477 flow [2024-06-04 17:48:46,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1394, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1477, PETRI_PLACES=161, PETRI_TRANSITIONS=140} [2024-06-04 17:48:46,699 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 131 predicate places. [2024-06-04 17:48:46,699 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 140 transitions, 1477 flow [2024-06-04 17:48:46,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:46,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:46,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:46,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 17:48:46,700 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:46,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:46,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1971595028, now seen corresponding path program 1 times [2024-06-04 17:48:46,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:46,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517846727] [2024-06-04 17:48:46,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:46,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:51,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:51,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517846727] [2024-06-04 17:48:51,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517846727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:51,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:51,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:51,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610533287] [2024-06-04 17:48:51,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:51,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:51,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:51,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:51,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:51,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:48:51,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 140 transitions, 1477 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:51,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:51,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:48:51,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:51,859 INFO L124 PetriNetUnfolderBase]: 396/697 cut-off events. [2024-06-04 17:48:51,859 INFO L125 PetriNetUnfolderBase]: For 35001/35001 co-relation queries the response was YES. [2024-06-04 17:48:51,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4910 conditions, 697 events. 396/697 cut-off events. For 35001/35001 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3034 event pairs, 59 based on Foata normal form. 1/697 useless extension candidates. Maximal degree in co-relation 4830. Up to 602 conditions per place. [2024-06-04 17:48:51,863 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 125 selfloop transitions, 31 changer transitions 0/158 dead transitions. [2024-06-04 17:48:51,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 158 transitions, 1888 flow [2024-06-04 17:48:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:48:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:48:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 17:48:51,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-04 17:48:51,864 INFO L175 Difference]: Start difference. First operand has 161 places, 140 transitions, 1477 flow. Second operand 9 states and 97 transitions. [2024-06-04 17:48:51,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 158 transitions, 1888 flow [2024-06-04 17:48:51,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 158 transitions, 1817 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 17:48:51,923 INFO L231 Difference]: Finished difference. Result has 163 places, 142 transitions, 1531 flow [2024-06-04 17:48:51,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1531, PETRI_PLACES=163, PETRI_TRANSITIONS=142} [2024-06-04 17:48:51,924 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 133 predicate places. [2024-06-04 17:48:51,924 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 142 transitions, 1531 flow [2024-06-04 17:48:51,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:51,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:51,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:51,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 17:48:51,924 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:51,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:51,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1705558515, now seen corresponding path program 1 times [2024-06-04 17:48:51,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:51,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114298530] [2024-06-04 17:48:51,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:51,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:48:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:48:57,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:48:57,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114298530] [2024-06-04 17:48:57,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114298530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:48:57,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:48:57,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:48:57,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274502045] [2024-06-04 17:48:57,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:48:57,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:48:57,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:48:57,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:48:57,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:48:57,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:48:57,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 142 transitions, 1531 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:57,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:48:57,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:48:57,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:48:58,126 INFO L124 PetriNetUnfolderBase]: 402/707 cut-off events. [2024-06-04 17:48:58,126 INFO L125 PetriNetUnfolderBase]: For 37439/37439 co-relation queries the response was YES. [2024-06-04 17:48:58,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5002 conditions, 707 events. 402/707 cut-off events. For 37439/37439 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3079 event pairs, 60 based on Foata normal form. 2/708 useless extension candidates. Maximal degree in co-relation 4921. Up to 618 conditions per place. [2024-06-04 17:48:58,132 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 135 selfloop transitions, 26 changer transitions 0/163 dead transitions. [2024-06-04 17:48:58,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 163 transitions, 1951 flow [2024-06-04 17:48:58,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:48:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:48:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:48:58,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-04 17:48:58,134 INFO L175 Difference]: Start difference. First operand has 163 places, 142 transitions, 1531 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:48:58,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 163 transitions, 1951 flow [2024-06-04 17:48:58,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 1855 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-04 17:48:58,203 INFO L231 Difference]: Finished difference. Result has 166 places, 144 transitions, 1534 flow [2024-06-04 17:48:58,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1534, PETRI_PLACES=166, PETRI_TRANSITIONS=144} [2024-06-04 17:48:58,203 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 136 predicate places. [2024-06-04 17:48:58,204 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 144 transitions, 1534 flow [2024-06-04 17:48:58,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:48:58,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:48:58,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:48:58,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 17:48:58,204 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:48:58,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:48:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1843936563, now seen corresponding path program 4 times [2024-06-04 17:48:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:48:58,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127252326] [2024-06-04 17:48:58,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:48:58,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:48:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:02,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:02,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127252326] [2024-06-04 17:49:02,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127252326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:02,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:02,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:02,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890266368] [2024-06-04 17:49:02,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:02,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:02,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:02,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:02,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:02,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:49:02,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 144 transitions, 1534 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:02,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:02,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:49:02,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:03,264 INFO L124 PetriNetUnfolderBase]: 406/715 cut-off events. [2024-06-04 17:49:03,264 INFO L125 PetriNetUnfolderBase]: For 39268/39268 co-relation queries the response was YES. [2024-06-04 17:49:03,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5066 conditions, 715 events. 406/715 cut-off events. For 39268/39268 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3141 event pairs, 60 based on Foata normal form. 2/716 useless extension candidates. Maximal degree in co-relation 4984. Up to 623 conditions per place. [2024-06-04 17:49:03,269 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 131 selfloop transitions, 27 changer transitions 0/160 dead transitions. [2024-06-04 17:49:03,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 160 transitions, 1916 flow [2024-06-04 17:49:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:49:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:49:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-04 17:49:03,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-04 17:49:03,270 INFO L175 Difference]: Start difference. First operand has 166 places, 144 transitions, 1534 flow. Second operand 9 states and 96 transitions. [2024-06-04 17:49:03,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 160 transitions, 1916 flow [2024-06-04 17:49:03,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 160 transitions, 1839 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-04 17:49:03,335 INFO L231 Difference]: Finished difference. Result has 167 places, 145 transitions, 1539 flow [2024-06-04 17:49:03,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1539, PETRI_PLACES=167, PETRI_TRANSITIONS=145} [2024-06-04 17:49:03,336 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places. [2024-06-04 17:49:03,336 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 145 transitions, 1539 flow [2024-06-04 17:49:03,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:03,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:03,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:03,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 17:49:03,337 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:03,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:03,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1689119177, now seen corresponding path program 5 times [2024-06-04 17:49:03,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:03,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38590749] [2024-06-04 17:49:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:03,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:07,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-04 17:49:07,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:07,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38590749] [2024-06-04 17:49:07,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38590749] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:07,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:07,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:07,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865978278] [2024-06-04 17:49:07,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:07,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:07,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:07,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:07,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:07,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:49:07,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 145 transitions, 1539 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:07,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:07,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:49:07,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:08,212 INFO L124 PetriNetUnfolderBase]: 410/723 cut-off events. [2024-06-04 17:49:08,212 INFO L125 PetriNetUnfolderBase]: For 40971/40971 co-relation queries the response was YES. [2024-06-04 17:49:08,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5129 conditions, 723 events. 410/723 cut-off events. For 40971/40971 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3191 event pairs, 58 based on Foata normal form. 2/724 useless extension candidates. Maximal degree in co-relation 5046. Up to 631 conditions per place. [2024-06-04 17:49:08,218 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 133 selfloop transitions, 26 changer transitions 0/161 dead transitions. [2024-06-04 17:49:08,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 161 transitions, 1923 flow [2024-06-04 17:49:08,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:49:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:49:08,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-06-04 17:49:08,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34050179211469533 [2024-06-04 17:49:08,220 INFO L175 Difference]: Start difference. First operand has 167 places, 145 transitions, 1539 flow. Second operand 9 states and 95 transitions. [2024-06-04 17:49:08,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 161 transitions, 1923 flow [2024-06-04 17:49:08,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 161 transitions, 1851 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-04 17:49:08,283 INFO L231 Difference]: Finished difference. Result has 169 places, 146 transitions, 1549 flow [2024-06-04 17:49:08,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1549, PETRI_PLACES=169, PETRI_TRANSITIONS=146} [2024-06-04 17:49:08,284 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 139 predicate places. [2024-06-04 17:49:08,284 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 146 transitions, 1549 flow [2024-06-04 17:49:08,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:08,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:08,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:08,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 17:49:08,285 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:08,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:08,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1694629427, now seen corresponding path program 6 times [2024-06-04 17:49:08,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:08,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166488358] [2024-06-04 17:49:08,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:08,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:12,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:12,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166488358] [2024-06-04 17:49:12,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166488358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:12,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:12,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:49:12,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023198323] [2024-06-04 17:49:12,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:12,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:49:12,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:12,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:49:12,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:49:12,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:49:12,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 146 transitions, 1549 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:12,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:12,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:49:12,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:12,922 INFO L124 PetriNetUnfolderBase]: 414/731 cut-off events. [2024-06-04 17:49:12,922 INFO L125 PetriNetUnfolderBase]: For 42630/42630 co-relation queries the response was YES. [2024-06-04 17:49:12,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5192 conditions, 731 events. 414/731 cut-off events. For 42630/42630 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3249 event pairs, 64 based on Foata normal form. 2/732 useless extension candidates. Maximal degree in co-relation 5108. Up to 690 conditions per place. [2024-06-04 17:49:12,926 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 141 selfloop transitions, 16 changer transitions 0/159 dead transitions. [2024-06-04 17:49:12,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 159 transitions, 1919 flow [2024-06-04 17:49:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:49:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:49:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-04 17:49:12,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32616487455197135 [2024-06-04 17:49:12,927 INFO L175 Difference]: Start difference. First operand has 169 places, 146 transitions, 1549 flow. Second operand 9 states and 91 transitions. [2024-06-04 17:49:12,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 159 transitions, 1919 flow [2024-06-04 17:49:12,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 159 transitions, 1847 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 17:49:12,991 INFO L231 Difference]: Finished difference. Result has 171 places, 147 transitions, 1541 flow [2024-06-04 17:49:12,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1541, PETRI_PLACES=171, PETRI_TRANSITIONS=147} [2024-06-04 17:49:12,992 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 141 predicate places. [2024-06-04 17:49:12,992 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 147 transitions, 1541 flow [2024-06-04 17:49:12,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:12,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:12,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:12,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 17:49:12,992 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:12,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:12,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2085336673, now seen corresponding path program 2 times [2024-06-04 17:49:12,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:12,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769668908] [2024-06-04 17:49:12,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:12,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:17,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-04 17:49:17,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:17,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769668908] [2024-06-04 17:49:17,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769668908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:17,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:17,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:17,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653245004] [2024-06-04 17:49:17,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:17,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:17,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:17,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:17,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:17,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:49:17,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 147 transitions, 1541 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:17,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:17,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:49:17,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:18,241 INFO L124 PetriNetUnfolderBase]: 415/733 cut-off events. [2024-06-04 17:49:18,241 INFO L125 PetriNetUnfolderBase]: For 42681/42681 co-relation queries the response was YES. [2024-06-04 17:49:18,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5147 conditions, 733 events. 415/733 cut-off events. For 42681/42681 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3259 event pairs, 60 based on Foata normal form. 2/734 useless extension candidates. Maximal degree in co-relation 5062. Up to 631 conditions per place. [2024-06-04 17:49:18,247 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 134 selfloop transitions, 30 changer transitions 0/166 dead transitions. [2024-06-04 17:49:18,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 166 transitions, 1963 flow [2024-06-04 17:49:18,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:49:18,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-04 17:49:18,248 INFO L175 Difference]: Start difference. First operand has 171 places, 147 transitions, 1541 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:49:18,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 166 transitions, 1963 flow [2024-06-04 17:49:18,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 166 transitions, 1909 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-04 17:49:18,331 INFO L231 Difference]: Finished difference. Result has 174 places, 149 transitions, 1598 flow [2024-06-04 17:49:18,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1598, PETRI_PLACES=174, PETRI_TRANSITIONS=149} [2024-06-04 17:49:18,331 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 144 predicate places. [2024-06-04 17:49:18,331 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 149 transitions, 1598 flow [2024-06-04 17:49:18,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:18,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:18,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:18,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 17:49:18,332 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:18,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:18,332 INFO L85 PathProgramCache]: Analyzing trace with hash 246520441, now seen corresponding path program 3 times [2024-06-04 17:49:18,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:18,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833168504] [2024-06-04 17:49:18,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:18,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:23,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:23,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833168504] [2024-06-04 17:49:23,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833168504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:23,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:23,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:23,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924951967] [2024-06-04 17:49:23,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:23,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:23,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:23,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:23,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:23,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:49:23,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 149 transitions, 1598 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:23,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:23,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:49:23,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:23,755 INFO L124 PetriNetUnfolderBase]: 421/743 cut-off events. [2024-06-04 17:49:23,755 INFO L125 PetriNetUnfolderBase]: For 44174/44174 co-relation queries the response was YES. [2024-06-04 17:49:23,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5247 conditions, 743 events. 421/743 cut-off events. For 44174/44174 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3326 event pairs, 64 based on Foata normal form. 2/744 useless extension candidates. Maximal degree in co-relation 5161. Up to 683 conditions per place. [2024-06-04 17:49:23,761 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 143 selfloop transitions, 22 changer transitions 0/167 dead transitions. [2024-06-04 17:49:23,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 167 transitions, 2013 flow [2024-06-04 17:49:23,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2024-06-04 17:49:23,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33548387096774196 [2024-06-04 17:49:23,762 INFO L175 Difference]: Start difference. First operand has 174 places, 149 transitions, 1598 flow. Second operand 10 states and 104 transitions. [2024-06-04 17:49:23,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 167 transitions, 2013 flow [2024-06-04 17:49:23,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 167 transitions, 1924 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-04 17:49:23,841 INFO L231 Difference]: Finished difference. Result has 177 places, 152 transitions, 1610 flow [2024-06-04 17:49:23,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1509, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1610, PETRI_PLACES=177, PETRI_TRANSITIONS=152} [2024-06-04 17:49:23,841 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 147 predicate places. [2024-06-04 17:49:23,842 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 152 transitions, 1610 flow [2024-06-04 17:49:23,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:23,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:23,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:23,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 17:49:23,842 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:23,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:23,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2090699053, now seen corresponding path program 4 times [2024-06-04 17:49:23,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:23,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504748972] [2024-06-04 17:49:23,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:23,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:27,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:27,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504748972] [2024-06-04 17:49:27,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504748972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:27,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:27,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:27,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745281495] [2024-06-04 17:49:27,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:27,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:27,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:27,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:27,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:28,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:49:28,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 152 transitions, 1610 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:28,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:28,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:49:28,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:28,437 INFO L124 PetriNetUnfolderBase]: 417/737 cut-off events. [2024-06-04 17:49:28,438 INFO L125 PetriNetUnfolderBase]: For 42414/42414 co-relation queries the response was YES. [2024-06-04 17:49:28,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5092 conditions, 737 events. 417/737 cut-off events. For 42414/42414 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3281 event pairs, 63 based on Foata normal form. 2/738 useless extension candidates. Maximal degree in co-relation 5004. Up to 660 conditions per place. [2024-06-04 17:49:28,444 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 138 selfloop transitions, 27 changer transitions 0/167 dead transitions. [2024-06-04 17:49:28,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 167 transitions, 1982 flow [2024-06-04 17:49:28,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:28,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 17:49:28,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-04 17:49:28,447 INFO L175 Difference]: Start difference. First operand has 177 places, 152 transitions, 1610 flow. Second operand 10 states and 107 transitions. [2024-06-04 17:49:28,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 167 transitions, 1982 flow [2024-06-04 17:49:28,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 167 transitions, 1910 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-04 17:49:28,538 INFO L231 Difference]: Finished difference. Result has 180 places, 152 transitions, 1597 flow [2024-06-04 17:49:28,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1597, PETRI_PLACES=180, PETRI_TRANSITIONS=152} [2024-06-04 17:49:28,539 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 150 predicate places. [2024-06-04 17:49:28,539 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 152 transitions, 1597 flow [2024-06-04 17:49:28,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:28,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:28,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:28,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 17:49:28,539 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:28,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1694844908, now seen corresponding path program 1 times [2024-06-04 17:49:28,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:28,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504062964] [2024-06-04 17:49:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:33,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:33,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504062964] [2024-06-04 17:49:33,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504062964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:33,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:33,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:33,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768322722] [2024-06-04 17:49:33,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:33,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:33,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:33,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:33,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:33,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:49:33,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 152 transitions, 1597 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:33,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:33,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:49:33,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:34,266 INFO L124 PetriNetUnfolderBase]: 421/745 cut-off events. [2024-06-04 17:49:34,267 INFO L125 PetriNetUnfolderBase]: For 43994/43994 co-relation queries the response was YES. [2024-06-04 17:49:34,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5156 conditions, 745 events. 421/745 cut-off events. For 43994/43994 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3333 event pairs, 69 based on Foata normal form. 2/746 useless extension candidates. Maximal degree in co-relation 5067. Up to 704 conditions per place. [2024-06-04 17:49:34,273 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 145 selfloop transitions, 18 changer transitions 0/165 dead transitions. [2024-06-04 17:49:34,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 165 transitions, 1971 flow [2024-06-04 17:49:34,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2024-06-04 17:49:34,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3161290322580645 [2024-06-04 17:49:34,274 INFO L175 Difference]: Start difference. First operand has 180 places, 152 transitions, 1597 flow. Second operand 10 states and 98 transitions. [2024-06-04 17:49:34,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 165 transitions, 1971 flow [2024-06-04 17:49:34,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 165 transitions, 1892 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:49:34,356 INFO L231 Difference]: Finished difference. Result has 180 places, 153 transitions, 1580 flow [2024-06-04 17:49:34,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1518, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1580, PETRI_PLACES=180, PETRI_TRANSITIONS=153} [2024-06-04 17:49:34,356 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 150 predicate places. [2024-06-04 17:49:34,357 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 153 transitions, 1580 flow [2024-06-04 17:49:34,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:34,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:34,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:34,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 17:49:34,357 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:34,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:34,357 INFO L85 PathProgramCache]: Analyzing trace with hash 645416317, now seen corresponding path program 7 times [2024-06-04 17:49:34,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:34,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130850234] [2024-06-04 17:49:34,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:34,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:38,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:38,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130850234] [2024-06-04 17:49:38,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130850234] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:38,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:38,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:49:38,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674985328] [2024-06-04 17:49:38,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:38,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:49:38,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:38,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:49:38,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:49:38,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:49:38,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 153 transitions, 1580 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:38,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:38,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:49:38,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:39,204 INFO L124 PetriNetUnfolderBase]: 425/753 cut-off events. [2024-06-04 17:49:39,204 INFO L125 PetriNetUnfolderBase]: For 45794/45794 co-relation queries the response was YES. [2024-06-04 17:49:39,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5206 conditions, 753 events. 425/753 cut-off events. For 45794/45794 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3422 event pairs, 67 based on Foata normal form. 2/754 useless extension candidates. Maximal degree in co-relation 5116. Up to 706 conditions per place. [2024-06-04 17:49:39,210 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 145 selfloop transitions, 20 changer transitions 0/167 dead transitions. [2024-06-04 17:49:39,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 167 transitions, 1970 flow [2024-06-04 17:49:39,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2024-06-04 17:49:39,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-04 17:49:39,211 INFO L175 Difference]: Start difference. First operand has 180 places, 153 transitions, 1580 flow. Second operand 10 states and 100 transitions. [2024-06-04 17:49:39,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 167 transitions, 1970 flow [2024-06-04 17:49:39,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 167 transitions, 1918 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 17:49:39,297 INFO L231 Difference]: Finished difference. Result has 182 places, 154 transitions, 1602 flow [2024-06-04 17:49:39,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1602, PETRI_PLACES=182, PETRI_TRANSITIONS=154} [2024-06-04 17:49:39,298 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 152 predicate places. [2024-06-04 17:49:39,298 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 154 transitions, 1602 flow [2024-06-04 17:49:39,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:39,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:39,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:39,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 17:49:39,298 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:39,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:39,299 INFO L85 PathProgramCache]: Analyzing trace with hash 645624079, now seen corresponding path program 5 times [2024-06-04 17:49:39,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:39,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464415029] [2024-06-04 17:49:39,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:39,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:44,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:44,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464415029] [2024-06-04 17:49:44,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464415029] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:44,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:44,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:44,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009945022] [2024-06-04 17:49:44,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:44,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:44,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:44,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:44,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:44,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:49:44,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 154 transitions, 1602 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:44,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:44,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:49:44,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:45,033 INFO L124 PetriNetUnfolderBase]: 431/764 cut-off events. [2024-06-04 17:49:45,034 INFO L125 PetriNetUnfolderBase]: For 47407/47407 co-relation queries the response was YES. [2024-06-04 17:49:45,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5277 conditions, 764 events. 431/764 cut-off events. For 47407/47407 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3485 event pairs, 68 based on Foata normal form. 2/763 useless extension candidates. Maximal degree in co-relation 5186. Up to 697 conditions per place. [2024-06-04 17:49:45,040 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 143 selfloop transitions, 25 changer transitions 0/170 dead transitions. [2024-06-04 17:49:45,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 170 transitions, 2015 flow [2024-06-04 17:49:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:49:45,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:49:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-04 17:49:45,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33225806451612905 [2024-06-04 17:49:45,041 INFO L175 Difference]: Start difference. First operand has 182 places, 154 transitions, 1602 flow. Second operand 10 states and 103 transitions. [2024-06-04 17:49:45,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 170 transitions, 2015 flow [2024-06-04 17:49:45,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 170 transitions, 1951 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-04 17:49:45,123 INFO L231 Difference]: Finished difference. Result has 185 places, 157 transitions, 1643 flow [2024-06-04 17:49:45,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1643, PETRI_PLACES=185, PETRI_TRANSITIONS=157} [2024-06-04 17:49:45,124 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 155 predicate places. [2024-06-04 17:49:45,124 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 157 transitions, 1643 flow [2024-06-04 17:49:45,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:45,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:45,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:45,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 17:49:45,125 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:45,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:45,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1420063979, now seen corresponding path program 8 times [2024-06-04 17:49:45,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:45,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664322772] [2024-06-04 17:49:45,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:45,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:49,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-04 17:49:49,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:49,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664322772] [2024-06-04 17:49:49,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664322772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:49,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:49,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:49:49,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810414333] [2024-06-04 17:49:49,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:49,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:49:49,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:49,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:49:49,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:49:49,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:49:49,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 157 transitions, 1643 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:49,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:49,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:49:49,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:49,967 INFO L124 PetriNetUnfolderBase]: 435/772 cut-off events. [2024-06-04 17:49:49,967 INFO L125 PetriNetUnfolderBase]: For 49032/49032 co-relation queries the response was YES. [2024-06-04 17:49:49,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5360 conditions, 772 events. 435/772 cut-off events. For 49032/49032 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3536 event pairs, 68 based on Foata normal form. 2/771 useless extension candidates. Maximal degree in co-relation 5267. Up to 703 conditions per place. [2024-06-04 17:49:49,974 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 141 selfloop transitions, 26 changer transitions 0/169 dead transitions. [2024-06-04 17:49:49,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 169 transitions, 2035 flow [2024-06-04 17:49:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:49:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:49:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2024-06-04 17:49:49,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 17:49:49,975 INFO L175 Difference]: Start difference. First operand has 185 places, 157 transitions, 1643 flow. Second operand 9 states and 93 transitions. [2024-06-04 17:49:49,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 169 transitions, 2035 flow [2024-06-04 17:49:50,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 169 transitions, 1973 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 17:49:50,064 INFO L231 Difference]: Finished difference. Result has 187 places, 158 transitions, 1669 flow [2024-06-04 17:49:50,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1581, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1669, PETRI_PLACES=187, PETRI_TRANSITIONS=158} [2024-06-04 17:49:50,065 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 157 predicate places. [2024-06-04 17:49:50,065 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 158 transitions, 1669 flow [2024-06-04 17:49:50,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:50,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:50,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:50,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 17:49:50,066 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:50,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:50,066 INFO L85 PathProgramCache]: Analyzing trace with hash -879367144, now seen corresponding path program 2 times [2024-06-04 17:49:50,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:50,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980378647] [2024-06-04 17:49:50,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:50,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:49:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:49:55,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:49:55,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980378647] [2024-06-04 17:49:55,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980378647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:49:55,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:49:55,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:49:55,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884314585] [2024-06-04 17:49:55,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:49:55,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:49:55,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:49:55,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:49:55,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:49:55,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:49:55,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 158 transitions, 1669 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:55,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:49:55,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:49:55,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:49:55,863 INFO L124 PetriNetUnfolderBase]: 439/779 cut-off events. [2024-06-04 17:49:55,863 INFO L125 PetriNetUnfolderBase]: For 50798/50798 co-relation queries the response was YES. [2024-06-04 17:49:55,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5437 conditions, 779 events. 439/779 cut-off events. For 50798/50798 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3577 event pairs, 71 based on Foata normal form. 2/780 useless extension candidates. Maximal degree in co-relation 5343. Up to 711 conditions per place. [2024-06-04 17:49:55,869 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 140 selfloop transitions, 32 changer transitions 0/174 dead transitions. [2024-06-04 17:49:55,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 174 transitions, 2107 flow [2024-06-04 17:49:55,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:49:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:49:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-04 17:49:55,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-04 17:49:55,870 INFO L175 Difference]: Start difference. First operand has 187 places, 158 transitions, 1669 flow. Second operand 11 states and 110 transitions. [2024-06-04 17:49:55,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 174 transitions, 2107 flow [2024-06-04 17:49:55,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 174 transitions, 2029 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 17:49:55,968 INFO L231 Difference]: Finished difference. Result has 192 places, 161 transitions, 1730 flow [2024-06-04 17:49:55,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1591, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1730, PETRI_PLACES=192, PETRI_TRANSITIONS=161} [2024-06-04 17:49:55,968 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 162 predicate places. [2024-06-04 17:49:55,968 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 161 transitions, 1730 flow [2024-06-04 17:49:55,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:49:55,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:49:55,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:49:55,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 17:49:55,969 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:49:55,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:49:55,969 INFO L85 PathProgramCache]: Analyzing trace with hash 645631798, now seen corresponding path program 3 times [2024-06-04 17:49:55,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:49:55,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753499179] [2024-06-04 17:49:55,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:49:55,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:49:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:00,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:00,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753499179] [2024-06-04 17:50:00,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753499179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:00,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:00,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:00,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305545171] [2024-06-04 17:50:00,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:00,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:00,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:00,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:00,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:50:00,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 161 transitions, 1730 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:00,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:00,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:50:00,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:01,211 INFO L124 PetriNetUnfolderBase]: 443/787 cut-off events. [2024-06-04 17:50:01,211 INFO L125 PetriNetUnfolderBase]: For 52348/52348 co-relation queries the response was YES. [2024-06-04 17:50:01,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5499 conditions, 787 events. 443/787 cut-off events. For 52348/52348 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3637 event pairs, 71 based on Foata normal form. 2/788 useless extension candidates. Maximal degree in co-relation 5403. Up to 740 conditions per place. [2024-06-04 17:50:01,217 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 151 selfloop transitions, 22 changer transitions 0/175 dead transitions. [2024-06-04 17:50:01,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 175 transitions, 2130 flow [2024-06-04 17:50:01,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:50:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:50:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2024-06-04 17:50:01,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31378299120234604 [2024-06-04 17:50:01,219 INFO L175 Difference]: Start difference. First operand has 192 places, 161 transitions, 1730 flow. Second operand 11 states and 107 transitions. [2024-06-04 17:50:01,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 175 transitions, 2130 flow [2024-06-04 17:50:01,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 175 transitions, 2020 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-04 17:50:01,333 INFO L231 Difference]: Finished difference. Result has 195 places, 162 transitions, 1694 flow [2024-06-04 17:50:01,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1694, PETRI_PLACES=195, PETRI_TRANSITIONS=162} [2024-06-04 17:50:01,333 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 165 predicate places. [2024-06-04 17:50:01,334 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 162 transitions, 1694 flow [2024-06-04 17:50:01,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:01,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:01,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:01,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 17:50:01,334 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:01,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:01,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1280305709, now seen corresponding path program 6 times [2024-06-04 17:50:01,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:01,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695958362] [2024-06-04 17:50:01,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:01,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:06,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-04 17:50:06,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:06,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695958362] [2024-06-04 17:50:06,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695958362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:06,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:06,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:06,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136847208] [2024-06-04 17:50:06,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:06,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:06,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:06,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:06,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:06,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:50:06,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 162 transitions, 1694 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:06,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:06,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:50:06,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:06,570 INFO L124 PetriNetUnfolderBase]: 449/797 cut-off events. [2024-06-04 17:50:06,570 INFO L125 PetriNetUnfolderBase]: For 54091/54091 co-relation queries the response was YES. [2024-06-04 17:50:06,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5517 conditions, 797 events. 449/797 cut-off events. For 54091/54091 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3715 event pairs, 57 based on Foata normal form. 2/798 useless extension candidates. Maximal degree in co-relation 5420. Up to 664 conditions per place. [2024-06-04 17:50:06,576 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 138 selfloop transitions, 43 changer transitions 0/183 dead transitions. [2024-06-04 17:50:06,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 183 transitions, 2156 flow [2024-06-04 17:50:06,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:50:06,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:50:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-04 17:50:06,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2024-06-04 17:50:06,578 INFO L175 Difference]: Start difference. First operand has 195 places, 162 transitions, 1694 flow. Second operand 11 states and 118 transitions. [2024-06-04 17:50:06,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 183 transitions, 2156 flow [2024-06-04 17:50:06,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 183 transitions, 2077 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-04 17:50:06,689 INFO L231 Difference]: Finished difference. Result has 199 places, 166 transitions, 1777 flow [2024-06-04 17:50:06,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1619, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1777, PETRI_PLACES=199, PETRI_TRANSITIONS=166} [2024-06-04 17:50:06,689 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 169 predicate places. [2024-06-04 17:50:06,690 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 166 transitions, 1777 flow [2024-06-04 17:50:06,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:06,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:06,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:06,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 17:50:06,690 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:06,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:06,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1086164489, now seen corresponding path program 7 times [2024-06-04 17:50:06,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:06,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591486435] [2024-06-04 17:50:06,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:06,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:11,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:11,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591486435] [2024-06-04 17:50:11,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591486435] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:11,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:11,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786278271] [2024-06-04 17:50:11,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:11,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:11,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:11,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:11,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:11,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:50:11,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 166 transitions, 1777 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:11,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:11,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:50:11,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:11,958 INFO L124 PetriNetUnfolderBase]: 445/792 cut-off events. [2024-06-04 17:50:11,958 INFO L125 PetriNetUnfolderBase]: For 51285/51285 co-relation queries the response was YES. [2024-06-04 17:50:11,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5415 conditions, 792 events. 445/792 cut-off events. For 51285/51285 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3674 event pairs, 69 based on Foata normal form. 2/791 useless extension candidates. Maximal degree in co-relation 5315. Up to 725 conditions per place. [2024-06-04 17:50:11,965 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 151 selfloop transitions, 25 changer transitions 0/178 dead transitions. [2024-06-04 17:50:11,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 178 transitions, 2161 flow [2024-06-04 17:50:11,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-04 17:50:11,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32903225806451614 [2024-06-04 17:50:11,966 INFO L175 Difference]: Start difference. First operand has 199 places, 166 transitions, 1777 flow. Second operand 10 states and 102 transitions. [2024-06-04 17:50:11,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 178 transitions, 2161 flow [2024-06-04 17:50:12,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 178 transitions, 2055 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-04 17:50:12,067 INFO L231 Difference]: Finished difference. Result has 202 places, 166 transitions, 1726 flow [2024-06-04 17:50:12,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1726, PETRI_PLACES=202, PETRI_TRANSITIONS=166} [2024-06-04 17:50:12,067 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 172 predicate places. [2024-06-04 17:50:12,068 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 166 transitions, 1726 flow [2024-06-04 17:50:12,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:12,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:12,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:12,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 17:50:12,068 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:12,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:12,068 INFO L85 PathProgramCache]: Analyzing trace with hash 99428433, now seen corresponding path program 9 times [2024-06-04 17:50:12,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:12,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047711232] [2024-06-04 17:50:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:12,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:16,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:16,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047711232] [2024-06-04 17:50:16,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047711232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:16,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:16,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:16,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504258161] [2024-06-04 17:50:16,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:16,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:16,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:16,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:16,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:16,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:50:16,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 166 transitions, 1726 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:16,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:16,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:50:16,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:17,163 INFO L124 PetriNetUnfolderBase]: 449/799 cut-off events. [2024-06-04 17:50:17,163 INFO L125 PetriNetUnfolderBase]: For 53013/53013 co-relation queries the response was YES. [2024-06-04 17:50:17,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5441 conditions, 799 events. 449/799 cut-off events. For 53013/53013 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3728 event pairs, 59 based on Foata normal form. 2/800 useless extension candidates. Maximal degree in co-relation 5340. Up to 695 conditions per place. [2024-06-04 17:50:17,170 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 149 selfloop transitions, 32 changer transitions 0/183 dead transitions. [2024-06-04 17:50:17,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 183 transitions, 2166 flow [2024-06-04 17:50:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:17,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:17,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-04 17:50:17,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:50:17,171 INFO L175 Difference]: Start difference. First operand has 202 places, 166 transitions, 1726 flow. Second operand 10 states and 105 transitions. [2024-06-04 17:50:17,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 183 transitions, 2166 flow [2024-06-04 17:50:17,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 183 transitions, 2091 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:50:17,279 INFO L231 Difference]: Finished difference. Result has 202 places, 167 transitions, 1753 flow [2024-06-04 17:50:17,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1753, PETRI_PLACES=202, PETRI_TRANSITIONS=167} [2024-06-04 17:50:17,280 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 172 predicate places. [2024-06-04 17:50:17,280 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 167 transitions, 1753 flow [2024-06-04 17:50:17,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:17,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:17,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:17,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 17:50:17,281 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:17,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:17,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1280103899, now seen corresponding path program 8 times [2024-06-04 17:50:17,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:17,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510543826] [2024-06-04 17:50:17,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:17,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:21,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:21,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510543826] [2024-06-04 17:50:21,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510543826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:21,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:21,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:21,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683061453] [2024-06-04 17:50:21,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:21,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:21,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:21,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:21,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:21,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:50:21,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 167 transitions, 1753 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:21,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:21,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:50:21,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:22,085 INFO L124 PetriNetUnfolderBase]: 445/793 cut-off events. [2024-06-04 17:50:22,085 INFO L125 PetriNetUnfolderBase]: For 50418/50418 co-relation queries the response was YES. [2024-06-04 17:50:22,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5306 conditions, 793 events. 445/793 cut-off events. For 50418/50418 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3689 event pairs, 64 based on Foata normal form. 2/794 useless extension candidates. Maximal degree in co-relation 5204. Up to 565 conditions per place. [2024-06-04 17:50:22,092 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 118 selfloop transitions, 65 changer transitions 0/185 dead transitions. [2024-06-04 17:50:22,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 185 transitions, 2299 flow [2024-06-04 17:50:22,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:50:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:50:22,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-04 17:50:22,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35777126099706746 [2024-06-04 17:50:22,095 INFO L175 Difference]: Start difference. First operand has 202 places, 167 transitions, 1753 flow. Second operand 11 states and 122 transitions. [2024-06-04 17:50:22,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 185 transitions, 2299 flow [2024-06-04 17:50:22,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 185 transitions, 2191 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-04 17:50:22,199 INFO L231 Difference]: Finished difference. Result has 205 places, 167 transitions, 1780 flow [2024-06-04 17:50:22,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1780, PETRI_PLACES=205, PETRI_TRANSITIONS=167} [2024-06-04 17:50:22,200 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 175 predicate places. [2024-06-04 17:50:22,200 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 167 transitions, 1780 flow [2024-06-04 17:50:22,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:22,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:22,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:22,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 17:50:22,201 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:22,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:22,201 INFO L85 PathProgramCache]: Analyzing trace with hash 99424713, now seen corresponding path program 10 times [2024-06-04 17:50:22,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:22,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928465063] [2024-06-04 17:50:22,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:22,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:27,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:27,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928465063] [2024-06-04 17:50:27,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928465063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:27,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:27,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:50:27,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947822457] [2024-06-04 17:50:27,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:27,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:50:27,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:27,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:50:27,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:50:27,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:50:27,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 167 transitions, 1780 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:27,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:27,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:50:27,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:27,701 INFO L124 PetriNetUnfolderBase]: 442/789 cut-off events. [2024-06-04 17:50:27,701 INFO L125 PetriNetUnfolderBase]: For 47185/47185 co-relation queries the response was YES. [2024-06-04 17:50:27,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5170 conditions, 789 events. 442/789 cut-off events. For 47185/47185 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3671 event pairs, 56 based on Foata normal form. 2/788 useless extension candidates. Maximal degree in co-relation 5067. Up to 609 conditions per place. [2024-06-04 17:50:27,707 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 134 selfloop transitions, 45 changer transitions 0/181 dead transitions. [2024-06-04 17:50:27,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 181 transitions, 2178 flow [2024-06-04 17:50:27,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:50:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:50:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-04 17:50:27,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35842293906810035 [2024-06-04 17:50:27,709 INFO L175 Difference]: Start difference. First operand has 205 places, 167 transitions, 1780 flow. Second operand 9 states and 100 transitions. [2024-06-04 17:50:27,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 181 transitions, 2178 flow [2024-06-04 17:50:27,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 181 transitions, 2013 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-04 17:50:27,821 INFO L231 Difference]: Finished difference. Result has 203 places, 167 transitions, 1709 flow [2024-06-04 17:50:27,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1615, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1709, PETRI_PLACES=203, PETRI_TRANSITIONS=167} [2024-06-04 17:50:27,822 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2024-06-04 17:50:27,822 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 167 transitions, 1709 flow [2024-06-04 17:50:27,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:27,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:27,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:27,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 17:50:27,822 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:27,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1412698658, now seen corresponding path program 4 times [2024-06-04 17:50:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:27,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292308505] [2024-06-04 17:50:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:27,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:33,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:33,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292308505] [2024-06-04 17:50:33,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292308505] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:33,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:33,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:33,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549037353] [2024-06-04 17:50:33,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:33,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:33,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:33,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:33,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:33,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:50:33,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 167 transitions, 1709 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:33,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:33,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:50:33,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:33,775 INFO L124 PetriNetUnfolderBase]: 446/796 cut-off events. [2024-06-04 17:50:33,775 INFO L125 PetriNetUnfolderBase]: For 48771/48771 co-relation queries the response was YES. [2024-06-04 17:50:33,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5171 conditions, 796 events. 446/796 cut-off events. For 48771/48771 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3718 event pairs, 79 based on Foata normal form. 2/797 useless extension candidates. Maximal degree in co-relation 5067. Up to 765 conditions per place. [2024-06-04 17:50:33,782 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 161 selfloop transitions, 15 changer transitions 0/178 dead transitions. [2024-06-04 17:50:33,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 178 transitions, 2109 flow [2024-06-04 17:50:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2024-06-04 17:50:33,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3064516129032258 [2024-06-04 17:50:33,783 INFO L175 Difference]: Start difference. First operand has 203 places, 167 transitions, 1709 flow. Second operand 10 states and 95 transitions. [2024-06-04 17:50:33,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 178 transitions, 2109 flow [2024-06-04 17:50:33,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 178 transitions, 1955 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-04 17:50:33,894 INFO L231 Difference]: Finished difference. Result has 205 places, 168 transitions, 1617 flow [2024-06-04 17:50:33,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1617, PETRI_PLACES=205, PETRI_TRANSITIONS=168} [2024-06-04 17:50:33,895 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 175 predicate places. [2024-06-04 17:50:33,895 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 168 transitions, 1617 flow [2024-06-04 17:50:33,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:33,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:33,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:33,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 17:50:33,896 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:33,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:33,896 INFO L85 PathProgramCache]: Analyzing trace with hash 99578535, now seen corresponding path program 9 times [2024-06-04 17:50:33,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:33,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019232596] [2024-06-04 17:50:33,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:33,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:38,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:38,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019232596] [2024-06-04 17:50:38,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019232596] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:38,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:38,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:38,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7705790] [2024-06-04 17:50:38,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:38,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:38,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:38,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:38,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:38,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:50:38,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 168 transitions, 1617 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:38,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:38,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:50:38,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:38,982 INFO L124 PetriNetUnfolderBase]: 442/790 cut-off events. [2024-06-04 17:50:38,982 INFO L125 PetriNetUnfolderBase]: For 44886/44886 co-relation queries the response was YES. [2024-06-04 17:50:38,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4848 conditions, 790 events. 442/790 cut-off events. For 44886/44886 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3705 event pairs, 57 based on Foata normal form. 2/791 useless extension candidates. Maximal degree in co-relation 4743. Up to 676 conditions per place. [2024-06-04 17:50:38,988 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 149 selfloop transitions, 35 changer transitions 0/186 dead transitions. [2024-06-04 17:50:38,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 186 transitions, 2039 flow [2024-06-04 17:50:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:50:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:50:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-04 17:50:38,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077 [2024-06-04 17:50:38,989 INFO L175 Difference]: Start difference. First operand has 205 places, 168 transitions, 1617 flow. Second operand 11 states and 115 transitions. [2024-06-04 17:50:38,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 186 transitions, 2039 flow [2024-06-04 17:50:39,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 186 transitions, 1983 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-04 17:50:39,120 INFO L231 Difference]: Finished difference. Result has 208 places, 168 transitions, 1636 flow [2024-06-04 17:50:39,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1636, PETRI_PLACES=208, PETRI_TRANSITIONS=168} [2024-06-04 17:50:39,121 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-04 17:50:39,121 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 168 transitions, 1636 flow [2024-06-04 17:50:39,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:39,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:39,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:39,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 17:50:39,122 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:39,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash -872225023, now seen corresponding path program 10 times [2024-06-04 17:50:39,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:39,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274161820] [2024-06-04 17:50:39,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:39,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:44,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:44,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274161820] [2024-06-04 17:50:44,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274161820] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:44,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:44,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:44,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042007201] [2024-06-04 17:50:44,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:44,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:44,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:44,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:44,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:44,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:50:44,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 168 transitions, 1636 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:44,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:44,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:50:44,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:44,555 INFO L124 PetriNetUnfolderBase]: 438/784 cut-off events. [2024-06-04 17:50:44,556 INFO L125 PetriNetUnfolderBase]: For 41187/41187 co-relation queries the response was YES. [2024-06-04 17:50:44,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4699 conditions, 784 events. 438/784 cut-off events. For 41187/41187 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3680 event pairs, 75 based on Foata normal form. 2/785 useless extension candidates. Maximal degree in co-relation 4593. Up to 748 conditions per place. [2024-06-04 17:50:44,562 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 161 selfloop transitions, 16 changer transitions 0/179 dead transitions. [2024-06-04 17:50:44,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 179 transitions, 2018 flow [2024-06-04 17:50:44,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:50:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:50:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2024-06-04 17:50:44,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31290322580645163 [2024-06-04 17:50:44,563 INFO L175 Difference]: Start difference. First operand has 208 places, 168 transitions, 1636 flow. Second operand 10 states and 97 transitions. [2024-06-04 17:50:44,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 179 transitions, 2018 flow [2024-06-04 17:50:44,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 179 transitions, 1875 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-06-04 17:50:44,643 INFO L231 Difference]: Finished difference. Result has 208 places, 168 transitions, 1530 flow [2024-06-04 17:50:44,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1493, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1530, PETRI_PLACES=208, PETRI_TRANSITIONS=168} [2024-06-04 17:50:44,643 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-04 17:50:44,644 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 168 transitions, 1530 flow [2024-06-04 17:50:44,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:44,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:44,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:44,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 17:50:44,644 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:44,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:44,645 INFO L85 PathProgramCache]: Analyzing trace with hash 889515624, now seen corresponding path program 5 times [2024-06-04 17:50:44,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:44,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570152395] [2024-06-04 17:50:44,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:44,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:49,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:49,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570152395] [2024-06-04 17:50:49,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570152395] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:49,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:49,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:49,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400400607] [2024-06-04 17:50:49,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:49,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:49,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:49,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:49,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:49,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:50:49,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 168 transitions, 1530 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:49,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:49,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:50:49,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:50,201 INFO L124 PetriNetUnfolderBase]: 442/792 cut-off events. [2024-06-04 17:50:50,201 INFO L125 PetriNetUnfolderBase]: For 42423/42423 co-relation queries the response was YES. [2024-06-04 17:50:50,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4661 conditions, 792 events. 442/792 cut-off events. For 42423/42423 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3727 event pairs, 79 based on Foata normal form. 2/793 useless extension candidates. Maximal degree in co-relation 4554. Up to 749 conditions per place. [2024-06-04 17:50:50,207 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 158 selfloop transitions, 20 changer transitions 0/180 dead transitions. [2024-06-04 17:50:50,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 180 transitions, 1938 flow [2024-06-04 17:50:50,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:50:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:50:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 103 transitions. [2024-06-04 17:50:50,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3020527859237537 [2024-06-04 17:50:50,209 INFO L175 Difference]: Start difference. First operand has 208 places, 168 transitions, 1530 flow. Second operand 11 states and 103 transitions. [2024-06-04 17:50:50,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 180 transitions, 1938 flow [2024-06-04 17:50:50,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 180 transitions, 1892 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-04 17:50:50,302 INFO L231 Difference]: Finished difference. Result has 210 places, 169 transitions, 1560 flow [2024-06-04 17:50:50,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1560, PETRI_PLACES=210, PETRI_TRANSITIONS=169} [2024-06-04 17:50:50,303 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2024-06-04 17:50:50,303 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 169 transitions, 1560 flow [2024-06-04 17:50:50,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:50,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:50,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:50,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 17:50:50,304 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:50,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:50,304 INFO L85 PathProgramCache]: Analyzing trace with hash -613343434, now seen corresponding path program 6 times [2024-06-04 17:50:50,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:50,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369541747] [2024-06-04 17:50:50,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:50,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:50:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:50:55,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:50:55,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369541747] [2024-06-04 17:50:55,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369541747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:50:55,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:50:55,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:50:55,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111407246] [2024-06-04 17:50:55,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:50:55,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:50:55,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:50:55,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:50:55,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:50:55,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:50:55,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 169 transitions, 1560 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:55,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:50:55,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:50:55,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:50:56,016 INFO L124 PetriNetUnfolderBase]: 439/787 cut-off events. [2024-06-04 17:50:56,016 INFO L125 PetriNetUnfolderBase]: For 38510/38510 co-relation queries the response was YES. [2024-06-04 17:50:56,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4509 conditions, 787 events. 439/787 cut-off events. For 38510/38510 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3717 event pairs, 76 based on Foata normal form. 2/788 useless extension candidates. Maximal degree in co-relation 4401. Up to 730 conditions per place. [2024-06-04 17:50:56,022 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 158 selfloop transitions, 21 changer transitions 0/181 dead transitions. [2024-06-04 17:50:56,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 181 transitions, 1944 flow [2024-06-04 17:50:56,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:50:56,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:50:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2024-06-04 17:50:56,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30498533724340177 [2024-06-04 17:50:56,023 INFO L175 Difference]: Start difference. First operand has 210 places, 169 transitions, 1560 flow. Second operand 11 states and 104 transitions. [2024-06-04 17:50:56,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 181 transitions, 1944 flow [2024-06-04 17:50:56,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 181 transitions, 1880 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-04 17:50:56,119 INFO L231 Difference]: Finished difference. Result has 212 places, 169 transitions, 1542 flow [2024-06-04 17:50:56,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1542, PETRI_PLACES=212, PETRI_TRANSITIONS=169} [2024-06-04 17:50:56,120 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 182 predicate places. [2024-06-04 17:50:56,120 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 169 transitions, 1542 flow [2024-06-04 17:50:56,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:50:56,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:50:56,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:50:56,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 17:50:56,121 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:50:56,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:50:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1655043330, now seen corresponding path program 1 times [2024-06-04 17:50:56,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:50:56,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772699698] [2024-06-04 17:50:56,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:50:56,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:50:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:00,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:00,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772699698] [2024-06-04 17:51:00,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772699698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:00,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:00,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:00,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526558946] [2024-06-04 17:51:00,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:00,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:00,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:00,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:00,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:00,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:51:00,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 169 transitions, 1542 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:00,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:00,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:51:00,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:01,100 INFO L124 PetriNetUnfolderBase]: 443/795 cut-off events. [2024-06-04 17:51:01,101 INFO L125 PetriNetUnfolderBase]: For 38474/38474 co-relation queries the response was YES. [2024-06-04 17:51:01,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4544 conditions, 795 events. 443/795 cut-off events. For 38474/38474 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3763 event pairs, 56 based on Foata normal form. 2/796 useless extension candidates. Maximal degree in co-relation 4435. Up to 701 conditions per place. [2024-06-04 17:51:01,108 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 167 selfloop transitions, 19 changer transitions 0/188 dead transitions. [2024-06-04 17:51:01,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 188 transitions, 1990 flow [2024-06-04 17:51:01,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2024-06-04 17:51:01,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3258064516129032 [2024-06-04 17:51:01,109 INFO L175 Difference]: Start difference. First operand has 212 places, 169 transitions, 1542 flow. Second operand 10 states and 101 transitions. [2024-06-04 17:51:01,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 188 transitions, 1990 flow [2024-06-04 17:51:01,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 188 transitions, 1895 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-04 17:51:01,215 INFO L231 Difference]: Finished difference. Result has 212 places, 170 transitions, 1521 flow [2024-06-04 17:51:01,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1447, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1521, PETRI_PLACES=212, PETRI_TRANSITIONS=170} [2024-06-04 17:51:01,216 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 182 predicate places. [2024-06-04 17:51:01,216 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 170 transitions, 1521 flow [2024-06-04 17:51:01,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:01,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:01,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:01,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 17:51:01,217 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:01,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:01,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1596950880, now seen corresponding path program 2 times [2024-06-04 17:51:01,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:01,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774876423] [2024-06-04 17:51:01,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:01,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:05,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:05,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774876423] [2024-06-04 17:51:05,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774876423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:05,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:05,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:05,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630807320] [2024-06-04 17:51:05,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:05,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:05,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:05,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:05,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:05,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:51:05,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 170 transitions, 1521 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:05,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:05,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:51:05,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:06,357 INFO L124 PetriNetUnfolderBase]: 447/803 cut-off events. [2024-06-04 17:51:06,358 INFO L125 PetriNetUnfolderBase]: For 39526/39526 co-relation queries the response was YES. [2024-06-04 17:51:06,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4581 conditions, 803 events. 447/803 cut-off events. For 39526/39526 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3831 event pairs, 63 based on Foata normal form. 2/804 useless extension candidates. Maximal degree in co-relation 4471. Up to 708 conditions per place. [2024-06-04 17:51:06,363 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 161 selfloop transitions, 26 changer transitions 0/189 dead transitions. [2024-06-04 17:51:06,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 189 transitions, 1975 flow [2024-06-04 17:51:06,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-04 17:51:06,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33225806451612905 [2024-06-04 17:51:06,364 INFO L175 Difference]: Start difference. First operand has 212 places, 170 transitions, 1521 flow. Second operand 10 states and 103 transitions. [2024-06-04 17:51:06,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 189 transitions, 1975 flow [2024-06-04 17:51:06,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 189 transitions, 1911 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-04 17:51:06,469 INFO L231 Difference]: Finished difference. Result has 214 places, 171 transitions, 1547 flow [2024-06-04 17:51:06,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1547, PETRI_PLACES=214, PETRI_TRANSITIONS=171} [2024-06-04 17:51:06,470 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 184 predicate places. [2024-06-04 17:51:06,470 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 171 transitions, 1547 flow [2024-06-04 17:51:06,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:06,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:06,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:06,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 17:51:06,471 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:06,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:06,471 INFO L85 PathProgramCache]: Analyzing trace with hash -989907566, now seen corresponding path program 3 times [2024-06-04 17:51:06,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:06,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205689402] [2024-06-04 17:51:06,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:06,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:10,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:10,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205689402] [2024-06-04 17:51:10,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205689402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:10,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:10,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:10,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619951077] [2024-06-04 17:51:10,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:10,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:10,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:10,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:10,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:10,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:51:10,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 171 transitions, 1547 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:10,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:10,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:51:10,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:11,384 INFO L124 PetriNetUnfolderBase]: 458/824 cut-off events. [2024-06-04 17:51:11,384 INFO L125 PetriNetUnfolderBase]: For 48035/48035 co-relation queries the response was YES. [2024-06-04 17:51:11,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4917 conditions, 824 events. 458/824 cut-off events. For 48035/48035 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 3974 event pairs, 66 based on Foata normal form. 2/825 useless extension candidates. Maximal degree in co-relation 4806. Up to 702 conditions per place. [2024-06-04 17:51:11,391 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 158 selfloop transitions, 32 changer transitions 0/192 dead transitions. [2024-06-04 17:51:11,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 192 transitions, 2193 flow [2024-06-04 17:51:11,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 17:51:11,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-04 17:51:11,392 INFO L175 Difference]: Start difference. First operand has 214 places, 171 transitions, 1547 flow. Second operand 10 states and 107 transitions. [2024-06-04 17:51:11,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 192 transitions, 2193 flow [2024-06-04 17:51:11,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 192 transitions, 2113 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 17:51:11,510 INFO L231 Difference]: Finished difference. Result has 216 places, 173 transitions, 1605 flow [2024-06-04 17:51:11,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1605, PETRI_PLACES=216, PETRI_TRANSITIONS=173} [2024-06-04 17:51:11,511 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 186 predicate places. [2024-06-04 17:51:11,511 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 173 transitions, 1605 flow [2024-06-04 17:51:11,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:11,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:11,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:11,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 17:51:11,512 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:11,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:11,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1586720860, now seen corresponding path program 1 times [2024-06-04 17:51:11,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:11,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541358385] [2024-06-04 17:51:11,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:11,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:16,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:16,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541358385] [2024-06-04 17:51:16,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541358385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:16,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:16,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:16,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696116248] [2024-06-04 17:51:16,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:16,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:16,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:16,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:16,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:16,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:51:16,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 173 transitions, 1605 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:16,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:16,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:51:16,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:16,615 INFO L124 PetriNetUnfolderBase]: 456/821 cut-off events. [2024-06-04 17:51:16,615 INFO L125 PetriNetUnfolderBase]: For 43578/43578 co-relation queries the response was YES. [2024-06-04 17:51:16,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4801 conditions, 821 events. 456/821 cut-off events. For 43578/43578 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 3958 event pairs, 67 based on Foata normal form. 1/821 useless extension candidates. Maximal degree in co-relation 4689. Up to 715 conditions per place. [2024-06-04 17:51:16,622 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 154 selfloop transitions, 35 changer transitions 0/191 dead transitions. [2024-06-04 17:51:16,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 191 transitions, 2037 flow [2024-06-04 17:51:16,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:51:16,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-04 17:51:16,623 INFO L175 Difference]: Start difference. First operand has 216 places, 173 transitions, 1605 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:51:16,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 191 transitions, 2037 flow [2024-06-04 17:51:16,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 191 transitions, 1945 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-04 17:51:16,738 INFO L231 Difference]: Finished difference. Result has 220 places, 173 transitions, 1591 flow [2024-06-04 17:51:16,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1591, PETRI_PLACES=220, PETRI_TRANSITIONS=173} [2024-06-04 17:51:16,739 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 190 predicate places. [2024-06-04 17:51:16,739 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 173 transitions, 1591 flow [2024-06-04 17:51:16,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:16,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:16,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:16,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 17:51:16,739 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:16,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:16,740 INFO L85 PathProgramCache]: Analyzing trace with hash 792289134, now seen corresponding path program 4 times [2024-06-04 17:51:16,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:16,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866108439] [2024-06-04 17:51:16,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:16,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:21,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:21,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866108439] [2024-06-04 17:51:21,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866108439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:21,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:21,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:21,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974490937] [2024-06-04 17:51:21,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:21,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:21,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:21,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:21,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:21,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:51:21,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 173 transitions, 1591 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:21,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:21,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:51:21,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:21,829 INFO L124 PetriNetUnfolderBase]: 453/816 cut-off events. [2024-06-04 17:51:21,830 INFO L125 PetriNetUnfolderBase]: For 41077/41077 co-relation queries the response was YES. [2024-06-04 17:51:21,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4595 conditions, 816 events. 453/816 cut-off events. For 41077/41077 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 3930 event pairs, 66 based on Foata normal form. 2/817 useless extension candidates. Maximal degree in co-relation 4481. Up to 713 conditions per place. [2024-06-04 17:51:21,837 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 157 selfloop transitions, 32 changer transitions 0/191 dead transitions. [2024-06-04 17:51:21,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 191 transitions, 2021 flow [2024-06-04 17:51:21,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-04 17:51:21,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:51:21,840 INFO L175 Difference]: Start difference. First operand has 220 places, 173 transitions, 1591 flow. Second operand 10 states and 105 transitions. [2024-06-04 17:51:21,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 191 transitions, 2021 flow [2024-06-04 17:51:21,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 191 transitions, 1843 flow, removed 24 selfloop flow, removed 11 redundant places. [2024-06-04 17:51:21,961 INFO L231 Difference]: Finished difference. Result has 219 places, 173 transitions, 1482 flow [2024-06-04 17:51:21,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1413, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1482, PETRI_PLACES=219, PETRI_TRANSITIONS=173} [2024-06-04 17:51:21,962 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 189 predicate places. [2024-06-04 17:51:21,962 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 173 transitions, 1482 flow [2024-06-04 17:51:21,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:21,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:21,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:21,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 17:51:21,962 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:21,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1702191768, now seen corresponding path program 1 times [2024-06-04 17:51:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:21,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120385852] [2024-06-04 17:51:21,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:21,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:26,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:26,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120385852] [2024-06-04 17:51:26,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120385852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:26,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:26,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:26,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706301597] [2024-06-04 17:51:26,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:26,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:26,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:26,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:26,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:27,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:51:27,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 173 transitions, 1482 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:27,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:27,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:51:27,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:27,471 INFO L124 PetriNetUnfolderBase]: 469/852 cut-off events. [2024-06-04 17:51:27,472 INFO L125 PetriNetUnfolderBase]: For 62903/62903 co-relation queries the response was YES. [2024-06-04 17:51:27,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4562 conditions, 852 events. 469/852 cut-off events. For 62903/62903 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4145 event pairs, 72 based on Foata normal form. 10/861 useless extension candidates. Maximal degree in co-relation 4449. Up to 721 conditions per place. [2024-06-04 17:51:27,477 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 162 selfloop transitions, 23 changer transitions 11/198 dead transitions. [2024-06-04 17:51:27,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 198 transitions, 1980 flow [2024-06-04 17:51:27,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-04 17:51:27,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-04 17:51:27,478 INFO L175 Difference]: Start difference. First operand has 219 places, 173 transitions, 1482 flow. Second operand 11 states and 117 transitions. [2024-06-04 17:51:27,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 198 transitions, 1980 flow [2024-06-04 17:51:27,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 198 transitions, 1885 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 17:51:27,597 INFO L231 Difference]: Finished difference. Result has 220 places, 170 transitions, 1410 flow [2024-06-04 17:51:27,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1410, PETRI_PLACES=220, PETRI_TRANSITIONS=170} [2024-06-04 17:51:27,598 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 190 predicate places. [2024-06-04 17:51:27,598 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 170 transitions, 1410 flow [2024-06-04 17:51:27,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:27,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:27,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:27,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 17:51:27,598 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:27,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:27,598 INFO L85 PathProgramCache]: Analyzing trace with hash -954235930, now seen corresponding path program 5 times [2024-06-04 17:51:27,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:27,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493278892] [2024-06-04 17:51:27,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:27,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:32,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-04 17:51:32,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:32,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493278892] [2024-06-04 17:51:32,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493278892] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:32,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:32,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042572452] [2024-06-04 17:51:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:32,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:32,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:32,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:32,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:32,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:51:32,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 170 transitions, 1410 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:32,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:32,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:51:32,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:32,920 INFO L124 PetriNetUnfolderBase]: 447/810 cut-off events. [2024-06-04 17:51:32,920 INFO L125 PetriNetUnfolderBase]: For 42418/42418 co-relation queries the response was YES. [2024-06-04 17:51:32,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4370 conditions, 810 events. 447/810 cut-off events. For 42418/42418 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3902 event pairs, 66 based on Foata normal form. 2/811 useless extension candidates. Maximal degree in co-relation 4257. Up to 727 conditions per place. [2024-06-04 17:51:32,926 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 156 selfloop transitions, 28 changer transitions 0/186 dead transitions. [2024-06-04 17:51:32,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 186 transitions, 1854 flow [2024-06-04 17:51:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:51:32,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-04 17:51:32,928 INFO L175 Difference]: Start difference. First operand has 220 places, 170 transitions, 1410 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:51:32,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 186 transitions, 1854 flow [2024-06-04 17:51:33,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 186 transitions, 1802 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:51:33,045 INFO L231 Difference]: Finished difference. Result has 217 places, 171 transitions, 1456 flow [2024-06-04 17:51:33,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1456, PETRI_PLACES=217, PETRI_TRANSITIONS=171} [2024-06-04 17:51:33,046 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 187 predicate places. [2024-06-04 17:51:33,046 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 171 transitions, 1456 flow [2024-06-04 17:51:33,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:33,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:33,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:33,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 17:51:33,046 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:33,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:33,047 INFO L85 PathProgramCache]: Analyzing trace with hash -954240580, now seen corresponding path program 6 times [2024-06-04 17:51:33,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:33,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989061832] [2024-06-04 17:51:33,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:33,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:37,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:37,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989061832] [2024-06-04 17:51:37,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989061832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:37,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:37,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:51:37,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594091498] [2024-06-04 17:51:37,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:37,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:51:37,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:37,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:51:37,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:51:37,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:51:37,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 171 transitions, 1456 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:37,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:37,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:51:37,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:37,923 INFO L124 PetriNetUnfolderBase]: 487/890 cut-off events. [2024-06-04 17:51:37,923 INFO L125 PetriNetUnfolderBase]: For 77918/77918 co-relation queries the response was YES. [2024-06-04 17:51:37,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5731 conditions, 890 events. 487/890 cut-off events. For 77918/77918 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4393 event pairs, 80 based on Foata normal form. 2/891 useless extension candidates. Maximal degree in co-relation 5619. Up to 719 conditions per place. [2024-06-04 17:51:37,931 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 161 selfloop transitions, 30 changer transitions 0/193 dead transitions. [2024-06-04 17:51:37,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 193 transitions, 2146 flow [2024-06-04 17:51:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-04 17:51:37,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-04 17:51:37,932 INFO L175 Difference]: Start difference. First operand has 217 places, 171 transitions, 1456 flow. Second operand 10 states and 111 transitions. [2024-06-04 17:51:37,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 193 transitions, 2146 flow [2024-06-04 17:51:38,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 193 transitions, 2058 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-04 17:51:38,114 INFO L231 Difference]: Finished difference. Result has 219 places, 173 transitions, 1510 flow [2024-06-04 17:51:38,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1510, PETRI_PLACES=219, PETRI_TRANSITIONS=173} [2024-06-04 17:51:38,114 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 189 predicate places. [2024-06-04 17:51:38,114 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 173 transitions, 1510 flow [2024-06-04 17:51:38,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:38,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:38,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:38,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 17:51:38,115 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:38,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:38,115 INFO L85 PathProgramCache]: Analyzing trace with hash -954056006, now seen corresponding path program 2 times [2024-06-04 17:51:38,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:38,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460780374] [2024-06-04 17:51:38,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:38,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:42,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:42,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460780374] [2024-06-04 17:51:42,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460780374] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:42,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:42,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:42,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9327318] [2024-06-04 17:51:42,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:42,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:42,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:42,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:42,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:42,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:51:42,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 173 transitions, 1510 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:42,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:42,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:51:42,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:43,270 INFO L124 PetriNetUnfolderBase]: 503/926 cut-off events. [2024-06-04 17:51:43,270 INFO L125 PetriNetUnfolderBase]: For 102641/102641 co-relation queries the response was YES. [2024-06-04 17:51:43,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5846 conditions, 926 events. 503/926 cut-off events. For 102641/102641 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4623 event pairs, 88 based on Foata normal form. 10/935 useless extension candidates. Maximal degree in co-relation 5733. Up to 797 conditions per place. [2024-06-04 17:51:43,278 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 154 selfloop transitions, 22 changer transitions 16/194 dead transitions. [2024-06-04 17:51:43,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 194 transitions, 1980 flow [2024-06-04 17:51:43,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:51:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:51:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-04 17:51:43,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489736070381232 [2024-06-04 17:51:43,279 INFO L175 Difference]: Start difference. First operand has 219 places, 173 transitions, 1510 flow. Second operand 11 states and 119 transitions. [2024-06-04 17:51:43,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 194 transitions, 1980 flow [2024-06-04 17:51:43,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 194 transitions, 1900 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-04 17:51:43,492 INFO L231 Difference]: Finished difference. Result has 224 places, 167 transitions, 1430 flow [2024-06-04 17:51:43,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1430, PETRI_PLACES=224, PETRI_TRANSITIONS=167} [2024-06-04 17:51:43,493 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 194 predicate places. [2024-06-04 17:51:43,493 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 167 transitions, 1430 flow [2024-06-04 17:51:43,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:43,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:43,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:43,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 17:51:43,494 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:43,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:43,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1124938360, now seen corresponding path program 7 times [2024-06-04 17:51:43,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:43,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644101457] [2024-06-04 17:51:43,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:43,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:48,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-04 17:51:48,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:48,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644101457] [2024-06-04 17:51:48,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644101457] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:48,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:48,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:51:48,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755818759] [2024-06-04 17:51:48,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:48,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:51:48,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:48,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:51:48,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:51:48,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:51:48,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 167 transitions, 1430 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:48,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:48,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:51:48,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:48,736 INFO L124 PetriNetUnfolderBase]: 471/866 cut-off events. [2024-06-04 17:51:48,736 INFO L125 PetriNetUnfolderBase]: For 81084/81084 co-relation queries the response was YES. [2024-06-04 17:51:48,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5618 conditions, 866 events. 471/866 cut-off events. For 81084/81084 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4247 event pairs, 86 based on Foata normal form. 2/867 useless extension candidates. Maximal degree in co-relation 5503. Up to 766 conditions per place. [2024-06-04 17:51:48,743 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 154 selfloop transitions, 29 changer transitions 0/185 dead transitions. [2024-06-04 17:51:48,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 185 transitions, 1886 flow [2024-06-04 17:51:48,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-04 17:51:48,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:51:48,744 INFO L175 Difference]: Start difference. First operand has 224 places, 167 transitions, 1430 flow. Second operand 10 states and 105 transitions. [2024-06-04 17:51:48,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 185 transitions, 1886 flow [2024-06-04 17:51:48,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 185 transitions, 1828 flow, removed 7 selfloop flow, removed 11 redundant places. [2024-06-04 17:51:48,937 INFO L231 Difference]: Finished difference. Result has 217 places, 168 transitions, 1476 flow [2024-06-04 17:51:48,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1374, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1476, PETRI_PLACES=217, PETRI_TRANSITIONS=168} [2024-06-04 17:51:48,938 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 187 predicate places. [2024-06-04 17:51:48,938 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 168 transitions, 1476 flow [2024-06-04 17:51:48,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:48,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:48,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:48,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 17:51:48,938 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:48,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:48,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1000339388, now seen corresponding path program 8 times [2024-06-04 17:51:48,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:48,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987341] [2024-06-04 17:51:48,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:48,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:53,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987341] [2024-06-04 17:51:53,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:53,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:53,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:51:53,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308889584] [2024-06-04 17:51:53,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:53,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:51:53,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:53,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:51:53,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:51:53,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:51:53,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 168 transitions, 1476 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:53,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:53,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:51:53,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:53,711 INFO L124 PetriNetUnfolderBase]: 455/838 cut-off events. [2024-06-04 17:51:53,712 INFO L125 PetriNetUnfolderBase]: For 69434/69434 co-relation queries the response was YES. [2024-06-04 17:51:53,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4543 conditions, 838 events. 455/838 cut-off events. For 69434/69434 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4111 event pairs, 74 based on Foata normal form. 12/849 useless extension candidates. Maximal degree in co-relation 4431. Up to 729 conditions per place. [2024-06-04 17:51:53,718 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 158 selfloop transitions, 20 changer transitions 7/187 dead transitions. [2024-06-04 17:51:53,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 187 transitions, 1926 flow [2024-06-04 17:51:53,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-04 17:51:53,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646 [2024-06-04 17:51:53,719 INFO L175 Difference]: Start difference. First operand has 217 places, 168 transitions, 1476 flow. Second operand 10 states and 109 transitions. [2024-06-04 17:51:53,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 187 transitions, 1926 flow [2024-06-04 17:51:53,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 187 transitions, 1812 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-04 17:51:53,845 INFO L231 Difference]: Finished difference. Result has 219 places, 165 transitions, 1382 flow [2024-06-04 17:51:53,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1362, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1382, PETRI_PLACES=219, PETRI_TRANSITIONS=165} [2024-06-04 17:51:53,845 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 189 predicate places. [2024-06-04 17:51:53,845 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 165 transitions, 1382 flow [2024-06-04 17:51:53,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:53,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:53,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:53,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 17:51:53,846 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:53,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash -947560886, now seen corresponding path program 3 times [2024-06-04 17:51:53,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:53,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409869401] [2024-06-04 17:51:53,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:53,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:51:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:51:57,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:51:57,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409869401] [2024-06-04 17:51:57,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409869401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:51:57,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:51:57,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:51:57,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802668487] [2024-06-04 17:51:57,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:51:57,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:51:57,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:51:57,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:51:57,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:51:58,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:51:58,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 165 transitions, 1382 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:58,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:51:58,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:51:58,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:51:58,441 INFO L124 PetriNetUnfolderBase]: 472/877 cut-off events. [2024-06-04 17:51:58,441 INFO L125 PetriNetUnfolderBase]: For 86908/86908 co-relation queries the response was YES. [2024-06-04 17:51:58,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5294 conditions, 877 events. 472/877 cut-off events. For 86908/86908 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4340 event pairs, 83 based on Foata normal form. 8/884 useless extension candidates. Maximal degree in co-relation 5181. Up to 709 conditions per place. [2024-06-04 17:51:58,448 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 162 selfloop transitions, 16 changer transitions 8/188 dead transitions. [2024-06-04 17:51:58,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 188 transitions, 2014 flow [2024-06-04 17:51:58,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:51:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:51:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-04 17:51:58,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-04 17:51:58,450 INFO L175 Difference]: Start difference. First operand has 219 places, 165 transitions, 1382 flow. Second operand 10 states and 111 transitions. [2024-06-04 17:51:58,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 188 transitions, 2014 flow [2024-06-04 17:51:58,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 188 transitions, 1962 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-04 17:51:58,657 INFO L231 Difference]: Finished difference. Result has 218 places, 162 transitions, 1344 flow [2024-06-04 17:51:58,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1344, PETRI_PLACES=218, PETRI_TRANSITIONS=162} [2024-06-04 17:51:58,657 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 188 predicate places. [2024-06-04 17:51:58,658 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 162 transitions, 1344 flow [2024-06-04 17:51:58,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:51:58,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:51:58,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:51:58,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 17:51:58,658 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:51:58,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:51:58,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1124943010, now seen corresponding path program 9 times [2024-06-04 17:51:58,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:51:58,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463633669] [2024-06-04 17:51:58,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:51:58,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:51:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:03,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:03,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:03,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463633669] [2024-06-04 17:52:03,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463633669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:03,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:03,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:03,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363871336] [2024-06-04 17:52:03,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:03,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:03,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:03,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:03,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:03,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:52:03,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 162 transitions, 1344 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:03,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:03,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:52:03,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:03,804 INFO L124 PetriNetUnfolderBase]: 457/844 cut-off events. [2024-06-04 17:52:03,804 INFO L125 PetriNetUnfolderBase]: For 72651/72651 co-relation queries the response was YES. [2024-06-04 17:52:03,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5230 conditions, 844 events. 457/844 cut-off events. For 72651/72651 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4146 event pairs, 83 based on Foata normal form. 2/845 useless extension candidates. Maximal degree in co-relation 5117. Up to 730 conditions per place. [2024-06-04 17:52:03,812 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 148 selfloop transitions, 30 changer transitions 0/180 dead transitions. [2024-06-04 17:52:03,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 180 transitions, 1788 flow [2024-06-04 17:52:03,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:52:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:52:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:52:03,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-04 17:52:03,813 INFO L175 Difference]: Start difference. First operand has 218 places, 162 transitions, 1344 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:52:03,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 180 transitions, 1788 flow [2024-06-04 17:52:04,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 180 transitions, 1753 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:52:04,003 INFO L231 Difference]: Finished difference. Result has 215 places, 163 transitions, 1415 flow [2024-06-04 17:52:04,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1415, PETRI_PLACES=215, PETRI_TRANSITIONS=163} [2024-06-04 17:52:04,004 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 185 predicate places. [2024-06-04 17:52:04,004 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 163 transitions, 1415 flow [2024-06-04 17:52:04,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:04,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:04,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:04,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 17:52:04,004 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:04,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:04,005 INFO L85 PathProgramCache]: Analyzing trace with hash -947799896, now seen corresponding path program 4 times [2024-06-04 17:52:04,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:04,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986480930] [2024-06-04 17:52:04,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:04,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:08,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-04 17:52:08,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:08,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986480930] [2024-06-04 17:52:08,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986480930] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:08,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:08,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:52:08,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194350330] [2024-06-04 17:52:08,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:08,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:52:08,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:08,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:52:08,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:52:08,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:52:08,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 163 transitions, 1415 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:08,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:08,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:52:08,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:08,651 INFO L124 PetriNetUnfolderBase]: 444/821 cut-off events. [2024-06-04 17:52:08,651 INFO L125 PetriNetUnfolderBase]: For 63612/63612 co-relation queries the response was YES. [2024-06-04 17:52:08,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4416 conditions, 821 events. 444/821 cut-off events. For 63612/63612 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4037 event pairs, 74 based on Foata normal form. 10/830 useless extension candidates. Maximal degree in co-relation 4305. Up to 717 conditions per place. [2024-06-04 17:52:08,657 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 151 selfloop transitions, 12 changer transitions 18/183 dead transitions. [2024-06-04 17:52:08,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 183 transitions, 1859 flow [2024-06-04 17:52:08,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:52:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:52:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-04 17:52:08,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 17:52:08,658 INFO L175 Difference]: Start difference. First operand has 215 places, 163 transitions, 1415 flow. Second operand 11 states and 124 transitions. [2024-06-04 17:52:08,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 183 transitions, 1859 flow [2024-06-04 17:52:08,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 183 transitions, 1763 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-04 17:52:08,796 INFO L231 Difference]: Finished difference. Result has 218 places, 156 transitions, 1292 flow [2024-06-04 17:52:08,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1292, PETRI_PLACES=218, PETRI_TRANSITIONS=156} [2024-06-04 17:52:08,796 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 188 predicate places. [2024-06-04 17:52:08,796 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 156 transitions, 1292 flow [2024-06-04 17:52:08,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:08,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:08,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:08,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-04 17:52:08,797 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:08,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:08,797 INFO L85 PathProgramCache]: Analyzing trace with hash 823087898, now seen corresponding path program 10 times [2024-06-04 17:52:08,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:08,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592594966] [2024-06-04 17:52:08,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:08,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:13,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:13,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592594966] [2024-06-04 17:52:13,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592594966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:13,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:13,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:13,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465122972] [2024-06-04 17:52:13,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:13,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:13,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:13,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:13,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:13,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:52:13,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 156 transitions, 1292 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:13,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:13,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:52:13,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:13,740 INFO L124 PetriNetUnfolderBase]: 413/760 cut-off events. [2024-06-04 17:52:13,740 INFO L125 PetriNetUnfolderBase]: For 42786/42786 co-relation queries the response was YES. [2024-06-04 17:52:13,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4115 conditions, 760 events. 413/760 cut-off events. For 42786/42786 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3642 event pairs, 60 based on Foata normal form. 2/761 useless extension candidates. Maximal degree in co-relation 4003. Up to 660 conditions per place. [2024-06-04 17:52:13,746 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 145 selfloop transitions, 27 changer transitions 0/174 dead transitions. [2024-06-04 17:52:13,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 174 transitions, 1724 flow [2024-06-04 17:52:13,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:52:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:52:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-04 17:52:13,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33225806451612905 [2024-06-04 17:52:13,747 INFO L175 Difference]: Start difference. First operand has 218 places, 156 transitions, 1292 flow. Second operand 10 states and 103 transitions. [2024-06-04 17:52:13,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 174 transitions, 1724 flow [2024-06-04 17:52:13,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 174 transitions, 1680 flow, removed 10 selfloop flow, removed 11 redundant places. [2024-06-04 17:52:13,853 INFO L231 Difference]: Finished difference. Result has 208 places, 157 transitions, 1350 flow [2024-06-04 17:52:13,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1350, PETRI_PLACES=208, PETRI_TRANSITIONS=157} [2024-06-04 17:52:13,854 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-04 17:52:13,854 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 157 transitions, 1350 flow [2024-06-04 17:52:13,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:13,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:13,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:13,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-04 17:52:13,854 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:13,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:13,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1120289786, now seen corresponding path program 5 times [2024-06-04 17:52:13,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:13,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845236847] [2024-06-04 17:52:13,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:13,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:18,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:18,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:18,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845236847] [2024-06-04 17:52:18,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845236847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:18,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:18,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:18,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394805963] [2024-06-04 17:52:18,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:18,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:18,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:18,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:18,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:18,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:52:18,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 157 transitions, 1350 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:18,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:18,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:52:18,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:19,260 INFO L124 PetriNetUnfolderBase]: 429/796 cut-off events. [2024-06-04 17:52:19,260 INFO L125 PetriNetUnfolderBase]: For 58716/58716 co-relation queries the response was YES. [2024-06-04 17:52:19,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4223 conditions, 796 events. 429/796 cut-off events. For 58716/58716 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3870 event pairs, 72 based on Foata normal form. 10/805 useless extension candidates. Maximal degree in co-relation 4115. Up to 602 conditions per place. [2024-06-04 17:52:19,266 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 134 selfloop transitions, 28 changer transitions 16/180 dead transitions. [2024-06-04 17:52:19,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 180 transitions, 1800 flow [2024-06-04 17:52:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:52:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:52:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-04 17:52:19,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-04 17:52:19,268 INFO L175 Difference]: Start difference. First operand has 208 places, 157 transitions, 1350 flow. Second operand 11 states and 121 transitions. [2024-06-04 17:52:19,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 180 transitions, 1800 flow [2024-06-04 17:52:19,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 180 transitions, 1701 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-04 17:52:19,375 INFO L231 Difference]: Finished difference. Result has 210 places, 151 transitions, 1276 flow [2024-06-04 17:52:19,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1276, PETRI_PLACES=210, PETRI_TRANSITIONS=151} [2024-06-04 17:52:19,376 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2024-06-04 17:52:19,376 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 151 transitions, 1276 flow [2024-06-04 17:52:19,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:19,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:19,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:19,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-04 17:52:19,376 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:19,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:19,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1035548740, now seen corresponding path program 11 times [2024-06-04 17:52:19,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:19,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407810852] [2024-06-04 17:52:19,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:19,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:23,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:23,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407810852] [2024-06-04 17:52:23,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407810852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:23,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:23,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:52:23,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935947442] [2024-06-04 17:52:23,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:23,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:52:23,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:23,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:52:23,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:52:23,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:52:23,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 151 transitions, 1276 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:23,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:23,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:52:23,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:24,172 INFO L124 PetriNetUnfolderBase]: 413/773 cut-off events. [2024-06-04 17:52:24,172 INFO L125 PetriNetUnfolderBase]: For 65631/65631 co-relation queries the response was YES. [2024-06-04 17:52:24,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4116 conditions, 773 events. 413/773 cut-off events. For 65631/65631 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3743 event pairs, 67 based on Foata normal form. 12/782 useless extension candidates. Maximal degree in co-relation 4008. Up to 641 conditions per place. [2024-06-04 17:52:24,178 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 133 selfloop transitions, 27 changer transitions 7/169 dead transitions. [2024-06-04 17:52:24,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 169 transitions, 1720 flow [2024-06-04 17:52:24,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:52:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:52:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-04 17:52:24,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-04 17:52:24,179 INFO L175 Difference]: Start difference. First operand has 210 places, 151 transitions, 1276 flow. Second operand 10 states and 108 transitions. [2024-06-04 17:52:24,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 169 transitions, 1720 flow [2024-06-04 17:52:24,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 169 transitions, 1648 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-06-04 17:52:24,273 INFO L231 Difference]: Finished difference. Result has 203 places, 149 transitions, 1281 flow [2024-06-04 17:52:24,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1281, PETRI_PLACES=203, PETRI_TRANSITIONS=149} [2024-06-04 17:52:24,273 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2024-06-04 17:52:24,273 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 149 transitions, 1281 flow [2024-06-04 17:52:24,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:24,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:24,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:24,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-04 17:52:24,274 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:24,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:24,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1035541796, now seen corresponding path program 6 times [2024-06-04 17:52:24,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:24,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278688085] [2024-06-04 17:52:24,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:24,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:28,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-04 17:52:28,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:28,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278688085] [2024-06-04 17:52:28,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278688085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:28,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:28,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:28,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099841946] [2024-06-04 17:52:28,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:28,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:28,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:28,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:28,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:28,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:52:28,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 149 transitions, 1281 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:28,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:28,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:52:28,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:29,135 INFO L124 PetriNetUnfolderBase]: 405/760 cut-off events. [2024-06-04 17:52:29,136 INFO L125 PetriNetUnfolderBase]: For 55274/55274 co-relation queries the response was YES. [2024-06-04 17:52:29,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4009 conditions, 760 events. 405/760 cut-off events. For 55274/55274 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3669 event pairs, 66 based on Foata normal form. 10/769 useless extension candidates. Maximal degree in co-relation 3904. Up to 631 conditions per place. [2024-06-04 17:52:29,142 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 131 selfloop transitions, 22 changer transitions 16/171 dead transitions. [2024-06-04 17:52:29,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 171 transitions, 1703 flow [2024-06-04 17:52:29,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:52:29,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:52:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2024-06-04 17:52:29,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:52:29,143 INFO L175 Difference]: Start difference. First operand has 203 places, 149 transitions, 1281 flow. Second operand 12 states and 126 transitions. [2024-06-04 17:52:29,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 171 transitions, 1703 flow [2024-06-04 17:52:29,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 171 transitions, 1611 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-06-04 17:52:29,243 INFO L231 Difference]: Finished difference. Result has 205 places, 143 transitions, 1192 flow [2024-06-04 17:52:29,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1192, PETRI_PLACES=205, PETRI_TRANSITIONS=143} [2024-06-04 17:52:29,244 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 175 predicate places. [2024-06-04 17:52:29,244 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 143 transitions, 1192 flow [2024-06-04 17:52:29,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:29,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:29,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:29,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-04 17:52:29,244 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:29,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:29,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1035302786, now seen corresponding path program 7 times [2024-06-04 17:52:29,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:29,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955875733] [2024-06-04 17:52:29,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:29,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:33,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:33,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955875733] [2024-06-04 17:52:33,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955875733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:33,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:33,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:52:33,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623006391] [2024-06-04 17:52:33,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:33,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:52:33,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:33,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:52:33,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:52:33,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:52:33,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 143 transitions, 1192 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:33,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:33,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:52:33,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:34,183 INFO L124 PetriNetUnfolderBase]: 419/795 cut-off events. [2024-06-04 17:52:34,183 INFO L125 PetriNetUnfolderBase]: For 81490/81490 co-relation queries the response was YES. [2024-06-04 17:52:34,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4969 conditions, 795 events. 419/795 cut-off events. For 81490/81490 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3857 event pairs, 77 based on Foata normal form. 8/800 useless extension candidates. Maximal degree in co-relation 4864. Up to 613 conditions per place. [2024-06-04 17:52:34,190 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 135 selfloop transitions, 19 changer transitions 9/165 dead transitions. [2024-06-04 17:52:34,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 165 transitions, 1794 flow [2024-06-04 17:52:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:52:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:52:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-04 17:52:34,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646 [2024-06-04 17:52:34,191 INFO L175 Difference]: Start difference. First operand has 205 places, 143 transitions, 1192 flow. Second operand 10 states and 109 transitions. [2024-06-04 17:52:34,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 165 transitions, 1794 flow [2024-06-04 17:52:34,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 165 transitions, 1726 flow, removed 12 selfloop flow, removed 12 redundant places. [2024-06-04 17:52:34,308 INFO L231 Difference]: Finished difference. Result has 197 places, 139 transitions, 1153 flow [2024-06-04 17:52:34,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1153, PETRI_PLACES=197, PETRI_TRANSITIONS=139} [2024-06-04 17:52:34,308 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 167 predicate places. [2024-06-04 17:52:34,308 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 139 transitions, 1153 flow [2024-06-04 17:52:34,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:34,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:34,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:34,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-04 17:52:34,309 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:34,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:34,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1065875686, now seen corresponding path program 12 times [2024-06-04 17:52:34,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:34,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214150088] [2024-06-04 17:52:34,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:34,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:38,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-04 17:52:38,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:38,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214150088] [2024-06-04 17:52:38,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214150088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:38,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:38,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:52:38,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064905126] [2024-06-04 17:52:38,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:38,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:52:38,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:38,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:52:38,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:52:38,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:52:38,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 139 transitions, 1153 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:38,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:38,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:52:38,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:39,207 INFO L124 PetriNetUnfolderBase]: 419/794 cut-off events. [2024-06-04 17:52:39,207 INFO L125 PetriNetUnfolderBase]: For 84438/84438 co-relation queries the response was YES. [2024-06-04 17:52:39,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4918 conditions, 794 events. 419/794 cut-off events. For 84438/84438 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3869 event pairs, 80 based on Foata normal form. 12/805 useless extension candidates. Maximal degree in co-relation 4816. Up to 589 conditions per place. [2024-06-04 17:52:39,213 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 109 selfloop transitions, 43 changer transitions 7/161 dead transitions. [2024-06-04 17:52:39,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 161 transitions, 1587 flow [2024-06-04 17:52:39,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:52:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:52:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-04 17:52:39,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36656891495601174 [2024-06-04 17:52:39,214 INFO L175 Difference]: Start difference. First operand has 197 places, 139 transitions, 1153 flow. Second operand 11 states and 125 transitions. [2024-06-04 17:52:39,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 161 transitions, 1587 flow [2024-06-04 17:52:39,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 161 transitions, 1540 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-04 17:52:39,333 INFO L231 Difference]: Finished difference. Result has 193 places, 137 transitions, 1209 flow [2024-06-04 17:52:39,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1209, PETRI_PLACES=193, PETRI_TRANSITIONS=137} [2024-06-04 17:52:39,333 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 163 predicate places. [2024-06-04 17:52:39,333 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 137 transitions, 1209 flow [2024-06-04 17:52:39,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:39,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:39,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:39,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-04 17:52:39,334 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:39,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:39,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1575253694, now seen corresponding path program 8 times [2024-06-04 17:52:39,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:39,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710671604] [2024-06-04 17:52:39,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:39,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:44,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:44,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710671604] [2024-06-04 17:52:44,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710671604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:44,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:44,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:44,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722581001] [2024-06-04 17:52:44,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:44,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:44,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:44,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:44,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:44,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:52:44,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 137 transitions, 1209 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:44,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:44,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:52:44,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:44,824 INFO L124 PetriNetUnfolderBase]: 411/783 cut-off events. [2024-06-04 17:52:44,825 INFO L125 PetriNetUnfolderBase]: For 73044/73044 co-relation queries the response was YES. [2024-06-04 17:52:44,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4857 conditions, 783 events. 411/783 cut-off events. For 73044/73044 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3826 event pairs, 83 based on Foata normal form. 10/790 useless extension candidates. Maximal degree in co-relation 4758. Up to 627 conditions per place. [2024-06-04 17:52:44,831 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 114 selfloop transitions, 32 changer transitions 9/157 dead transitions. [2024-06-04 17:52:44,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 157 transitions, 1599 flow [2024-06-04 17:52:44,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:52:44,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:52:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-04 17:52:44,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3519061583577713 [2024-06-04 17:52:44,832 INFO L175 Difference]: Start difference. First operand has 193 places, 137 transitions, 1209 flow. Second operand 11 states and 120 transitions. [2024-06-04 17:52:44,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 157 transitions, 1599 flow [2024-06-04 17:52:44,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 157 transitions, 1479 flow, removed 15 selfloop flow, removed 11 redundant places. [2024-06-04 17:52:44,952 INFO L231 Difference]: Finished difference. Result has 193 places, 134 transitions, 1135 flow [2024-06-04 17:52:44,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1135, PETRI_PLACES=193, PETRI_TRANSITIONS=134} [2024-06-04 17:52:44,953 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 163 predicate places. [2024-06-04 17:52:44,953 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 134 transitions, 1135 flow [2024-06-04 17:52:44,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:44,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:44,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:44,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-04 17:52:44,953 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:44,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:44,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1466925040, now seen corresponding path program 13 times [2024-06-04 17:52:44,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:44,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736915062] [2024-06-04 17:52:44,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:44,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:49,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:49,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736915062] [2024-06-04 17:52:49,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736915062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:49,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:49,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:52:49,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357137228] [2024-06-04 17:52:49,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:49,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:52:49,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:49,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:52:49,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:52:49,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:52:49,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 134 transitions, 1135 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:49,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:49,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:52:49,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:49,842 INFO L124 PetriNetUnfolderBase]: 382/727 cut-off events. [2024-06-04 17:52:49,842 INFO L125 PetriNetUnfolderBase]: For 53544/53544 co-relation queries the response was YES. [2024-06-04 17:52:49,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4419 conditions, 727 events. 382/727 cut-off events. For 53544/53544 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3471 event pairs, 77 based on Foata normal form. 2/728 useless extension candidates. Maximal degree in co-relation 4320. Up to 664 conditions per place. [2024-06-04 17:52:49,848 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 126 selfloop transitions, 23 changer transitions 0/151 dead transitions. [2024-06-04 17:52:49,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 151 transitions, 1509 flow [2024-06-04 17:52:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:52:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:52:49,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2024-06-04 17:52:49,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3255131964809384 [2024-06-04 17:52:49,849 INFO L175 Difference]: Start difference. First operand has 193 places, 134 transitions, 1135 flow. Second operand 11 states and 111 transitions. [2024-06-04 17:52:49,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 151 transitions, 1509 flow [2024-06-04 17:52:49,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 151 transitions, 1439 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-04 17:52:49,955 INFO L231 Difference]: Finished difference. Result has 191 places, 135 transitions, 1151 flow [2024-06-04 17:52:49,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1151, PETRI_PLACES=191, PETRI_TRANSITIONS=135} [2024-06-04 17:52:49,955 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 161 predicate places. [2024-06-04 17:52:49,955 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 135 transitions, 1151 flow [2024-06-04 17:52:49,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:49,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:49,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:49,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-04 17:52:49,956 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:49,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash -148341404, now seen corresponding path program 14 times [2024-06-04 17:52:49,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:49,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965616272] [2024-06-04 17:52:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:49,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:54,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:54,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965616272] [2024-06-04 17:52:54,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965616272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:54,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:54,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:52:54,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966269864] [2024-06-04 17:52:54,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:54,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:52:54,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:54,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:52:54,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:52:54,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:52:54,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 135 transitions, 1151 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:54,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:54,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:52:54,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:55,002 INFO L124 PetriNetUnfolderBase]: 386/735 cut-off events. [2024-06-04 17:52:55,002 INFO L125 PetriNetUnfolderBase]: For 52593/52593 co-relation queries the response was YES. [2024-06-04 17:52:55,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4469 conditions, 735 events. 386/735 cut-off events. For 52593/52593 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3523 event pairs, 77 based on Foata normal form. 2/736 useless extension candidates. Maximal degree in co-relation 4371. Up to 658 conditions per place. [2024-06-04 17:52:55,009 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 126 selfloop transitions, 24 changer transitions 0/152 dead transitions. [2024-06-04 17:52:55,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 152 transitions, 1527 flow [2024-06-04 17:52:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:52:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:52:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2024-06-04 17:52:55,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3284457478005865 [2024-06-04 17:52:55,010 INFO L175 Difference]: Start difference. First operand has 191 places, 135 transitions, 1151 flow. Second operand 11 states and 112 transitions. [2024-06-04 17:52:55,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 152 transitions, 1527 flow [2024-06-04 17:52:55,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 152 transitions, 1451 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-04 17:52:55,121 INFO L231 Difference]: Finished difference. Result has 193 places, 136 transitions, 1165 flow [2024-06-04 17:52:55,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1165, PETRI_PLACES=193, PETRI_TRANSITIONS=136} [2024-06-04 17:52:55,122 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 163 predicate places. [2024-06-04 17:52:55,122 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 136 transitions, 1165 flow [2024-06-04 17:52:55,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:55,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:55,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:55,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-04 17:52:55,123 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:52:55,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:55,123 INFO L85 PathProgramCache]: Analyzing trace with hash -319039184, now seen corresponding path program 15 times [2024-06-04 17:52:55,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:55,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327593491] [2024-06-04 17:52:55,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:55,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:59,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:59,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327593491] [2024-06-04 17:52:59,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327593491] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:59,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:59,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:52:59,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274979827] [2024-06-04 17:52:59,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:59,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:52:59,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:59,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:52:59,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:52:59,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:52:59,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 136 transitions, 1165 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:59,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:59,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:52:59,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:00,083 INFO L124 PetriNetUnfolderBase]: 390/744 cut-off events. [2024-06-04 17:53:00,083 INFO L125 PetriNetUnfolderBase]: For 54249/54249 co-relation queries the response was YES. [2024-06-04 17:53:00,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4533 conditions, 744 events. 390/744 cut-off events. For 54249/54249 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3583 event pairs, 86 based on Foata normal form. 2/743 useless extension candidates. Maximal degree in co-relation 4434. Up to 631 conditions per place. [2024-06-04 17:53:00,089 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 117 selfloop transitions, 33 changer transitions 0/152 dead transitions. [2024-06-04 17:53:00,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 152 transitions, 1547 flow [2024-06-04 17:53:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:53:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:53:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2024-06-04 17:53:00,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33548387096774196 [2024-06-04 17:53:00,090 INFO L175 Difference]: Start difference. First operand has 193 places, 136 transitions, 1165 flow. Second operand 10 states and 104 transitions. [2024-06-04 17:53:00,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 152 transitions, 1547 flow [2024-06-04 17:53:00,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 152 transitions, 1467 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-04 17:53:00,197 INFO L231 Difference]: Finished difference. Result has 194 places, 137 transitions, 1195 flow [2024-06-04 17:53:00,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1195, PETRI_PLACES=194, PETRI_TRANSITIONS=137} [2024-06-04 17:53:00,197 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 164 predicate places. [2024-06-04 17:53:00,198 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 137 transitions, 1195 flow [2024-06-04 17:53:00,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:00,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:00,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:00,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-04 17:53:00,198 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:00,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:00,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1490576942, now seen corresponding path program 9 times [2024-06-04 17:53:00,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:00,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557134314] [2024-06-04 17:53:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:00,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:04,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:04,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557134314] [2024-06-04 17:53:04,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557134314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:04,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:04,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:53:04,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066556053] [2024-06-04 17:53:04,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:04,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:53:04,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:04,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:53:04,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:53:04,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:53:04,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 137 transitions, 1195 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:04,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:04,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:53:04,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:04,960 INFO L124 PetriNetUnfolderBase]: 438/844 cut-off events. [2024-06-04 17:53:04,960 INFO L125 PetriNetUnfolderBase]: For 96093/96093 co-relation queries the response was YES. [2024-06-04 17:53:04,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5765 conditions, 844 events. 438/844 cut-off events. For 96093/96093 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4227 event pairs, 100 based on Foata normal form. 8/849 useless extension candidates. Maximal degree in co-relation 5665. Up to 572 conditions per place. [2024-06-04 17:53:04,966 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 114 selfloop transitions, 36 changer transitions 8/160 dead transitions. [2024-06-04 17:53:04,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 160 transitions, 1785 flow [2024-06-04 17:53:04,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:53:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:53:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-04 17:53:04,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2024-06-04 17:53:04,967 INFO L175 Difference]: Start difference. First operand has 194 places, 137 transitions, 1195 flow. Second operand 10 states and 117 transitions. [2024-06-04 17:53:04,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 160 transitions, 1785 flow [2024-06-04 17:53:05,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 160 transitions, 1685 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-04 17:53:05,138 INFO L231 Difference]: Finished difference. Result has 196 places, 134 transitions, 1152 flow [2024-06-04 17:53:05,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1152, PETRI_PLACES=196, PETRI_TRANSITIONS=134} [2024-06-04 17:53:05,138 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 166 predicate places. [2024-06-04 17:53:05,138 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 134 transitions, 1152 flow [2024-06-04 17:53:05,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:05,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:05,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:05,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-04 17:53:05,139 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:05,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:05,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1568817660, now seen corresponding path program 16 times [2024-06-04 17:53:05,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:05,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697481957] [2024-06-04 17:53:05,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:05,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:09,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:09,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697481957] [2024-06-04 17:53:09,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697481957] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:09,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:09,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:53:09,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38726889] [2024-06-04 17:53:09,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:09,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:53:09,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:09,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:53:09,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:53:09,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:53:09,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 134 transitions, 1152 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:09,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:09,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:53:09,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:09,815 INFO L124 PetriNetUnfolderBase]: 416/797 cut-off events. [2024-06-04 17:53:09,815 INFO L125 PetriNetUnfolderBase]: For 79676/79676 co-relation queries the response was YES. [2024-06-04 17:53:09,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5405 conditions, 797 events. 416/797 cut-off events. For 79676/79676 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3920 event pairs, 96 based on Foata normal form. 2/798 useless extension candidates. Maximal degree in co-relation 5304. Up to 651 conditions per place. [2024-06-04 17:53:09,820 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 106 selfloop transitions, 44 changer transitions 0/152 dead transitions. [2024-06-04 17:53:09,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 152 transitions, 1538 flow [2024-06-04 17:53:09,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:53:09,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:53:09,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-04 17:53:09,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3519061583577713 [2024-06-04 17:53:09,821 INFO L175 Difference]: Start difference. First operand has 196 places, 134 transitions, 1152 flow. Second operand 11 states and 120 transitions. [2024-06-04 17:53:09,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 152 transitions, 1538 flow [2024-06-04 17:53:09,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 152 transitions, 1466 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:53:09,977 INFO L231 Difference]: Finished difference. Result has 195 places, 135 transitions, 1214 flow [2024-06-04 17:53:09,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1214, PETRI_PLACES=195, PETRI_TRANSITIONS=135} [2024-06-04 17:53:09,978 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 165 predicate places. [2024-06-04 17:53:09,978 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 135 transitions, 1214 flow [2024-06-04 17:53:09,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:09,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:09,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:09,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-04 17:53:09,979 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:09,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:09,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1466745116, now seen corresponding path program 10 times [2024-06-04 17:53:09,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:09,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779971249] [2024-06-04 17:53:09,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:09,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:14,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:14,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779971249] [2024-06-04 17:53:14,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779971249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:14,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:14,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:53:14,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620935497] [2024-06-04 17:53:14,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:14,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:53:14,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:14,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:53:14,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:53:14,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:53:14,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 135 transitions, 1214 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:14,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:14,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:53:14,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:15,318 INFO L124 PetriNetUnfolderBase]: 418/807 cut-off events. [2024-06-04 17:53:15,318 INFO L125 PetriNetUnfolderBase]: For 87128/87128 co-relation queries the response was YES. [2024-06-04 17:53:15,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5165 conditions, 807 events. 418/807 cut-off events. For 87128/87128 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3987 event pairs, 98 based on Foata normal form. 10/816 useless extension candidates. Maximal degree in co-relation 5065. Up to 702 conditions per place. [2024-06-04 17:53:15,324 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 125 selfloop transitions, 20 changer transitions 9/156 dead transitions. [2024-06-04 17:53:15,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 156 transitions, 1602 flow [2024-06-04 17:53:15,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:53:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:53:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2024-06-04 17:53:15,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32526881720430106 [2024-06-04 17:53:15,325 INFO L175 Difference]: Start difference. First operand has 195 places, 135 transitions, 1214 flow. Second operand 12 states and 121 transitions. [2024-06-04 17:53:15,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 156 transitions, 1602 flow [2024-06-04 17:53:15,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 156 transitions, 1478 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-06-04 17:53:15,461 INFO L231 Difference]: Finished difference. Result has 198 places, 132 transitions, 1110 flow [2024-06-04 17:53:15,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1110, PETRI_PLACES=198, PETRI_TRANSITIONS=132} [2024-06-04 17:53:15,462 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 168 predicate places. [2024-06-04 17:53:15,462 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 132 transitions, 1110 flow [2024-06-04 17:53:15,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:15,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:15,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:15,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-04 17:53:15,462 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:15,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:15,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1212684910, now seen corresponding path program 17 times [2024-06-04 17:53:15,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:15,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284092502] [2024-06-04 17:53:15,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:15,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:20,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:20,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284092502] [2024-06-04 17:53:20,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284092502] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:20,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:20,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:53:20,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114355961] [2024-06-04 17:53:20,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:20,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:53:20,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:20,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:53:20,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:53:20,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:53:20,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 132 transitions, 1110 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:20,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:20,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:53:20,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:20,848 INFO L124 PetriNetUnfolderBase]: 396/765 cut-off events. [2024-06-04 17:53:20,848 INFO L125 PetriNetUnfolderBase]: For 71402/71402 co-relation queries the response was YES. [2024-06-04 17:53:20,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4960 conditions, 765 events. 396/765 cut-off events. For 71402/71402 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3735 event pairs, 92 based on Foata normal form. 2/766 useless extension candidates. Maximal degree in co-relation 4859. Up to 639 conditions per place. [2024-06-04 17:53:20,881 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 114 selfloop transitions, 35 changer transitions 0/151 dead transitions. [2024-06-04 17:53:20,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 151 transitions, 1500 flow [2024-06-04 17:53:20,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:53:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:53:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-04 17:53:20,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077 [2024-06-04 17:53:20,882 INFO L175 Difference]: Start difference. First operand has 198 places, 132 transitions, 1110 flow. Second operand 11 states and 115 transitions. [2024-06-04 17:53:20,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 151 transitions, 1500 flow [2024-06-04 17:53:21,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 151 transitions, 1454 flow, removed 2 selfloop flow, removed 12 redundant places. [2024-06-04 17:53:21,030 INFO L231 Difference]: Finished difference. Result has 195 places, 133 transitions, 1182 flow [2024-06-04 17:53:21,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1182, PETRI_PLACES=195, PETRI_TRANSITIONS=133} [2024-06-04 17:53:21,031 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 165 predicate places. [2024-06-04 17:53:21,031 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 133 transitions, 1182 flow [2024-06-04 17:53:21,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:21,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:21,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:21,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-04 17:53:21,032 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:21,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:21,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1072309426, now seen corresponding path program 18 times [2024-06-04 17:53:21,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:21,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810444215] [2024-06-04 17:53:21,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:21,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:25,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:25,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810444215] [2024-06-04 17:53:25,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810444215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:25,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:25,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:53:25,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551756436] [2024-06-04 17:53:25,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:25,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:53:25,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:25,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:53:25,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:53:25,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:53:25,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 133 transitions, 1182 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:25,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:25,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:53:25,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:25,941 INFO L124 PetriNetUnfolderBase]: 436/846 cut-off events. [2024-06-04 17:53:25,941 INFO L125 PetriNetUnfolderBase]: For 97256/97256 co-relation queries the response was YES. [2024-06-04 17:53:25,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6240 conditions, 846 events. 436/846 cut-off events. For 97256/97256 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4260 event pairs, 109 based on Foata normal form. 2/845 useless extension candidates. Maximal degree in co-relation 6140. Up to 613 conditions per place. [2024-06-04 17:53:25,947 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 108 selfloop transitions, 44 changer transitions 0/154 dead transitions. [2024-06-04 17:53:25,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 154 transitions, 1782 flow [2024-06-04 17:53:25,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:53:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:53:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 17:53:25,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-04 17:53:25,948 INFO L175 Difference]: Start difference. First operand has 195 places, 133 transitions, 1182 flow. Second operand 10 states and 115 transitions. [2024-06-04 17:53:25,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 154 transitions, 1782 flow [2024-06-04 17:53:26,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 154 transitions, 1674 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-04 17:53:26,129 INFO L231 Difference]: Finished difference. Result has 196 places, 135 transitions, 1256 flow [2024-06-04 17:53:26,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1256, PETRI_PLACES=196, PETRI_TRANSITIONS=135} [2024-06-04 17:53:26,130 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 166 predicate places. [2024-06-04 17:53:26,130 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 135 transitions, 1256 flow [2024-06-04 17:53:26,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:26,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:26,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:26,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-04 17:53:26,131 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:26,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:26,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1212800230, now seen corresponding path program 19 times [2024-06-04 17:53:26,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:26,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000985826] [2024-06-04 17:53:26,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:26,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:30,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:30,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000985826] [2024-06-04 17:53:30,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000985826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:30,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:30,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:53:30,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484250398] [2024-06-04 17:53:30,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:30,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:53:30,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:30,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:53:30,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:53:31,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:53:31,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 135 transitions, 1256 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:31,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:31,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:53:31,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:31,400 INFO L124 PetriNetUnfolderBase]: 433/841 cut-off events. [2024-06-04 17:53:31,400 INFO L125 PetriNetUnfolderBase]: For 95458/95458 co-relation queries the response was YES. [2024-06-04 17:53:31,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6044 conditions, 841 events. 433/841 cut-off events. For 95458/95458 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4207 event pairs, 118 based on Foata normal form. 2/840 useless extension candidates. Maximal degree in co-relation 5943. Up to 728 conditions per place. [2024-06-04 17:53:31,408 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 117 selfloop transitions, 31 changer transitions 0/150 dead transitions. [2024-06-04 17:53:31,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 150 transitions, 1592 flow [2024-06-04 17:53:31,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:53:31,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:53:31,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-04 17:53:31,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32903225806451614 [2024-06-04 17:53:31,409 INFO L175 Difference]: Start difference. First operand has 196 places, 135 transitions, 1256 flow. Second operand 10 states and 102 transitions. [2024-06-04 17:53:31,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 150 transitions, 1592 flow [2024-06-04 17:53:31,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 150 transitions, 1471 flow, removed 28 selfloop flow, removed 8 redundant places. [2024-06-04 17:53:31,610 INFO L231 Difference]: Finished difference. Result has 198 places, 135 transitions, 1201 flow [2024-06-04 17:53:31,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1201, PETRI_PLACES=198, PETRI_TRANSITIONS=135} [2024-06-04 17:53:31,611 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 168 predicate places. [2024-06-04 17:53:31,611 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 135 transitions, 1201 flow [2024-06-04 17:53:31,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:31,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:31,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:31,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-04 17:53:31,612 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:31,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:31,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1632978896, now seen corresponding path program 11 times [2024-06-04 17:53:31,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:31,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071551047] [2024-06-04 17:53:31,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:31,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:36,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:36,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071551047] [2024-06-04 17:53:36,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071551047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:36,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:36,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:53:36,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043830249] [2024-06-04 17:53:36,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:36,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:53:36,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:36,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:53:36,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:53:36,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:53:36,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 135 transitions, 1201 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:36,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:36,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:53:36,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:37,093 INFO L124 PetriNetUnfolderBase]: 449/876 cut-off events. [2024-06-04 17:53:37,094 INFO L125 PetriNetUnfolderBase]: For 115249/115249 co-relation queries the response was YES. [2024-06-04 17:53:37,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6114 conditions, 876 events. 449/876 cut-off events. For 115249/115249 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4469 event pairs, 119 based on Foata normal form. 10/885 useless extension candidates. Maximal degree in co-relation 6013. Up to 720 conditions per place. [2024-06-04 17:53:37,101 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 114 selfloop transitions, 32 changer transitions 11/159 dead transitions. [2024-06-04 17:53:37,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 159 transitions, 1609 flow [2024-06-04 17:53:37,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:53:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:53:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2024-06-04 17:53:37,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:53:37,104 INFO L175 Difference]: Start difference. First operand has 198 places, 135 transitions, 1201 flow. Second operand 12 states and 126 transitions. [2024-06-04 17:53:37,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 159 transitions, 1609 flow [2024-06-04 17:53:37,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 159 transitions, 1450 flow, removed 20 selfloop flow, removed 12 redundant places. [2024-06-04 17:53:37,312 INFO L231 Difference]: Finished difference. Result has 198 places, 132 transitions, 1089 flow [2024-06-04 17:53:37,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1089, PETRI_PLACES=198, PETRI_TRANSITIONS=132} [2024-06-04 17:53:37,312 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 168 predicate places. [2024-06-04 17:53:37,312 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 132 transitions, 1089 flow [2024-06-04 17:53:37,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:37,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:37,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:37,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-04 17:53:37,313 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:37,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:37,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1072124852, now seen corresponding path program 12 times [2024-06-04 17:53:37,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:37,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132562871] [2024-06-04 17:53:37,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:37,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:42,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:42,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132562871] [2024-06-04 17:53:42,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132562871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:42,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:42,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:53:42,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037494133] [2024-06-04 17:53:42,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:42,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:53:42,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:42,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:53:42,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:53:42,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:53:42,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 132 transitions, 1089 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:42,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:42,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:53:42,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:42,658 INFO L124 PetriNetUnfolderBase]: 425/836 cut-off events. [2024-06-04 17:53:42,658 INFO L125 PetriNetUnfolderBase]: For 107779/107779 co-relation queries the response was YES. [2024-06-04 17:53:42,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5492 conditions, 836 events. 425/836 cut-off events. For 107779/107779 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4232 event pairs, 111 based on Foata normal form. 10/845 useless extension candidates. Maximal degree in co-relation 5394. Up to 681 conditions per place. [2024-06-04 17:53:42,665 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 112 selfloop transitions, 31 changer transitions 9/154 dead transitions. [2024-06-04 17:53:42,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 154 transitions, 1477 flow [2024-06-04 17:53:42,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:53:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:53:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-04 17:53:42,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-04 17:53:42,666 INFO L175 Difference]: Start difference. First operand has 198 places, 132 transitions, 1089 flow. Second operand 12 states and 128 transitions. [2024-06-04 17:53:42,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 154 transitions, 1477 flow [2024-06-04 17:53:42,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 154 transitions, 1386 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-04 17:53:42,841 INFO L231 Difference]: Finished difference. Result has 195 places, 129 transitions, 1046 flow [2024-06-04 17:53:42,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1046, PETRI_PLACES=195, PETRI_TRANSITIONS=129} [2024-06-04 17:53:42,841 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 165 predicate places. [2024-06-04 17:53:42,841 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 129 transitions, 1046 flow [2024-06-04 17:53:42,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:42,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:42,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:42,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-04 17:53:42,842 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:42,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1418948644, now seen corresponding path program 13 times [2024-06-04 17:53:42,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:42,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230814797] [2024-06-04 17:53:42,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:47,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:47,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:47,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230814797] [2024-06-04 17:53:47,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230814797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:47,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:47,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:53:47,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563310335] [2024-06-04 17:53:47,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:47,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:53:47,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:47,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:53:47,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:53:47,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:53:47,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 129 transitions, 1046 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:47,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:47,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:53:47,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:47,790 INFO L124 PetriNetUnfolderBase]: 440/873 cut-off events. [2024-06-04 17:53:47,790 INFO L125 PetriNetUnfolderBase]: For 123048/123048 co-relation queries the response was YES. [2024-06-04 17:53:47,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6190 conditions, 873 events. 440/873 cut-off events. For 123048/123048 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4486 event pairs, 125 based on Foata normal form. 8/880 useless extension candidates. Maximal degree in co-relation 6094. Up to 627 conditions per place. [2024-06-04 17:53:47,796 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 122 selfloop transitions, 16 changer transitions 9/149 dead transitions. [2024-06-04 17:53:47,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 149 transitions, 1568 flow [2024-06-04 17:53:47,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:53:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:53:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 17:53:47,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-04 17:53:47,797 INFO L175 Difference]: Start difference. First operand has 195 places, 129 transitions, 1046 flow. Second operand 10 states and 107 transitions. [2024-06-04 17:53:47,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 149 transitions, 1568 flow [2024-06-04 17:53:47,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 149 transitions, 1496 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-04 17:53:47,988 INFO L231 Difference]: Finished difference. Result has 191 places, 125 transitions, 984 flow [2024-06-04 17:53:47,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=984, PETRI_PLACES=191, PETRI_TRANSITIONS=125} [2024-06-04 17:53:47,989 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 161 predicate places. [2024-06-04 17:53:47,989 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 125 transitions, 984 flow [2024-06-04 17:53:47,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:47,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:47,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:47,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-04 17:53:47,990 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:47,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:47,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1082129478, now seen corresponding path program 14 times [2024-06-04 17:53:47,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:47,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917435453] [2024-06-04 17:53:47,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:47,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:52,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:52,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917435453] [2024-06-04 17:53:52,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917435453] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:52,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:52,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:53:52,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527342354] [2024-06-04 17:53:52,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:52,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:53:52,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:52,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:53:52,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:53:52,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:53:52,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 125 transitions, 984 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:52,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:52,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:53:52,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:52,847 INFO L124 PetriNetUnfolderBase]: 400/797 cut-off events. [2024-06-04 17:53:52,847 INFO L125 PetriNetUnfolderBase]: For 101659/101659 co-relation queries the response was YES. [2024-06-04 17:53:52,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5007 conditions, 797 events. 400/797 cut-off events. For 101659/101659 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4018 event pairs, 117 based on Foata normal form. 12/808 useless extension candidates. Maximal degree in co-relation 4926. Up to 696 conditions per place. [2024-06-04 17:53:52,853 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 113 selfloop transitions, 16 changer transitions 10/141 dead transitions. [2024-06-04 17:53:52,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 141 transitions, 1326 flow [2024-06-04 17:53:52,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:53:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:53:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-04 17:53:52,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:53:52,854 INFO L175 Difference]: Start difference. First operand has 191 places, 125 transitions, 984 flow. Second operand 10 states and 105 transitions. [2024-06-04 17:53:52,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 141 transitions, 1326 flow [2024-06-04 17:53:53,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 141 transitions, 1269 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-04 17:53:53,055 INFO L231 Difference]: Finished difference. Result has 189 places, 119 transitions, 923 flow [2024-06-04 17:53:53,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=923, PETRI_PLACES=189, PETRI_TRANSITIONS=119} [2024-06-04 17:53:53,055 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 159 predicate places. [2024-06-04 17:53:53,055 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 119 transitions, 923 flow [2024-06-04 17:53:53,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:53,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:53,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:53,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-04 17:53:53,056 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:53,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1408829314, now seen corresponding path program 15 times [2024-06-04 17:53:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:53,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974438596] [2024-06-04 17:53:53,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:53,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:57,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:57,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974438596] [2024-06-04 17:53:57,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974438596] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:57,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:57,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:53:57,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939097997] [2024-06-04 17:53:57,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:57,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:53:57,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:57,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:53:57,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:53:57,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:53:57,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 119 transitions, 923 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:57,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:57,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:53:57,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:57,992 INFO L124 PetriNetUnfolderBase]: 377/756 cut-off events. [2024-06-04 17:53:57,992 INFO L125 PetriNetUnfolderBase]: For 84693/84693 co-relation queries the response was YES. [2024-06-04 17:53:57,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4658 conditions, 756 events. 377/756 cut-off events. For 84693/84693 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3753 event pairs, 106 based on Foata normal form. 8/763 useless extension candidates. Maximal degree in co-relation 4578. Up to 596 conditions per place. [2024-06-04 17:53:57,998 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 116 selfloop transitions, 12 changer transitions 11/141 dead transitions. [2024-06-04 17:53:57,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 141 transitions, 1429 flow [2024-06-04 17:53:57,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:53:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:53:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-04 17:53:57,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3343108504398827 [2024-06-04 17:53:57,999 INFO L175 Difference]: Start difference. First operand has 189 places, 119 transitions, 923 flow. Second operand 11 states and 114 transitions. [2024-06-04 17:53:57,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 141 transitions, 1429 flow [2024-06-04 17:53:58,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 141 transitions, 1331 flow, removed 7 selfloop flow, removed 14 redundant places. [2024-06-04 17:53:58,157 INFO L231 Difference]: Finished difference. Result has 184 places, 115 transitions, 836 flow [2024-06-04 17:53:58,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=836, PETRI_PLACES=184, PETRI_TRANSITIONS=115} [2024-06-04 17:53:58,158 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 154 predicate places. [2024-06-04 17:53:58,158 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 115 transitions, 836 flow [2024-06-04 17:53:58,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:58,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:58,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:58,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-04 17:53:58,158 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:53:58,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:58,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1704287524, now seen corresponding path program 16 times [2024-06-04 17:53:58,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:58,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645362716] [2024-06-04 17:53:58,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:58,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:03,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:03,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645362716] [2024-06-04 17:54:03,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645362716] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:03,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:03,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:54:03,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578663712] [2024-06-04 17:54:03,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:03,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:54:03,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:03,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:54:03,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:54:03,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:54:03,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 115 transitions, 836 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:03,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:03,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:54:03,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:03,827 INFO L124 PetriNetUnfolderBase]: 356/717 cut-off events. [2024-06-04 17:54:03,827 INFO L125 PetriNetUnfolderBase]: For 78347/78347 co-relation queries the response was YES. [2024-06-04 17:54:03,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4110 conditions, 717 events. 356/717 cut-off events. For 78347/78347 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3506 event pairs, 106 based on Foata normal form. 10/726 useless extension candidates. Maximal degree in co-relation 4032. Up to 633 conditions per place. [2024-06-04 17:54:03,832 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 109 selfloop transitions, 12 changer transitions 9/132 dead transitions. [2024-06-04 17:54:03,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 132 transitions, 1162 flow [2024-06-04 17:54:03,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2024-06-04 17:54:03,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31085043988269795 [2024-06-04 17:54:03,833 INFO L175 Difference]: Start difference. First operand has 184 places, 115 transitions, 836 flow. Second operand 11 states and 106 transitions. [2024-06-04 17:54:03,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 132 transitions, 1162 flow [2024-06-04 17:54:03,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 132 transitions, 1135 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:54:03,955 INFO L231 Difference]: Finished difference. Result has 180 places, 112 transitions, 816 flow [2024-06-04 17:54:03,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=816, PETRI_PLACES=180, PETRI_TRANSITIONS=112} [2024-06-04 17:54:03,955 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 150 predicate places. [2024-06-04 17:54:03,955 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 112 transitions, 816 flow [2024-06-04 17:54:03,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:03,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:03,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:03,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-04 17:54:03,955 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:03,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:03,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1856865672, now seen corresponding path program 1 times [2024-06-04 17:54:03,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:03,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622998802] [2024-06-04 17:54:03,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:03,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:08,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:08,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622998802] [2024-06-04 17:54:08,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622998802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:08,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:08,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:54:08,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271634922] [2024-06-04 17:54:08,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:08,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:54:08,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:08,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:54:08,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:54:08,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:54:08,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 112 transitions, 816 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:08,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:08,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:54:08,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:09,342 INFO L124 PetriNetUnfolderBase]: 338/687 cut-off events. [2024-06-04 17:54:09,342 INFO L125 PetriNetUnfolderBase]: For 65797/65797 co-relation queries the response was YES. [2024-06-04 17:54:09,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3928 conditions, 687 events. 338/687 cut-off events. For 65797/65797 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3361 event pairs, 91 based on Foata normal form. 6/692 useless extension candidates. Maximal degree in co-relation 3852. Up to 569 conditions per place. [2024-06-04 17:54:09,347 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 98 selfloop transitions, 13 changer transitions 19/132 dead transitions. [2024-06-04 17:54:09,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 132 transitions, 1132 flow [2024-06-04 17:54:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:54:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:54:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-04 17:54:09,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33225806451612905 [2024-06-04 17:54:09,348 INFO L175 Difference]: Start difference. First operand has 180 places, 112 transitions, 816 flow. Second operand 10 states and 103 transitions. [2024-06-04 17:54:09,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 132 transitions, 1132 flow [2024-06-04 17:54:09,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 132 transitions, 1098 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 17:54:09,459 INFO L231 Difference]: Finished difference. Result has 177 places, 106 transitions, 778 flow [2024-06-04 17:54:09,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=778, PETRI_PLACES=177, PETRI_TRANSITIONS=106} [2024-06-04 17:54:09,460 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 147 predicate places. [2024-06-04 17:54:09,460 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 106 transitions, 778 flow [2024-06-04 17:54:09,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:09,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:09,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:09,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-04 17:54:09,460 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:09,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:09,460 INFO L85 PathProgramCache]: Analyzing trace with hash 305083932, now seen corresponding path program 2 times [2024-06-04 17:54:09,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:09,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467850348] [2024-06-04 17:54:09,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:09,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:14,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:14,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467850348] [2024-06-04 17:54:14,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467850348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:14,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:14,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:54:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429476449] [2024-06-04 17:54:14,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:14,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:54:14,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:14,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:54:14,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:54:14,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:54:14,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 106 transitions, 778 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:14,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:14,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:54:14,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:15,098 INFO L124 PetriNetUnfolderBase]: 311/638 cut-off events. [2024-06-04 17:54:15,098 INFO L125 PetriNetUnfolderBase]: For 63900/63900 co-relation queries the response was YES. [2024-06-04 17:54:15,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3717 conditions, 638 events. 311/638 cut-off events. For 63900/63900 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3072 event pairs, 81 based on Foata normal form. 6/643 useless extension candidates. Maximal degree in co-relation 3642. Up to 519 conditions per place. [2024-06-04 17:54:15,104 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 89 selfloop transitions, 17 changer transitions 17/125 dead transitions. [2024-06-04 17:54:15,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 125 transitions, 1072 flow [2024-06-04 17:54:15,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2024-06-04 17:54:15,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31378299120234604 [2024-06-04 17:54:15,105 INFO L175 Difference]: Start difference. First operand has 177 places, 106 transitions, 778 flow. Second operand 11 states and 107 transitions. [2024-06-04 17:54:15,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 125 transitions, 1072 flow [2024-06-04 17:54:15,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 125 transitions, 1021 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-04 17:54:15,236 INFO L231 Difference]: Finished difference. Result has 169 places, 99 transitions, 704 flow [2024-06-04 17:54:15,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=704, PETRI_PLACES=169, PETRI_TRANSITIONS=99} [2024-06-04 17:54:15,237 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 139 predicate places. [2024-06-04 17:54:15,237 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 99 transitions, 704 flow [2024-06-04 17:54:15,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:15,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:15,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:15,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-04 17:54:15,237 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:15,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:15,238 INFO L85 PathProgramCache]: Analyzing trace with hash -622212750, now seen corresponding path program 3 times [2024-06-04 17:54:15,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:15,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203379740] [2024-06-04 17:54:15,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:15,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:20,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:20,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203379740] [2024-06-04 17:54:20,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203379740] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:20,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:20,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:54:20,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094033198] [2024-06-04 17:54:20,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:20,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:54:20,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:20,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:54:20,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:54:20,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:54:20,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 99 transitions, 704 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:20,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:20,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:54:20,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:21,024 INFO L124 PetriNetUnfolderBase]: 288/601 cut-off events. [2024-06-04 17:54:21,024 INFO L125 PetriNetUnfolderBase]: For 56103/56103 co-relation queries the response was YES. [2024-06-04 17:54:21,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 601 events. 288/601 cut-off events. For 56103/56103 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2866 event pairs, 86 based on Foata normal form. 8/608 useless extension candidates. Maximal degree in co-relation 3250. Up to 471 conditions per place. [2024-06-04 17:54:21,029 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 83 selfloop transitions, 23 changer transitions 9/117 dead transitions. [2024-06-04 17:54:21,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 117 transitions, 984 flow [2024-06-04 17:54:21,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2024-06-04 17:54:21,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3196480938416422 [2024-06-04 17:54:21,029 INFO L175 Difference]: Start difference. First operand has 169 places, 99 transitions, 704 flow. Second operand 11 states and 109 transitions. [2024-06-04 17:54:21,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 117 transitions, 984 flow [2024-06-04 17:54:21,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 117 transitions, 942 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 17:54:21,115 INFO L231 Difference]: Finished difference. Result has 163 places, 95 transitions, 673 flow [2024-06-04 17:54:21,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=673, PETRI_PLACES=163, PETRI_TRANSITIONS=95} [2024-06-04 17:54:21,115 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 133 predicate places. [2024-06-04 17:54:21,115 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 95 transitions, 673 flow [2024-06-04 17:54:21,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:21,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:21,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:21,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-04 17:54:21,116 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:21,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:21,116 INFO L85 PathProgramCache]: Analyzing trace with hash -622218330, now seen corresponding path program 4 times [2024-06-04 17:54:21,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:21,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622918055] [2024-06-04 17:54:21,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:21,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:25,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:25,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622918055] [2024-06-04 17:54:25,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622918055] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:25,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:25,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:54:25,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625196997] [2024-06-04 17:54:25,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:25,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:54:25,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:25,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:54:25,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:54:26,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:54:26,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 95 transitions, 673 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:26,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:26,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:54:26,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:26,451 INFO L124 PetriNetUnfolderBase]: 279/586 cut-off events. [2024-06-04 17:54:26,451 INFO L125 PetriNetUnfolderBase]: For 47210/47210 co-relation queries the response was YES. [2024-06-04 17:54:26,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3179 conditions, 586 events. 279/586 cut-off events. For 47210/47210 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2790 event pairs, 82 based on Foata normal form. 6/591 useless extension candidates. Maximal degree in co-relation 3112. Up to 459 conditions per place. [2024-06-04 17:54:26,455 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 80 selfloop transitions, 19 changer transitions 13/114 dead transitions. [2024-06-04 17:54:26,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 114 transitions, 949 flow [2024-06-04 17:54:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2024-06-04 17:54:26,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31378299120234604 [2024-06-04 17:54:26,456 INFO L175 Difference]: Start difference. First operand has 163 places, 95 transitions, 673 flow. Second operand 11 states and 107 transitions. [2024-06-04 17:54:26,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 114 transitions, 949 flow [2024-06-04 17:54:26,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 114 transitions, 860 flow, removed 7 selfloop flow, removed 12 redundant places. [2024-06-04 17:54:26,522 INFO L231 Difference]: Finished difference. Result has 159 places, 90 transitions, 593 flow [2024-06-04 17:54:26,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=593, PETRI_PLACES=159, PETRI_TRANSITIONS=90} [2024-06-04 17:54:26,522 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2024-06-04 17:54:26,522 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 90 transitions, 593 flow [2024-06-04 17:54:26,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:26,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:26,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:26,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-04 17:54:26,523 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:26,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:26,524 INFO L85 PathProgramCache]: Analyzing trace with hash -622362480, now seen corresponding path program 5 times [2024-06-04 17:54:26,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:26,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703050456] [2024-06-04 17:54:26,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:26,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:31,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:31,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703050456] [2024-06-04 17:54:31,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703050456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:31,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:31,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:54:31,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596091959] [2024-06-04 17:54:31,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:31,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:54:31,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:31,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:54:31,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:54:31,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:54:31,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 90 transitions, 593 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:31,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:31,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:54:31,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:31,710 INFO L124 PetriNetUnfolderBase]: 266/563 cut-off events. [2024-06-04 17:54:31,710 INFO L125 PetriNetUnfolderBase]: For 40656/40656 co-relation queries the response was YES. [2024-06-04 17:54:31,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2918 conditions, 563 events. 266/563 cut-off events. For 40656/40656 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2655 event pairs, 80 based on Foata normal form. 6/568 useless extension candidates. Maximal degree in co-relation 2854. Up to 439 conditions per place. [2024-06-04 17:54:31,713 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 69 selfloop transitions, 6 changer transitions 32/109 dead transitions. [2024-06-04 17:54:31,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 109 transitions, 855 flow [2024-06-04 17:54:31,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2024-06-04 17:54:31,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31085043988269795 [2024-06-04 17:54:31,714 INFO L175 Difference]: Start difference. First operand has 159 places, 90 transitions, 593 flow. Second operand 11 states and 106 transitions. [2024-06-04 17:54:31,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 109 transitions, 855 flow [2024-06-04 17:54:31,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 109 transitions, 811 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:54:31,759 INFO L231 Difference]: Finished difference. Result has 154 places, 73 transitions, 429 flow [2024-06-04 17:54:31,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=429, PETRI_PLACES=154, PETRI_TRANSITIONS=73} [2024-06-04 17:54:31,759 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 124 predicate places. [2024-06-04 17:54:31,760 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 73 transitions, 429 flow [2024-06-04 17:54:31,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:31,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:31,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:31,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-04 17:54:31,760 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:31,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash 746305010, now seen corresponding path program 6 times [2024-06-04 17:54:31,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:31,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342292684] [2024-06-04 17:54:31,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:31,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:36,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:36,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342292684] [2024-06-04 17:54:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342292684] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:36,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:54:36,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230570507] [2024-06-04 17:54:36,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:36,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:54:36,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:36,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:54:36,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:54:36,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:54:36,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 73 transitions, 429 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:36,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:36,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:54:36,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:37,219 INFO L124 PetriNetUnfolderBase]: 225/480 cut-off events. [2024-06-04 17:54:37,219 INFO L125 PetriNetUnfolderBase]: For 37408/37408 co-relation queries the response was YES. [2024-06-04 17:54:37,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2518 conditions, 480 events. 225/480 cut-off events. For 37408/37408 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2175 event pairs, 78 based on Foata normal form. 6/485 useless extension candidates. Maximal degree in co-relation 2456. Up to 407 conditions per place. [2024-06-04 17:54:37,222 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 64 selfloop transitions, 7 changer transitions 16/89 dead transitions. [2024-06-04 17:54:37,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 89 transitions, 641 flow [2024-06-04 17:54:37,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 101 transitions. [2024-06-04 17:54:37,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2961876832844575 [2024-06-04 17:54:37,223 INFO L175 Difference]: Start difference. First operand has 154 places, 73 transitions, 429 flow. Second operand 11 states and 101 transitions. [2024-06-04 17:54:37,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 89 transitions, 641 flow [2024-06-04 17:54:37,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 89 transitions, 602 flow, removed 8 selfloop flow, removed 14 redundant places. [2024-06-04 17:54:37,266 INFO L231 Difference]: Finished difference. Result has 135 places, 68 transitions, 386 flow [2024-06-04 17:54:37,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=386, PETRI_PLACES=135, PETRI_TRANSITIONS=68} [2024-06-04 17:54:37,266 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 105 predicate places. [2024-06-04 17:54:37,266 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 68 transitions, 386 flow [2024-06-04 17:54:37,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:37,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:37,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:37,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-04 17:54:37,267 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:37,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:37,267 INFO L85 PathProgramCache]: Analyzing trace with hash -2086886980, now seen corresponding path program 7 times [2024-06-04 17:54:37,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:37,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929935963] [2024-06-04 17:54:37,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:37,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:42,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:42,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:42,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929935963] [2024-06-04 17:54:42,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929935963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:42,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:42,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:54:42,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071963773] [2024-06-04 17:54:42,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:42,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:54:42,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:42,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:54:42,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:54:42,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:54:42,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 68 transitions, 386 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:42,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:42,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:54:42,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:42,502 INFO L124 PetriNetUnfolderBase]: 212/453 cut-off events. [2024-06-04 17:54:42,502 INFO L125 PetriNetUnfolderBase]: For 30272/30272 co-relation queries the response was YES. [2024-06-04 17:54:42,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 453 events. 212/453 cut-off events. For 30272/30272 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2015 event pairs, 74 based on Foata normal form. 6/458 useless extension candidates. Maximal degree in co-relation 2237. Up to 375 conditions per place. [2024-06-04 17:54:42,504 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 61 selfloop transitions, 8 changer transitions 14/85 dead transitions. [2024-06-04 17:54:42,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 85 transitions, 590 flow [2024-06-04 17:54:42,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2024-06-04 17:54:42,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2991202346041056 [2024-06-04 17:54:42,505 INFO L175 Difference]: Start difference. First operand has 135 places, 68 transitions, 386 flow. Second operand 11 states and 102 transitions. [2024-06-04 17:54:42,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 85 transitions, 590 flow [2024-06-04 17:54:42,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 85 transitions, 566 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 17:54:42,534 INFO L231 Difference]: Finished difference. Result has 127 places, 64 transitions, 363 flow [2024-06-04 17:54:42,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=363, PETRI_PLACES=127, PETRI_TRANSITIONS=64} [2024-06-04 17:54:42,534 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 97 predicate places. [2024-06-04 17:54:42,534 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 64 transitions, 363 flow [2024-06-04 17:54:42,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:42,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:42,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:42,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-04 17:54:42,535 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:42,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:42,535 INFO L85 PathProgramCache]: Analyzing trace with hash -254077944, now seen corresponding path program 8 times [2024-06-04 17:54:42,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:42,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40242128] [2024-06-04 17:54:42,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:42,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:48,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:48,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:48,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40242128] [2024-06-04 17:54:48,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40242128] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:48,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:48,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:54:48,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865915674] [2024-06-04 17:54:48,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:48,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:54:48,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:48,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:54:48,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:54:48,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:54:48,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 64 transitions, 363 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:48,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:48,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:54:48,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:48,715 INFO L124 PetriNetUnfolderBase]: 198/427 cut-off events. [2024-06-04 17:54:48,715 INFO L125 PetriNetUnfolderBase]: For 25130/25130 co-relation queries the response was YES. [2024-06-04 17:54:48,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2126 conditions, 427 events. 198/427 cut-off events. For 25130/25130 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1874 event pairs, 70 based on Foata normal form. 6/432 useless extension candidates. Maximal degree in co-relation 2075. Up to 349 conditions per place. [2024-06-04 17:54:48,717 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 51 selfloop transitions, 3 changer transitions 25/81 dead transitions. [2024-06-04 17:54:48,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 81 transitions, 559 flow [2024-06-04 17:54:48,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 101 transitions. [2024-06-04 17:54:48,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2961876832844575 [2024-06-04 17:54:48,718 INFO L175 Difference]: Start difference. First operand has 127 places, 64 transitions, 363 flow. Second operand 11 states and 101 transitions. [2024-06-04 17:54:48,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 81 transitions, 559 flow [2024-06-04 17:54:48,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 81 transitions, 535 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 17:54:48,744 INFO L231 Difference]: Finished difference. Result has 121 places, 55 transitions, 303 flow [2024-06-04 17:54:48,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=303, PETRI_PLACES=121, PETRI_TRANSITIONS=55} [2024-06-04 17:54:48,745 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 91 predicate places. [2024-06-04 17:54:48,745 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 55 transitions, 303 flow [2024-06-04 17:54:48,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:48,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:48,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:48,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-04 17:54:48,745 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:54:48,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:48,746 INFO L85 PathProgramCache]: Analyzing trace with hash 121476126, now seen corresponding path program 9 times [2024-06-04 17:54:48,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:48,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047141456] [2024-06-04 17:54:48,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:48,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:54,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:54,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047141456] [2024-06-04 17:54:54,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047141456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:54,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:54,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:54:54,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120376492] [2024-06-04 17:54:54,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:54,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:54:54,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:54,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:54:54,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:54:54,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:54:54,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 55 transitions, 303 flow. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:54,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:54,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:54:54,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:54,365 INFO L124 PetriNetUnfolderBase]: 161/345 cut-off events. [2024-06-04 17:54:54,365 INFO L125 PetriNetUnfolderBase]: For 17228/17228 co-relation queries the response was YES. [2024-06-04 17:54:54,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1604 conditions, 345 events. 161/345 cut-off events. For 17228/17228 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1430 event pairs, 55 based on Foata normal form. 6/350 useless extension candidates. Maximal degree in co-relation 1556. Up to 283 conditions per place. [2024-06-04 17:54:54,367 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 47 selfloop transitions, 9 changer transitions 11/69 dead transitions. [2024-06-04 17:54:54,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 69 transitions, 467 flow [2024-06-04 17:54:54,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:54:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:54:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-04 17:54:54,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-04 17:54:54,368 INFO L175 Difference]: Start difference. First operand has 121 places, 55 transitions, 303 flow. Second operand 11 states and 110 transitions. [2024-06-04 17:54:54,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 69 transitions, 467 flow [2024-06-04 17:54:54,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 69 transitions, 443 flow, removed 8 selfloop flow, removed 12 redundant places. [2024-06-04 17:54:54,382 INFO L231 Difference]: Finished difference. Result has 106 places, 52 transitions, 285 flow [2024-06-04 17:54:54,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=285, PETRI_PLACES=106, PETRI_TRANSITIONS=52} [2024-06-04 17:54:54,382 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 76 predicate places. [2024-06-04 17:54:54,382 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 52 transitions, 285 flow [2024-06-04 17:54:54,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:54,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:54,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:54,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-04 17:54:54,383 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-04 17:54:54,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:54,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2058282482, now seen corresponding path program 10 times [2024-06-04 17:54:54,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:54,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889974482] [2024-06-04 17:54:54,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:54,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:00,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:00,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889974482] [2024-06-04 17:55:00,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889974482] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:00,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:00,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:55:00,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677688197] [2024-06-04 17:55:00,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:00,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:55:00,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:00,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:55:00,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:55:00,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:55:00,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 52 transitions, 285 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:00,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:00,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:55:00,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:00,450 INFO L124 PetriNetUnfolderBase]: 151/327 cut-off events. [2024-06-04 17:55:00,450 INFO L125 PetriNetUnfolderBase]: For 12206/12206 co-relation queries the response was YES. [2024-06-04 17:55:00,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 327 events. 151/327 cut-off events. For 12206/12206 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1330 event pairs, 53 based on Foata normal form. 6/332 useless extension candidates. Maximal degree in co-relation 1408. Up to 265 conditions per place. [2024-06-04 17:55:00,452 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 42 selfloop transitions, 6 changer transitions 16/66 dead transitions. [2024-06-04 17:55:00,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 66 transitions, 443 flow [2024-06-04 17:55:00,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:00,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:00,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2024-06-04 17:55:00,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2873900293255132 [2024-06-04 17:55:00,453 INFO L175 Difference]: Start difference. First operand has 106 places, 52 transitions, 285 flow. Second operand 11 states and 98 transitions. [2024-06-04 17:55:00,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 66 transitions, 443 flow [2024-06-04 17:55:00,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 66 transitions, 419 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:55:00,463 INFO L231 Difference]: Finished difference. Result has 101 places, 47 transitions, 253 flow [2024-06-04 17:55:00,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=253, PETRI_PLACES=101, PETRI_TRANSITIONS=47} [2024-06-04 17:55:00,463 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 71 predicate places. [2024-06-04 17:55:00,463 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 47 transitions, 253 flow [2024-06-04 17:55:00,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:00,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:00,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:00,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-04 17:55:00,464 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-04 17:55:00,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:00,464 INFO L85 PathProgramCache]: Analyzing trace with hash 773156976, now seen corresponding path program 11 times [2024-06-04 17:55:00,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:00,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831883723] [2024-06-04 17:55:00,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:00,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:06,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-04 17:55:06,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:06,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831883723] [2024-06-04 17:55:06,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831883723] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:06,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:06,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:55:06,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026718727] [2024-06-04 17:55:06,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:06,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:55:06,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:06,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:55:06,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:55:06,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:55:06,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 47 transitions, 253 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:06,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:06,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:55:06,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:06,831 INFO L124 PetriNetUnfolderBase]: 138/300 cut-off events. [2024-06-04 17:55:06,831 INFO L125 PetriNetUnfolderBase]: For 10750/10750 co-relation queries the response was YES. [2024-06-04 17:55:06,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1333 conditions, 300 events. 138/300 cut-off events. For 10750/10750 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1177 event pairs, 55 based on Foata normal form. 6/305 useless extension candidates. Maximal degree in co-relation 1294. Up to 233 conditions per place. [2024-06-04 17:55:06,833 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 40 selfloop transitions, 9 changer transitions 9/60 dead transitions. [2024-06-04 17:55:06,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 60 transitions, 397 flow [2024-06-04 17:55:06,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:55:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:55:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2024-06-04 17:55:06,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3 [2024-06-04 17:55:06,834 INFO L175 Difference]: Start difference. First operand has 101 places, 47 transitions, 253 flow. Second operand 10 states and 93 transitions. [2024-06-04 17:55:06,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 60 transitions, 397 flow [2024-06-04 17:55:06,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 60 transitions, 375 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 17:55:06,840 INFO L231 Difference]: Finished difference. Result has 92 places, 44 transitions, 238 flow [2024-06-04 17:55:06,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=238, PETRI_PLACES=92, PETRI_TRANSITIONS=44} [2024-06-04 17:55:06,840 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 62 predicate places. [2024-06-04 17:55:06,841 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 44 transitions, 238 flow [2024-06-04 17:55:06,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:06,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:06,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:06,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-04 17:55:06,841 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-04 17:55:06,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:06,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1061474448, now seen corresponding path program 12 times [2024-06-04 17:55:06,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:06,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607961763] [2024-06-04 17:55:06,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:06,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:11,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:11,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607961763] [2024-06-04 17:55:11,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607961763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:11,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:11,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:55:11,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593060893] [2024-06-04 17:55:11,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:11,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:55:11,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:11,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:55:11,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:55:11,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:55:11,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 44 transitions, 238 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:11,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:11,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:55:11,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:12,192 INFO L124 PetriNetUnfolderBase]: 128/282 cut-off events. [2024-06-04 17:55:12,192 INFO L125 PetriNetUnfolderBase]: For 8052/8052 co-relation queries the response was YES. [2024-06-04 17:55:12,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 282 events. 128/282 cut-off events. For 8052/8052 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1099 event pairs, 47 based on Foata normal form. 6/287 useless extension candidates. Maximal degree in co-relation 1182. Up to 215 conditions per place. [2024-06-04 17:55:12,193 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 36 selfloop transitions, 7 changer transitions 14/59 dead transitions. [2024-06-04 17:55:12,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 59 transitions, 384 flow [2024-06-04 17:55:12,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 99 transitions. [2024-06-04 17:55:12,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2903225806451613 [2024-06-04 17:55:12,194 INFO L175 Difference]: Start difference. First operand has 92 places, 44 transitions, 238 flow. Second operand 11 states and 99 transitions. [2024-06-04 17:55:12,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 59 transitions, 384 flow [2024-06-04 17:55:12,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 59 transitions, 360 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:55:12,201 INFO L231 Difference]: Finished difference. Result has 89 places, 40 transitions, 213 flow [2024-06-04 17:55:12,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=213, PETRI_PLACES=89, PETRI_TRANSITIONS=40} [2024-06-04 17:55:12,202 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2024-06-04 17:55:12,202 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 40 transitions, 213 flow [2024-06-04 17:55:12,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:12,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:12,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:12,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-04 17:55:12,202 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:55:12,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:12,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1293519962, now seen corresponding path program 13 times [2024-06-04 17:55:12,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:12,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868726140] [2024-06-04 17:55:12,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:12,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:17,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:17,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868726140] [2024-06-04 17:55:17,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868726140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:17,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:17,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:55:17,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355637437] [2024-06-04 17:55:17,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:17,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:55:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:17,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:55:17,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:55:17,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:55:17,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 40 transitions, 213 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:17,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:17,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:55:17,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:17,845 INFO L124 PetriNetUnfolderBase]: 99/223 cut-off events. [2024-06-04 17:55:17,845 INFO L125 PetriNetUnfolderBase]: For 5146/5146 co-relation queries the response was YES. [2024-06-04 17:55:17,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 889 conditions, 223 events. 99/223 cut-off events. For 5146/5146 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 782 event pairs, 34 based on Foata normal form. 6/228 useless extension candidates. Maximal degree in co-relation 856. Up to 166 conditions per place. [2024-06-04 17:55:17,846 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 30 selfloop transitions, 6 changer transitions 15/53 dead transitions. [2024-06-04 17:55:17,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 53 transitions, 343 flow [2024-06-04 17:55:17,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2024-06-04 17:55:17,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28152492668621704 [2024-06-04 17:55:17,847 INFO L175 Difference]: Start difference. First operand has 89 places, 40 transitions, 213 flow. Second operand 11 states and 96 transitions. [2024-06-04 17:55:17,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 53 transitions, 343 flow [2024-06-04 17:55:17,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 53 transitions, 321 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 17:55:17,852 INFO L231 Difference]: Finished difference. Result has 83 places, 35 transitions, 182 flow [2024-06-04 17:55:17,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=182, PETRI_PLACES=83, PETRI_TRANSITIONS=35} [2024-06-04 17:55:17,852 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2024-06-04 17:55:17,852 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 35 transitions, 182 flow [2024-06-04 17:55:17,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:17,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:17,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:17,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-04 17:55:17,853 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:55:17,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:17,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1317593096, now seen corresponding path program 14 times [2024-06-04 17:55:17,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:17,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988023601] [2024-06-04 17:55:17,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:17,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:23,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-04 17:55:23,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:23,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988023601] [2024-06-04 17:55:23,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988023601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:23,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:23,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:55:23,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052658068] [2024-06-04 17:55:23,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:23,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:55:23,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:23,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:55:23,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:55:23,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:55:23,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 35 transitions, 182 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:23,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:23,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:55:23,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:23,993 INFO L124 PetriNetUnfolderBase]: 89/201 cut-off events. [2024-06-04 17:55:23,993 INFO L125 PetriNetUnfolderBase]: For 3932/3932 co-relation queries the response was YES. [2024-06-04 17:55:23,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 201 events. 89/201 cut-off events. For 3932/3932 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 672 event pairs, 32 based on Foata normal form. 6/206 useless extension candidates. Maximal degree in co-relation 756. Up to 127 conditions per place. [2024-06-04 17:55:23,994 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 27 selfloop transitions, 9 changer transitions 12/50 dead transitions. [2024-06-04 17:55:23,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 50 transitions, 310 flow [2024-06-04 17:55:23,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2024-06-04 17:55:23,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2932551319648094 [2024-06-04 17:55:23,995 INFO L175 Difference]: Start difference. First operand has 83 places, 35 transitions, 182 flow. Second operand 11 states and 100 transitions. [2024-06-04 17:55:23,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 50 transitions, 310 flow [2024-06-04 17:55:23,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 50 transitions, 290 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 17:55:23,998 INFO L231 Difference]: Finished difference. Result has 74 places, 31 transitions, 163 flow [2024-06-04 17:55:23,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=63, 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=11, PETRI_FLOW=163, PETRI_PLACES=74, PETRI_TRANSITIONS=31} [2024-06-04 17:55:23,999 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2024-06-04 17:55:23,999 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 31 transitions, 163 flow [2024-06-04 17:55:23,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:23,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:23,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:23,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-04 17:55:23,999 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:55:23,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:24,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1118291306, now seen corresponding path program 15 times [2024-06-04 17:55:24,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:24,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141851868] [2024-06-04 17:55:24,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:24,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:28,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:28,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:28,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141851868] [2024-06-04 17:55:28,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141851868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:28,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:28,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:55:28,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250453787] [2024-06-04 17:55:28,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:28,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:55:28,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:28,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:55:28,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:55:28,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:55:28,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 31 transitions, 163 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:28,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:28,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:55:28,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:28,953 INFO L124 PetriNetUnfolderBase]: 65/149 cut-off events. [2024-06-04 17:55:28,953 INFO L125 PetriNetUnfolderBase]: For 1944/1944 co-relation queries the response was YES. [2024-06-04 17:55:28,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 149 events. 65/149 cut-off events. For 1944/1944 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 420 event pairs, 19 based on Foata normal form. 6/154 useless extension candidates. Maximal degree in co-relation 494. Up to 84 conditions per place. [2024-06-04 17:55:28,954 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 24 selfloop transitions, 8 changer transitions 11/45 dead transitions. [2024-06-04 17:55:28,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 45 transitions, 279 flow [2024-06-04 17:55:28,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2024-06-04 17:55:28,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2844574780058651 [2024-06-04 17:55:28,955 INFO L175 Difference]: Start difference. First operand has 74 places, 31 transitions, 163 flow. Second operand 11 states and 97 transitions. [2024-06-04 17:55:28,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 45 transitions, 279 flow [2024-06-04 17:55:28,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 45 transitions, 253 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 17:55:28,956 INFO L231 Difference]: Finished difference. Result has 68 places, 28 transitions, 141 flow [2024-06-04 17:55:28,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=141, PETRI_PLACES=68, PETRI_TRANSITIONS=28} [2024-06-04 17:55:28,957 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2024-06-04 17:55:28,957 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 28 transitions, 141 flow [2024-06-04 17:55:28,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:28,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:28,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:28,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-04 17:55:28,957 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:55:28,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:28,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1118147156, now seen corresponding path program 16 times [2024-06-04 17:55:28,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:28,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795759525] [2024-06-04 17:55:28,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:28,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:34,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:34,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795759525] [2024-06-04 17:55:34,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795759525] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:34,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:34,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:55:34,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877542158] [2024-06-04 17:55:34,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:34,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:55:34,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:34,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:55:34,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:55:34,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:55:34,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 28 transitions, 141 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:34,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:34,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:55:34,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:34,450 INFO L124 PetriNetUnfolderBase]: 55/131 cut-off events. [2024-06-04 17:55:34,450 INFO L125 PetriNetUnfolderBase]: For 1346/1346 co-relation queries the response was YES. [2024-06-04 17:55:34,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 131 events. 55/131 cut-off events. For 1346/1346 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 341 event pairs, 17 based on Foata normal form. 6/136 useless extension candidates. Maximal degree in co-relation 422. Up to 66 conditions per place. [2024-06-04 17:55:34,451 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 18 selfloop transitions, 4 changer transitions 18/42 dead transitions. [2024-06-04 17:55:34,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 42 transitions, 251 flow [2024-06-04 17:55:34,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2024-06-04 17:55:34,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28152492668621704 [2024-06-04 17:55:34,451 INFO L175 Difference]: Start difference. First operand has 68 places, 28 transitions, 141 flow. Second operand 11 states and 96 transitions. [2024-06-04 17:55:34,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 42 transitions, 251 flow [2024-06-04 17:55:34,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 42 transitions, 229 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:55:34,453 INFO L231 Difference]: Finished difference. Result has 63 places, 22 transitions, 102 flow [2024-06-04 17:55:34,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=102, PETRI_PLACES=63, PETRI_TRANSITIONS=22} [2024-06-04 17:55:34,453 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 33 predicate places. [2024-06-04 17:55:34,453 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 22 transitions, 102 flow [2024-06-04 17:55:34,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:34,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:34,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:34,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-04 17:55:34,454 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:55:34,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:34,454 INFO L85 PathProgramCache]: Analyzing trace with hash -879050978, now seen corresponding path program 17 times [2024-06-04 17:55:34,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:34,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989593087] [2024-06-04 17:55:34,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:34,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:39,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:39,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989593087] [2024-06-04 17:55:39,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989593087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:39,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:39,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:55:39,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530174993] [2024-06-04 17:55:39,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:39,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:55:39,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:39,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:55:39,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:55:39,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:55:39,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 22 transitions, 102 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:39,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:39,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:55:39,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:39,849 INFO L124 PetriNetUnfolderBase]: 26/68 cut-off events. [2024-06-04 17:55:39,849 INFO L125 PetriNetUnfolderBase]: For 508/508 co-relation queries the response was YES. [2024-06-04 17:55:39,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 68 events. 26/68 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 6/73 useless extension candidates. Maximal degree in co-relation 172. Up to 24 conditions per place. [2024-06-04 17:55:39,850 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 0 selfloop transitions, 0 changer transitions 31/31 dead transitions. [2024-06-04 17:55:39,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 31 transitions, 152 flow [2024-06-04 17:55:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:55:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:55:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2024-06-04 17:55:39,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24926686217008798 [2024-06-04 17:55:39,851 INFO L175 Difference]: Start difference. First operand has 63 places, 22 transitions, 102 flow. Second operand 11 states and 85 transitions. [2024-06-04 17:55:39,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 31 transitions, 152 flow [2024-06-04 17:55:39,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 31 transitions, 126 flow, removed 1 selfloop flow, removed 13 redundant places. [2024-06-04 17:55:39,851 INFO L231 Difference]: Finished difference. Result has 48 places, 0 transitions, 0 flow [2024-06-04 17:55:39,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=48, PETRI_TRANSITIONS=0} [2024-06-04 17:55:39,852 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2024-06-04 17:55:39,852 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 0 transitions, 0 flow [2024-06-04 17:55:39,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:39,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-04 17:55:39,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 17:55:39,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-04 17:55:39,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 17:55:39,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-04 17:55:39,856 INFO L445 BasicCegarLoop]: Path program histogram: [19, 17, 16, 10, 10, 10, 6, 6, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:39,859 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 17:55:39,859 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 17:55:39,862 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-04 17:55:39,862 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-04 17:55:39,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 05:55:39 BasicIcfg [2024-06-04 17:55:39,863 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 17:55:39,863 INFO L158 Benchmark]: Toolchain (without parser) took 633246.28ms. Allocated memory was 159.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 128.7MB in the beginning and 1.1GB in the end (delta: -981.1MB). Peak memory consumption was 164.5MB. Max. memory is 16.1GB. [2024-06-04 17:55:39,864 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 159.4MB. Free memory was 115.3MB in the beginning and 115.2MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 17:55:39,864 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory was 125.6MB in the beginning and 125.5MB in the end (delta: 90.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 17:55:39,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 763.61ms. Allocated memory is still 159.4MB. Free memory was 128.1MB in the beginning and 77.2MB in the end (delta: 50.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-06-04 17:55:39,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 136.33ms. Allocated memory is still 159.4MB. Free memory was 77.2MB in the beginning and 63.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-04 17:55:39,864 INFO L158 Benchmark]: Boogie Preprocessor took 135.54ms. Allocated memory is still 159.4MB. Free memory was 63.1MB in the beginning and 56.7MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-04 17:55:39,865 INFO L158 Benchmark]: RCFGBuilder took 1306.58ms. Allocated memory was 159.4MB in the beginning and 234.9MB in the end (delta: 75.5MB). Free memory was 56.7MB in the beginning and 126.8MB in the end (delta: -70.2MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2024-06-04 17:55:39,865 INFO L158 Benchmark]: TraceAbstraction took 630897.07ms. Allocated memory was 234.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 126.8MB in the beginning and 1.1GB in the end (delta: -982.9MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. [2024-06-04 17:55:39,866 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.21ms. Allocated memory is still 159.4MB. Free memory was 115.3MB in the beginning and 115.2MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory was 125.6MB in the beginning and 125.5MB in the end (delta: 90.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 763.61ms. Allocated memory is still 159.4MB. Free memory was 128.1MB in the beginning and 77.2MB in the end (delta: 50.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 136.33ms. Allocated memory is still 159.4MB. Free memory was 77.2MB in the beginning and 63.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 135.54ms. Allocated memory is still 159.4MB. Free memory was 63.1MB in the beginning and 56.7MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1306.58ms. Allocated memory was 159.4MB in the beginning and 234.9MB in the end (delta: 75.5MB). Free memory was 56.7MB in the beginning and 126.8MB in the end (delta: -70.2MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * TraceAbstraction took 630897.07ms. Allocated memory was 234.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 126.8MB in the beginning and 1.1GB in the end (delta: -982.9MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 813]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 814]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 49 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 630.8s, OverallIterations: 126, TraceHistogramMax: 1, PathProgramHistogramMax: 19, EmptinessCheckTime: 0.0s, AutomataDifference: 67.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6300 SdHoareTripleChecker+Valid, 36.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5433 mSDsluCounter, 1955 SdHoareTripleChecker+Invalid, 32.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1411 mSDsCounter, 1180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45216 IncrementalHoareTripleChecker+Invalid, 46396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1180 mSolverCounterUnsat, 544 mSDtfsCounter, 45216 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1360 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2263 ImplicationChecksByTransitivity, 35.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1780occurred in iteration=67, InterpolantAutomatonStates: 1200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 557.5s InterpolantComputationTime, 2096 NumberOfCodeBlocks, 2096 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 1970 ConstructedInterpolants, 0 QuantifiedInterpolants, 85472 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 126 InterpolantComputations, 126 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-04 17:55:39,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE