./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.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/mix012_pso.opt_tso.opt.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/mix012_pso.opt_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix012_pso.opt_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 21:18:31,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 21:18:31,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 21:18:31,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 21:18:31,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 21:18:31,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 21:18:31,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 21:18:31,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 21:18:31,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 21:18:31,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 21:18:31,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 21:18:31,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 21:18:31,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 21:18:31,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 21:18:31,984 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 21:18:31,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 21:18:31,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 21:18:31,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 21:18:31,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 21:18:31,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 21:18:31,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 21:18:31,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 21:18:31,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 21:18:31,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 21:18:31,987 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 21:18:31,987 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 21:18:31,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 21:18:31,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 21:18:31,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 21:18:31,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 21:18:31,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 21:18:31,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 21:18:31,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:18:31,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 21:18:31,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 21:18:31,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 21:18:31,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 21:18:31,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 21:18:31,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 21:18:31,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 21:18:31,991 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 21:18:31,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 21:18:31,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 21:18:31,992 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-03 21:18:32,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 21:18:32,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 21:18:32,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 21:18:32,217 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 21:18:32,217 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 21:18:32,218 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/mix012_pso.opt_tso.opt.yml/witness.yml [2024-06-03 21:18:32,401 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 21:18:32,401 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 21:18:32,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i [2024-06-03 21:18:33,327 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 21:18:33,553 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 21:18:33,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i [2024-06-03 21:18:33,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2959008a7/3abaccdd9f144e8cbc5466c96821dadb/FLAG7958e12aa [2024-06-03 21:18:33,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2959008a7/3abaccdd9f144e8cbc5466c96821dadb [2024-06-03 21:18:33,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 21:18:33,589 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 21:18:33,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 21:18:33,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 21:18:33,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 21:18:33,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:18:32" (1/2) ... [2024-06-03 21:18:33,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65287cc7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:18:33, skipping insertion in model container [2024-06-03 21:18:33,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:18:32" (1/2) ... [2024-06-03 21:18:33,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@28ab98d5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:18:33, skipping insertion in model container [2024-06-03 21:18:33,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:18:33" (2/2) ... [2024-06-03 21:18:33,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65287cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:18:33, skipping insertion in model container [2024-06-03 21:18:33,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:18:33" (2/2) ... [2024-06-03 21:18:33,598 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 21:18:33,646 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 21:18:33,646 INFO L97 edCorrectnessWitness]: Location invariant before [L825-L825] ((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$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 )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$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 )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )y >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) [2024-06-03 21:18:33,649 INFO L97 edCorrectnessWitness]: Location invariant before [L824-L824] ((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$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 )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$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 )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )y >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) [2024-06-03 21:18:33,649 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 21:18:33,649 INFO L106 edCorrectnessWitness]: ghost_update [L822-L822] multithreaded = 1; [2024-06-03 21:18:33,689 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 21:18:34,022 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:18:34,030 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 21:18:34,301 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:18:34,357 INFO L206 MainTranslator]: Completed translation [2024-06-03 21:18:34,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:18:34 WrapperNode [2024-06-03 21:18:34,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 21:18:34,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 21:18:34,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 21:18:34,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 21:18:34,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:18:34" (1/1) ... [2024-06-03 21:18:34,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:18:34" (1/1) ... [2024-06-03 21:18:34,466 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2024-06-03 21:18:34,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 21:18:34,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 21:18:34,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 21:18:34,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 21:18:34,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:18:34" (1/1) ... [2024-06-03 21:18:34,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:18:34" (1/1) ... [2024-06-03 21:18:34,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:18:34" (1/1) ... [2024-06-03 21:18:34,518 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-03 21:18:34,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:18:34" (1/1) ... [2024-06-03 21:18:34,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:18:34" (1/1) ... [2024-06-03 21:18:34,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:18:34" (1/1) ... [2024-06-03 21:18:34,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:18:34" (1/1) ... [2024-06-03 21:18:34,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:18:34" (1/1) ... [2024-06-03 21:18:34,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:18:34" (1/1) ... [2024-06-03 21:18:34,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 21:18:34,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 21:18:34,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 21:18:34,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 21:18:34,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:18:34" (1/1) ... [2024-06-03 21:18:34,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:18:34,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:18:34,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-03 21:18:34,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-03 21:18:34,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 21:18:34,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 21:18:34,618 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 21:18:34,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 21:18:34,618 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 21:18:34,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 21:18:34,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 21:18:34,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 21:18:34,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 21:18:34,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 21:18:34,620 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 21:18:34,716 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 21:18:34,718 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 21:18:35,276 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 21:18:35,276 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 21:18:35,438 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 21:18:35,438 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 21:18:35,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:18:35 BoogieIcfgContainer [2024-06-03 21:18:35,440 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 21:18:35,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 21:18:35,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 21:18:35,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 21:18:35,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:18:32" (1/4) ... [2024-06-03 21:18:35,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad1c41a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:18:35, skipping insertion in model container [2024-06-03 21:18:35,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 09:18:33" (2/4) ... [2024-06-03 21:18:35,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad1c41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:18:35, skipping insertion in model container [2024-06-03 21:18:35,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:18:34" (3/4) ... [2024-06-03 21:18:35,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad1c41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:18:35, skipping insertion in model container [2024-06-03 21:18:35,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:18:35" (4/4) ... [2024-06-03 21:18:35,452 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt_tso.opt.i [2024-06-03 21:18:35,465 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 21:18:35,465 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 21:18:35,465 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 21:18:35,521 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 21:18:35,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-03 21:18:35,586 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-03 21:18:35,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:18:35,593 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-03 21:18:35,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-03 21:18:35,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-03 21:18:35,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 21:18:35,613 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;@70ed4f59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 21:18:35,613 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 21:18:35,618 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 21:18:35,618 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 21:18:35,618 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:18:35,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:35,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 21:18:35,619 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:18:35,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:35,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1928007687, now seen corresponding path program 1 times [2024-06-03 21:18:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:35,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587652283] [2024-06-03 21:18:35,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:35,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:38,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:38,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587652283] [2024-06-03 21:18:38,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587652283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:38,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:38,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 21:18:38,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262584653] [2024-06-03 21:18:38,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:38,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 21:18:38,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:38,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 21:18:38,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 21:18:38,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-03 21:18:38,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:38,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:38,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-03 21:18:38,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:38,669 INFO L124 PetriNetUnfolderBase]: 131/259 cut-off events. [2024-06-03 21:18:38,669 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-03 21:18:38,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 259 events. 131/259 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 969 event pairs, 75 based on Foata normal form. 1/250 useless extension candidates. Maximal degree in co-relation 503. Up to 235 conditions per place. [2024-06-03 21:18:38,674 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 22 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-03 21:18:38,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 117 flow [2024-06-03 21:18:38,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 21:18:38,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 21:18:38,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-06-03 21:18:38,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2024-06-03 21:18:38,685 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 54 transitions. [2024-06-03 21:18:38,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 117 flow [2024-06-03 21:18:38,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 21:18:38,699 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-03 21:18:38,701 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-03 21:18:38,703 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-03 21:18:38,704 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-03 21:18:38,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:38,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:38,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:38,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 21:18:38,705 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:18:38,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:38,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1684465704, now seen corresponding path program 1 times [2024-06-03 21:18:38,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:38,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412129099] [2024-06-03 21:18:38,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:38,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:40,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:40,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412129099] [2024-06-03 21:18:40,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412129099] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:40,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:40,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 21:18:40,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003537028] [2024-06-03 21:18:40,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:40,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 21:18:40,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:40,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 21:18:40,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 21:18:40,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 21:18:40,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:40,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:40,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 21:18:40,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:40,781 INFO L124 PetriNetUnfolderBase]: 150/281 cut-off events. [2024-06-03 21:18:40,782 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-03 21:18:40,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 281 events. 150/281 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1001 event pairs, 68 based on Foata normal form. 2/283 useless extension candidates. Maximal degree in co-relation 636. Up to 258 conditions per place. [2024-06-03 21:18:40,787 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 27 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-03 21:18:40,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 161 flow [2024-06-03 21:18:40,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 21:18:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 21:18:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2024-06-03 21:18:40,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2024-06-03 21:18:40,790 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 66 transitions. [2024-06-03 21:18:40,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 161 flow [2024-06-03 21:18:40,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 21:18:40,793 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-03 21:18:40,794 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-03 21:18:40,795 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-03 21:18:40,795 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-03 21:18:40,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:40,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:40,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:40,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 21:18:40,796 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:18:40,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:40,799 INFO L85 PathProgramCache]: Analyzing trace with hash -678828682, now seen corresponding path program 1 times [2024-06-03 21:18:40,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:40,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565814276] [2024-06-03 21:18:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:43,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:43,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565814276] [2024-06-03 21:18:43,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565814276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:43,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 21:18:43,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272688021] [2024-06-03 21:18:43,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:43,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 21:18:43,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:43,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 21:18:43,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 21:18:43,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 21:18:43,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:43,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:43,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 21:18:43,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:43,714 INFO L124 PetriNetUnfolderBase]: 147/276 cut-off events. [2024-06-03 21:18:43,715 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2024-06-03 21:18:43,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 276 events. 147/276 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 978 event pairs, 47 based on Foata normal form. 2/278 useless extension candidates. Maximal degree in co-relation 697. Up to 244 conditions per place. [2024-06-03 21:18:43,717 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 31 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2024-06-03 21:18:43,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 209 flow [2024-06-03 21:18:43,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:18:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:18:43,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-06-03 21:18:43,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-06-03 21:18:43,721 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 80 transitions. [2024-06-03 21:18:43,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 209 flow [2024-06-03 21:18:43,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 200 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 21:18:43,724 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 119 flow [2024-06-03 21:18:43,724 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-03 21:18:43,725 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-03 21:18:43,725 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 119 flow [2024-06-03 21:18:43,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:43,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:43,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:43,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 21:18:43,726 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-03 21:18:43,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:43,727 INFO L85 PathProgramCache]: Analyzing trace with hash 480685493, now seen corresponding path program 1 times [2024-06-03 21:18:43,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:43,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800965349] [2024-06-03 21:18:43,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:43,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:46,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800965349] [2024-06-03 21:18:46,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800965349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:46,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:46,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:18:46,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515095984] [2024-06-03 21:18:46,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:46,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:18:46,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:46,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:18:46,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:18:46,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 21:18:46,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:46,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:46,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 21:18:46,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:46,622 INFO L124 PetriNetUnfolderBase]: 143/268 cut-off events. [2024-06-03 21:18:46,623 INFO L125 PetriNetUnfolderBase]: For 277/277 co-relation queries the response was YES. [2024-06-03 21:18:46,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 268 events. 143/268 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 920 event pairs, 25 based on Foata normal form. 4/272 useless extension candidates. Maximal degree in co-relation 738. Up to 218 conditions per place. [2024-06-03 21:18:46,624 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 31 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2024-06-03 21:18:46,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 223 flow [2024-06-03 21:18:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:18:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:18:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2024-06-03 21:18:46,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478494623655914 [2024-06-03 21:18:46,626 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 119 flow. Second operand 6 states and 89 transitions. [2024-06-03 21:18:46,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 223 flow [2024-06-03 21:18:46,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 208 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 21:18:46,628 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 116 flow [2024-06-03 21:18:46,628 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-03 21:18:46,628 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-03 21:18:46,629 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 116 flow [2024-06-03 21:18:46,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:46,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:46,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:46,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 21:18:46,629 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-03 21:18:46,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:46,630 INFO L85 PathProgramCache]: Analyzing trace with hash 348982451, now seen corresponding path program 1 times [2024-06-03 21:18:46,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:46,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974691386] [2024-06-03 21:18:46,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:46,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:49,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:49,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974691386] [2024-06-03 21:18:49,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974691386] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:49,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:49,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:18:49,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643647642] [2024-06-03 21:18:49,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:49,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:18:49,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:49,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:18:49,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:18:49,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 21:18:49,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:49,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:49,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 21:18:49,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:49,617 INFO L124 PetriNetUnfolderBase]: 119/238 cut-off events. [2024-06-03 21:18:49,618 INFO L125 PetriNetUnfolderBase]: For 402/402 co-relation queries the response was YES. [2024-06-03 21:18:49,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 238 events. 119/238 cut-off events. For 402/402 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 867 event pairs, 63 based on Foata normal form. 1/238 useless extension candidates. Maximal degree in co-relation 673. Up to 211 conditions per place. [2024-06-03 21:18:49,620 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 24 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2024-06-03 21:18:49,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 206 flow [2024-06-03 21:18:49,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:18:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:18:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2024-06-03 21:18:49,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41397849462365593 [2024-06-03 21:18:49,622 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 116 flow. Second operand 6 states and 77 transitions. [2024-06-03 21:18:49,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 206 flow [2024-06-03 21:18:49,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 184 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 21:18:49,627 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 140 flow [2024-06-03 21:18:49,628 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=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2024-06-03 21:18:49,631 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2024-06-03 21:18:49,632 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 140 flow [2024-06-03 21:18:49,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:49,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:49,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:49,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 21:18:49,633 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:18:49,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:49,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2066444921, now seen corresponding path program 1 times [2024-06-03 21:18:49,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:49,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546778358] [2024-06-03 21:18:49,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:49,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:53,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:53,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546778358] [2024-06-03 21:18:53,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546778358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:53,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:53,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:18:53,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022184194] [2024-06-03 21:18:53,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:53,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:18:53,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:53,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:18:53,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:18:53,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 21:18:53,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 140 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:53,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:53,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 21:18:53,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:53,875 INFO L124 PetriNetUnfolderBase]: 117/235 cut-off events. [2024-06-03 21:18:53,876 INFO L125 PetriNetUnfolderBase]: For 447/447 co-relation queries the response was YES. [2024-06-03 21:18:53,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 235 events. 117/235 cut-off events. For 447/447 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 856 event pairs, 62 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 699. Up to 205 conditions per place. [2024-06-03 21:18:53,878 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 26 selfloop transitions, 9 changer transitions 0/39 dead transitions. [2024-06-03 21:18:53,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 230 flow [2024-06-03 21:18:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:18:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:18:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-06-03 21:18:53,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42473118279569894 [2024-06-03 21:18:53,881 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 140 flow. Second operand 6 states and 79 transitions. [2024-06-03 21:18:53,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 230 flow [2024-06-03 21:18:53,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 217 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 21:18:53,884 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 162 flow [2024-06-03 21:18:53,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-06-03 21:18:53,886 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2024-06-03 21:18:53,886 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 162 flow [2024-06-03 21:18:53,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:53,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:53,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:53,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 21:18:53,887 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:18:53,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:53,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2135383716, now seen corresponding path program 1 times [2024-06-03 21:18:53,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:53,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617295877] [2024-06-03 21:18:53,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:53,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617295877] [2024-06-03 21:18:56,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617295877] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:56,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:56,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:18:56,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041072354] [2024-06-03 21:18:56,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:56,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:18:56,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:56,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:18:56,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:18:57,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:18:57,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:57,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:57,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:18:57,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:57,267 INFO L124 PetriNetUnfolderBase]: 147/278 cut-off events. [2024-06-03 21:18:57,267 INFO L125 PetriNetUnfolderBase]: For 684/684 co-relation queries the response was YES. [2024-06-03 21:18:57,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 278 events. 147/278 cut-off events. For 684/684 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 998 event pairs, 63 based on Foata normal form. 2/280 useless extension candidates. Maximal degree in co-relation 901. Up to 245 conditions per place. [2024-06-03 21:18:57,269 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 34 selfloop transitions, 12 changer transitions 0/49 dead transitions. [2024-06-03 21:18:57,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 304 flow [2024-06-03 21:18:57,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:18:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:18:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-03 21:18:57,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41013824884792627 [2024-06-03 21:18:57,271 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 162 flow. Second operand 7 states and 89 transitions. [2024-06-03 21:18:57,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 304 flow [2024-06-03 21:18:57,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 285 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 21:18:57,274 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 205 flow [2024-06-03 21:18:57,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-06-03 21:18:57,275 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2024-06-03 21:18:57,275 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 205 flow [2024-06-03 21:18:57,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:57,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:57,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:57,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 21:18:57,276 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:18:57,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash 358996050, now seen corresponding path program 2 times [2024-06-03 21:18:57,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:57,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694010652] [2024-06-03 21:18:57,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:57,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:59,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:59,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694010652] [2024-06-03 21:18:59,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694010652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:59,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:59,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:18:59,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450479410] [2024-06-03 21:18:59,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:59,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:18:59,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:59,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:18:59,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:19:00,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:19:00,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 205 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:00,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:00,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:19:00,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:00,252 INFO L124 PetriNetUnfolderBase]: 150/283 cut-off events. [2024-06-03 21:19:00,252 INFO L125 PetriNetUnfolderBase]: For 901/901 co-relation queries the response was YES. [2024-06-03 21:19:00,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 283 events. 150/283 cut-off events. For 901/901 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1005 event pairs, 63 based on Foata normal form. 1/284 useless extension candidates. Maximal degree in co-relation 994. Up to 250 conditions per place. [2024-06-03 21:19:00,254 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 34 selfloop transitions, 12 changer transitions 0/49 dead transitions. [2024-06-03 21:19:00,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 332 flow [2024-06-03 21:19:00,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:19:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:19:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2024-06-03 21:19:00,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41397849462365593 [2024-06-03 21:19:00,255 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 205 flow. Second operand 6 states and 77 transitions. [2024-06-03 21:19:00,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 332 flow [2024-06-03 21:19:00,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 304 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 21:19:00,257 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 231 flow [2024-06-03 21:19:00,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-03 21:19:00,258 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2024-06-03 21:19:00,259 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 231 flow [2024-06-03 21:19:00,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:00,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:00,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:00,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 21:19:00,259 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:19:00,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:00,260 INFO L85 PathProgramCache]: Analyzing trace with hash 359145780, now seen corresponding path program 3 times [2024-06-03 21:19:00,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:00,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456815170] [2024-06-03 21:19:00,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:00,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:19:03,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:03,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456815170] [2024-06-03 21:19:03,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456815170] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:03,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:03,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:19:03,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247932341] [2024-06-03 21:19:03,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:03,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:19:03,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:03,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:19:03,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:19:03,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:19:03,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 231 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:03,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:03,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:19:03,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:03,719 INFO L124 PetriNetUnfolderBase]: 156/297 cut-off events. [2024-06-03 21:19:03,720 INFO L125 PetriNetUnfolderBase]: For 1184/1184 co-relation queries the response was YES. [2024-06-03 21:19:03,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 297 events. 156/297 cut-off events. For 1184/1184 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1107 event pairs, 66 based on Foata normal form. 2/299 useless extension candidates. Maximal degree in co-relation 1102. Up to 244 conditions per place. [2024-06-03 21:19:03,722 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 33 selfloop transitions, 17 changer transitions 0/53 dead transitions. [2024-06-03 21:19:03,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 395 flow [2024-06-03 21:19:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:19:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:19:03,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-06-03 21:19:03,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42473118279569894 [2024-06-03 21:19:03,723 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 231 flow. Second operand 6 states and 79 transitions. [2024-06-03 21:19:03,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 395 flow [2024-06-03 21:19:03,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 372 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 21:19:03,725 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 279 flow [2024-06-03 21:19:03,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=279, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-03 21:19:03,726 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2024-06-03 21:19:03,726 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 279 flow [2024-06-03 21:19:03,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:03,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:03,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:03,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 21:19:03,727 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:19:03,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:03,727 INFO L85 PathProgramCache]: Analyzing trace with hash -448604518, now seen corresponding path program 1 times [2024-06-03 21:19:03,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:03,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611220485] [2024-06-03 21:19:03,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:03,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:19:07,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:07,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611220485] [2024-06-03 21:19:07,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611220485] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:07,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:07,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:19:07,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904077185] [2024-06-03 21:19:07,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:07,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:19:07,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:07,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:19:07,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:19:07,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:19:07,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 279 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:07,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:07,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:19:07,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:07,616 INFO L124 PetriNetUnfolderBase]: 163/311 cut-off events. [2024-06-03 21:19:07,617 INFO L125 PetriNetUnfolderBase]: For 1501/1501 co-relation queries the response was YES. [2024-06-03 21:19:07,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 311 events. 163/311 cut-off events. For 1501/1501 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1169 event pairs, 55 based on Foata normal form. 1/312 useless extension candidates. Maximal degree in co-relation 1221. Up to 261 conditions per place. [2024-06-03 21:19:07,619 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 44 selfloop transitions, 16 changer transitions 0/63 dead transitions. [2024-06-03 21:19:07,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 465 flow [2024-06-03 21:19:07,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:19:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:19:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-03 21:19:07,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40725806451612906 [2024-06-03 21:19:07,620 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 279 flow. Second operand 8 states and 101 transitions. [2024-06-03 21:19:07,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 465 flow [2024-06-03 21:19:07,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 449 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-03 21:19:07,623 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 345 flow [2024-06-03 21:19:07,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=345, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2024-06-03 21:19:07,623 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2024-06-03 21:19:07,624 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 345 flow [2024-06-03 21:19:07,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:07,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:07,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:07,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 21:19:07,624 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:19:07,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:07,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1751018876, now seen corresponding path program 2 times [2024-06-03 21:19:07,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:07,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889360702] [2024-06-03 21:19:07,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:07,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:10,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-03 21:19:10,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:10,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889360702] [2024-06-03 21:19:10,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889360702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:10,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:10,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:19:10,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663457777] [2024-06-03 21:19:10,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:10,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:19:10,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:10,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:19:10,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:19:10,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:19:10,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 345 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:10,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:10,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:19:10,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:11,003 INFO L124 PetriNetUnfolderBase]: 170/326 cut-off events. [2024-06-03 21:19:11,004 INFO L125 PetriNetUnfolderBase]: For 1895/1895 co-relation queries the response was YES. [2024-06-03 21:19:11,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 326 events. 170/326 cut-off events. For 1895/1895 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1257 event pairs, 60 based on Foata normal form. 1/327 useless extension candidates. Maximal degree in co-relation 1378. Up to 282 conditions per place. [2024-06-03 21:19:11,006 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 49 selfloop transitions, 14 changer transitions 0/66 dead transitions. [2024-06-03 21:19:11,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 539 flow [2024-06-03 21:19:11,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:19:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:19:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-03 21:19:11,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675 [2024-06-03 21:19:11,008 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 345 flow. Second operand 8 states and 99 transitions. [2024-06-03 21:19:11,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 539 flow [2024-06-03 21:19:11,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 66 transitions, 490 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-03 21:19:11,011 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 378 flow [2024-06-03 21:19:11,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=378, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-06-03 21:19:11,011 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2024-06-03 21:19:11,011 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 378 flow [2024-06-03 21:19:11,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:11,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:11,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:11,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 21:19:11,012 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:19:11,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:11,012 INFO L85 PathProgramCache]: Analyzing trace with hash -920208844, now seen corresponding path program 1 times [2024-06-03 21:19:11,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:11,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142274869] [2024-06-03 21:19:11,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:11,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:19:14,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:14,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142274869] [2024-06-03 21:19:14,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142274869] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:14,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:14,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:19:14,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873715051] [2024-06-03 21:19:14,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:14,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:19:14,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:14,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:19:14,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:19:14,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:19:14,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 378 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:14,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:14,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:19:14,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:14,877 INFO L124 PetriNetUnfolderBase]: 176/336 cut-off events. [2024-06-03 21:19:14,877 INFO L125 PetriNetUnfolderBase]: For 2285/2285 co-relation queries the response was YES. [2024-06-03 21:19:14,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1489 conditions, 336 events. 176/336 cut-off events. For 2285/2285 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1297 event pairs, 59 based on Foata normal form. 2/338 useless extension candidates. Maximal degree in co-relation 1457. Up to 288 conditions per place. [2024-06-03 21:19:14,879 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 50 selfloop transitions, 16 changer transitions 0/69 dead transitions. [2024-06-03 21:19:14,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 560 flow [2024-06-03 21:19:14,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:19:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:19:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-03 21:19:14,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-03 21:19:14,881 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 378 flow. Second operand 8 states and 100 transitions. [2024-06-03 21:19:14,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 560 flow [2024-06-03 21:19:14,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 69 transitions, 520 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-03 21:19:14,884 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 403 flow [2024-06-03 21:19:14,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=403, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2024-06-03 21:19:14,884 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2024-06-03 21:19:14,885 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 403 flow [2024-06-03 21:19:14,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:14,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:14,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:14,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 21:19:14,885 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:19:14,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:14,886 INFO L85 PathProgramCache]: Analyzing trace with hash 870430346, now seen corresponding path program 3 times [2024-06-03 21:19:14,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:14,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666348531] [2024-06-03 21:19:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:19:18,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:18,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666348531] [2024-06-03 21:19:18,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666348531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:18,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:18,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:19:18,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459771086] [2024-06-03 21:19:18,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:18,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:19:18,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:18,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:19:18,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:19:18,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:19:18,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 403 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:18,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:18,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:19:18,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:18,557 INFO L124 PetriNetUnfolderBase]: 174/333 cut-off events. [2024-06-03 21:19:18,557 INFO L125 PetriNetUnfolderBase]: For 2531/2531 co-relation queries the response was YES. [2024-06-03 21:19:18,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 333 events. 174/333 cut-off events. For 2531/2531 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1288 event pairs, 54 based on Foata normal form. 1/334 useless extension candidates. Maximal degree in co-relation 1503. Up to 272 conditions per place. [2024-06-03 21:19:18,559 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 46 selfloop transitions, 21 changer transitions 0/70 dead transitions. [2024-06-03 21:19:18,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 70 transitions, 591 flow [2024-06-03 21:19:18,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:19:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:19:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-03 21:19:18,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147465437788018 [2024-06-03 21:19:18,560 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 403 flow. Second operand 7 states and 90 transitions. [2024-06-03 21:19:18,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 70 transitions, 591 flow [2024-06-03 21:19:18,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 550 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 21:19:18,564 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 447 flow [2024-06-03 21:19:18,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=447, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2024-06-03 21:19:18,564 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2024-06-03 21:19:18,565 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 447 flow [2024-06-03 21:19:18,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:18,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:18,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:18,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 21:19:18,565 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:19:18,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:18,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1303968120, now seen corresponding path program 4 times [2024-06-03 21:19:18,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:18,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658306535] [2024-06-03 21:19:18,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:18,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:19:21,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:21,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658306535] [2024-06-03 21:19:21,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658306535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:21,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:21,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:19:21,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927729285] [2024-06-03 21:19:21,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:21,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:19:21,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:21,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:19:21,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:19:22,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:19:22,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 447 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:22,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:22,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:19:22,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:22,335 INFO L124 PetriNetUnfolderBase]: 172/330 cut-off events. [2024-06-03 21:19:22,335 INFO L125 PetriNetUnfolderBase]: For 2870/2870 co-relation queries the response was YES. [2024-06-03 21:19:22,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 330 events. 172/330 cut-off events. For 2870/2870 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1280 event pairs, 59 based on Foata normal form. 1/331 useless extension candidates. Maximal degree in co-relation 1540. Up to 282 conditions per place. [2024-06-03 21:19:22,337 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 49 selfloop transitions, 16 changer transitions 0/68 dead transitions. [2024-06-03 21:19:22,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 68 transitions, 597 flow [2024-06-03 21:19:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:19:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:19:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-03 21:19:22,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4009216589861751 [2024-06-03 21:19:22,339 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 447 flow. Second operand 7 states and 87 transitions. [2024-06-03 21:19:22,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 68 transitions, 597 flow [2024-06-03 21:19:22,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 68 transitions, 534 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-03 21:19:22,343 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 423 flow [2024-06-03 21:19:22,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=423, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2024-06-03 21:19:22,343 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2024-06-03 21:19:22,343 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 423 flow [2024-06-03 21:19:22,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:22,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:22,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:22,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 21:19:22,344 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:19:22,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:22,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1303967934, now seen corresponding path program 2 times [2024-06-03 21:19:22,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:22,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217948411] [2024-06-03 21:19:22,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:22,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:19:25,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:25,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217948411] [2024-06-03 21:19:25,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217948411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:25,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:25,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:19:25,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716873426] [2024-06-03 21:19:25,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:25,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:19:25,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:25,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:19:25,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:19:26,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:19:26,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 423 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:26,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:26,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:19:26,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:26,290 INFO L124 PetriNetUnfolderBase]: 178/340 cut-off events. [2024-06-03 21:19:26,290 INFO L125 PetriNetUnfolderBase]: For 2387/2387 co-relation queries the response was YES. [2024-06-03 21:19:26,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 340 events. 178/340 cut-off events. For 2387/2387 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1326 event pairs, 59 based on Foata normal form. 2/342 useless extension candidates. Maximal degree in co-relation 1496. Up to 280 conditions per place. [2024-06-03 21:19:26,292 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 47 selfloop transitions, 21 changer transitions 0/71 dead transitions. [2024-06-03 21:19:26,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 603 flow [2024-06-03 21:19:26,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:19:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:19:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-03 21:19:26,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41013824884792627 [2024-06-03 21:19:26,293 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 423 flow. Second operand 7 states and 89 transitions. [2024-06-03 21:19:26,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 603 flow [2024-06-03 21:19:26,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 71 transitions, 559 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-03 21:19:26,297 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 463 flow [2024-06-03 21:19:26,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=463, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2024-06-03 21:19:26,297 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2024-06-03 21:19:26,297 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 463 flow [2024-06-03 21:19:26,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:26,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:26,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:26,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 21:19:26,298 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:19:26,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:26,298 INFO L85 PathProgramCache]: Analyzing trace with hash -662096814, now seen corresponding path program 3 times [2024-06-03 21:19:26,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:26,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598963203] [2024-06-03 21:19:26,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:26,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:30,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-03 21:19:30,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:30,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598963203] [2024-06-03 21:19:30,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598963203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:30,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:30,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:19:30,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569631416] [2024-06-03 21:19:30,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:30,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:19:30,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:30,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:19:30,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:19:30,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:19:30,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 463 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:30,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:30,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:19:30,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:30,541 INFO L124 PetriNetUnfolderBase]: 184/350 cut-off events. [2024-06-03 21:19:30,541 INFO L125 PetriNetUnfolderBase]: For 2884/2884 co-relation queries the response was YES. [2024-06-03 21:19:30,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1671 conditions, 350 events. 184/350 cut-off events. For 2884/2884 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1377 event pairs, 62 based on Foata normal form. 2/352 useless extension candidates. Maximal degree in co-relation 1635. Up to 287 conditions per place. [2024-06-03 21:19:30,544 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 50 selfloop transitions, 20 changer transitions 0/73 dead transitions. [2024-06-03 21:19:30,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 73 transitions, 657 flow [2024-06-03 21:19:30,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:19:30,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:19:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-03 21:19:30,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41013824884792627 [2024-06-03 21:19:30,546 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 463 flow. Second operand 7 states and 89 transitions. [2024-06-03 21:19:30,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 73 transitions, 657 flow [2024-06-03 21:19:30,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 73 transitions, 597 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-03 21:19:30,550 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 487 flow [2024-06-03 21:19:30,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=487, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2024-06-03 21:19:30,550 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 43 predicate places. [2024-06-03 21:19:30,551 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 487 flow [2024-06-03 21:19:30,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:30,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:30,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:30,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 21:19:30,553 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:19:30,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:30,553 INFO L85 PathProgramCache]: Analyzing trace with hash 995590324, now seen corresponding path program 4 times [2024-06-03 21:19:30,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:30,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893754420] [2024-06-03 21:19:30,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:30,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:34,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:19:34,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:34,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893754420] [2024-06-03 21:19:34,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893754420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:34,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:34,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:19:34,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190685768] [2024-06-03 21:19:34,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:34,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:19:34,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:34,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:19:34,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:19:34,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:19:34,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 487 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:34,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:34,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:19:34,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:34,805 INFO L124 PetriNetUnfolderBase]: 182/347 cut-off events. [2024-06-03 21:19:34,805 INFO L125 PetriNetUnfolderBase]: For 2737/2737 co-relation queries the response was YES. [2024-06-03 21:19:34,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1640 conditions, 347 events. 182/347 cut-off events. For 2737/2737 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1359 event pairs, 62 based on Foata normal form. 1/348 useless extension candidates. Maximal degree in co-relation 1603. Up to 266 conditions per place. [2024-06-03 21:19:34,808 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 45 selfloop transitions, 29 changer transitions 0/77 dead transitions. [2024-06-03 21:19:34,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 77 transitions, 685 flow [2024-06-03 21:19:34,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:19:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:19:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-03 21:19:34,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41013824884792627 [2024-06-03 21:19:34,809 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 487 flow. Second operand 7 states and 89 transitions. [2024-06-03 21:19:34,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 77 transitions, 685 flow [2024-06-03 21:19:34,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 77 transitions, 631 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-03 21:19:34,813 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 545 flow [2024-06-03 21:19:34,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=545, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2024-06-03 21:19:34,814 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2024-06-03 21:19:34,814 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 545 flow [2024-06-03 21:19:34,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:34,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:34,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:34,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 21:19:34,815 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:19:34,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:34,815 INFO L85 PathProgramCache]: Analyzing trace with hash 995599252, now seen corresponding path program 1 times [2024-06-03 21:19:34,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:34,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235409971] [2024-06-03 21:19:34,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:19:38,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:38,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235409971] [2024-06-03 21:19:38,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235409971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:38,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:38,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:19:38,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582671161] [2024-06-03 21:19:38,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:38,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:19:38,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:38,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:19:38,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:19:38,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:19:38,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 545 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:38,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:38,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:19:38,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:39,141 INFO L124 PetriNetUnfolderBase]: 180/343 cut-off events. [2024-06-03 21:19:39,142 INFO L125 PetriNetUnfolderBase]: For 3099/3099 co-relation queries the response was YES. [2024-06-03 21:19:39,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 343 events. 180/343 cut-off events. For 3099/3099 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1322 event pairs, 69 based on Foata normal form. 1/344 useless extension candidates. Maximal degree in co-relation 1666. Up to 307 conditions per place. [2024-06-03 21:19:39,144 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 63 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2024-06-03 21:19:39,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 78 transitions, 719 flow [2024-06-03 21:19:39,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:19:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:19:39,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-03 21:19:39,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391705069124424 [2024-06-03 21:19:39,146 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 545 flow. Second operand 7 states and 85 transitions. [2024-06-03 21:19:39,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 78 transitions, 719 flow [2024-06-03 21:19:39,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 78 transitions, 687 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-03 21:19:39,152 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 557 flow [2024-06-03 21:19:39,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=557, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2024-06-03 21:19:39,152 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 50 predicate places. [2024-06-03 21:19:39,152 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 557 flow [2024-06-03 21:19:39,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:39,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:39,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:39,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 21:19:39,153 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:19:39,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:39,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1029714512, now seen corresponding path program 1 times [2024-06-03 21:19:39,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:39,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978640968] [2024-06-03 21:19:39,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:39,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:19:44,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:44,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978640968] [2024-06-03 21:19:44,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978640968] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:44,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:44,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:19:44,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551200952] [2024-06-03 21:19:44,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:44,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:19:44,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:44,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:19:44,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:19:44,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:19:44,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 557 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:44,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:44,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:19:44,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:44,451 INFO L124 PetriNetUnfolderBase]: 183/349 cut-off events. [2024-06-03 21:19:44,451 INFO L125 PetriNetUnfolderBase]: For 3325/3325 co-relation queries the response was YES. [2024-06-03 21:19:44,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 349 events. 183/349 cut-off events. For 3325/3325 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1350 event pairs, 51 based on Foata normal form. 1/350 useless extension candidates. Maximal degree in co-relation 1745. Up to 291 conditions per place. [2024-06-03 21:19:44,454 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 64 selfloop transitions, 20 changer transitions 0/87 dead transitions. [2024-06-03 21:19:44,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 87 transitions, 781 flow [2024-06-03 21:19:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:19:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:19:44,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-03 21:19:44,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-03 21:19:44,455 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 557 flow. Second operand 9 states and 111 transitions. [2024-06-03 21:19:44,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 87 transitions, 781 flow [2024-06-03 21:19:44,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 87 transitions, 720 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 21:19:44,459 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 567 flow [2024-06-03 21:19:44,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=567, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2024-06-03 21:19:44,460 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2024-06-03 21:19:44,460 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 567 flow [2024-06-03 21:19:44,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:44,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:44,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:44,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 21:19:44,460 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:19:44,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:44,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1552988706, now seen corresponding path program 2 times [2024-06-03 21:19:44,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:44,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941095044] [2024-06-03 21:19:44,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:44,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:49,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-03 21:19:49,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:49,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941095044] [2024-06-03 21:19:49,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941095044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:49,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:49,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:19:49,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110996395] [2024-06-03 21:19:49,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:49,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:19:49,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:49,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:19:49,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:19:49,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:19:49,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 567 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:49,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:49,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:19:49,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:49,547 INFO L124 PetriNetUnfolderBase]: 186/356 cut-off events. [2024-06-03 21:19:49,547 INFO L125 PetriNetUnfolderBase]: For 3795/3795 co-relation queries the response was YES. [2024-06-03 21:19:49,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 356 events. 186/356 cut-off events. For 3795/3795 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1402 event pairs, 57 based on Foata normal form. 1/357 useless extension candidates. Maximal degree in co-relation 1806. Up to 307 conditions per place. [2024-06-03 21:19:49,550 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 69 selfloop transitions, 16 changer transitions 0/88 dead transitions. [2024-06-03 21:19:49,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 88 transitions, 795 flow [2024-06-03 21:19:49,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:19:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:19:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-03 21:19:49,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-03 21:19:49,551 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 567 flow. Second operand 9 states and 109 transitions. [2024-06-03 21:19:49,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 88 transitions, 795 flow [2024-06-03 21:19:49,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 88 transitions, 740 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-03 21:19:49,556 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 579 flow [2024-06-03 21:19:49,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=579, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2024-06-03 21:19:49,557 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 55 predicate places. [2024-06-03 21:19:49,557 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 579 flow [2024-06-03 21:19:49,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:49,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:49,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:49,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 21:19:49,558 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:19:49,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:49,558 INFO L85 PathProgramCache]: Analyzing trace with hash -912034566, now seen corresponding path program 3 times [2024-06-03 21:19:49,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:49,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160898920] [2024-06-03 21:19:49,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:49,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:19:57,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:57,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160898920] [2024-06-03 21:19:57,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160898920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:57,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:57,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:19:57,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132887699] [2024-06-03 21:19:57,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:57,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:19:57,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:57,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:19:57,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:19:57,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 21:19:57,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 579 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:57,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:57,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 21:19:57,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:57,511 INFO L124 PetriNetUnfolderBase]: 189/361 cut-off events. [2024-06-03 21:19:57,511 INFO L125 PetriNetUnfolderBase]: For 4308/4308 co-relation queries the response was YES. [2024-06-03 21:19:57,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1907 conditions, 361 events. 189/361 cut-off events. For 4308/4308 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1426 event pairs, 57 based on Foata normal form. 1/362 useless extension candidates. Maximal degree in co-relation 1865. Up to 308 conditions per place. [2024-06-03 21:19:57,514 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 69 selfloop transitions, 18 changer transitions 0/90 dead transitions. [2024-06-03 21:19:57,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 90 transitions, 817 flow [2024-06-03 21:19:57,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:19:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:19:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-03 21:19:57,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36200716845878134 [2024-06-03 21:19:57,515 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 579 flow. Second operand 9 states and 101 transitions. [2024-06-03 21:19:57,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 90 transitions, 817 flow [2024-06-03 21:19:57,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 90 transitions, 766 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-03 21:19:57,521 INFO L231 Difference]: Finished difference. Result has 87 places, 78 transitions, 603 flow [2024-06-03 21:19:57,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=603, PETRI_PLACES=87, PETRI_TRANSITIONS=78} [2024-06-03 21:19:57,521 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2024-06-03 21:19:57,521 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 78 transitions, 603 flow [2024-06-03 21:19:57,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:57,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:57,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:57,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 21:19:57,522 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:19:57,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:57,522 INFO L85 PathProgramCache]: Analyzing trace with hash -912034349, now seen corresponding path program 1 times [2024-06-03 21:19:57,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:57,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940339431] [2024-06-03 21:19:57,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:57,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:01,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:20:01,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:01,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940339431] [2024-06-03 21:20:01,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940339431] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:01,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:01,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:01,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748368763] [2024-06-03 21:20:01,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:01,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:01,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:01,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:01,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:01,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:20:01,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 78 transitions, 603 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:01,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:01,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:20:01,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:02,144 INFO L124 PetriNetUnfolderBase]: 195/371 cut-off events. [2024-06-03 21:20:02,144 INFO L125 PetriNetUnfolderBase]: For 4910/4910 co-relation queries the response was YES. [2024-06-03 21:20:02,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1996 conditions, 371 events. 195/371 cut-off events. For 4910/4910 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1473 event pairs, 56 based on Foata normal form. 2/373 useless extension candidates. Maximal degree in co-relation 1953. Up to 315 conditions per place. [2024-06-03 21:20:02,147 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 71 selfloop transitions, 19 changer transitions 0/93 dead transitions. [2024-06-03 21:20:02,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 853 flow [2024-06-03 21:20:02,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:20:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:20:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-03 21:20:02,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-03 21:20:02,148 INFO L175 Difference]: Start difference. First operand has 87 places, 78 transitions, 603 flow. Second operand 9 states and 111 transitions. [2024-06-03 21:20:02,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 853 flow [2024-06-03 21:20:02,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 93 transitions, 794 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-03 21:20:02,154 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 630 flow [2024-06-03 21:20:02,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=630, PETRI_PLACES=89, PETRI_TRANSITIONS=81} [2024-06-03 21:20:02,155 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2024-06-03 21:20:02,155 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 630 flow [2024-06-03 21:20:02,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:02,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:02,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:02,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 21:20:02,156 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:20:02,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:02,156 INFO L85 PathProgramCache]: Analyzing trace with hash 591726602, now seen corresponding path program 4 times [2024-06-03 21:20:02,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:02,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537957251] [2024-06-03 21:20:02,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:06,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:20:06,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:06,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537957251] [2024-06-03 21:20:06,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537957251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:06,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:06,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:06,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713129567] [2024-06-03 21:20:06,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:06,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:06,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:06,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:06,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:06,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:20:06,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 630 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:06,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:06,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:20:06,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:07,060 INFO L124 PetriNetUnfolderBase]: 198/378 cut-off events. [2024-06-03 21:20:07,061 INFO L125 PetriNetUnfolderBase]: For 5269/5269 co-relation queries the response was YES. [2024-06-03 21:20:07,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2093 conditions, 378 events. 198/378 cut-off events. For 5269/5269 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1511 event pairs, 50 based on Foata normal form. 1/379 useless extension candidates. Maximal degree in co-relation 2049. Up to 304 conditions per place. [2024-06-03 21:20:07,064 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 64 selfloop transitions, 27 changer transitions 0/94 dead transitions. [2024-06-03 21:20:07,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 94 transitions, 876 flow [2024-06-03 21:20:07,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:20:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:20:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-03 21:20:07,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-03 21:20:07,066 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 630 flow. Second operand 8 states and 100 transitions. [2024-06-03 21:20:07,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 94 transitions, 876 flow [2024-06-03 21:20:07,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 94 transitions, 812 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-03 21:20:07,073 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 671 flow [2024-06-03 21:20:07,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=671, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2024-06-03 21:20:07,073 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2024-06-03 21:20:07,073 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 671 flow [2024-06-03 21:20:07,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:07,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:07,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:07,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 21:20:07,074 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:20:07,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:07,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1900307309, now seen corresponding path program 2 times [2024-06-03 21:20:07,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:07,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725199735] [2024-06-03 21:20:07,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:07,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:20:11,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:11,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725199735] [2024-06-03 21:20:11,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725199735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:11,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:11,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:11,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226450368] [2024-06-03 21:20:11,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:11,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:11,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:11,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:11,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:11,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:20:11,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 671 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:11,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:11,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:20:11,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:11,756 INFO L124 PetriNetUnfolderBase]: 210/398 cut-off events. [2024-06-03 21:20:11,756 INFO L125 PetriNetUnfolderBase]: For 6729/6729 co-relation queries the response was YES. [2024-06-03 21:20:11,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2263 conditions, 398 events. 210/398 cut-off events. For 6729/6729 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1619 event pairs, 56 based on Foata normal form. 4/402 useless extension candidates. Maximal degree in co-relation 2218. Up to 312 conditions per place. [2024-06-03 21:20:11,759 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 67 selfloop transitions, 26 changer transitions 0/96 dead transitions. [2024-06-03 21:20:11,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 927 flow [2024-06-03 21:20:11,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:20:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:20:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-03 21:20:11,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40725806451612906 [2024-06-03 21:20:11,762 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 671 flow. Second operand 8 states and 101 transitions. [2024-06-03 21:20:11,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 927 flow [2024-06-03 21:20:11,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 96 transitions, 842 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-03 21:20:11,769 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 695 flow [2024-06-03 21:20:11,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=695, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2024-06-03 21:20:11,769 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 62 predicate places. [2024-06-03 21:20:11,770 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 695 flow [2024-06-03 21:20:11,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:11,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:11,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:11,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 21:20:11,770 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:20:11,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:11,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1397851736, now seen corresponding path program 5 times [2024-06-03 21:20:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:11,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60386955] [2024-06-03 21:20:11,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:11,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:20:17,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:17,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60386955] [2024-06-03 21:20:17,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60386955] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:17,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:17,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:17,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450449187] [2024-06-03 21:20:17,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:17,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:17,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:17,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:17,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:17,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:20:17,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 695 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:17,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:17,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:20:17,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:17,684 INFO L124 PetriNetUnfolderBase]: 213/405 cut-off events. [2024-06-03 21:20:17,685 INFO L125 PetriNetUnfolderBase]: For 5527/5527 co-relation queries the response was YES. [2024-06-03 21:20:17,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 405 events. 213/405 cut-off events. For 5527/5527 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1663 event pairs, 56 based on Foata normal form. 1/406 useless extension candidates. Maximal degree in co-relation 2223. Up to 333 conditions per place. [2024-06-03 21:20:17,688 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 69 selfloop transitions, 26 changer transitions 0/98 dead transitions. [2024-06-03 21:20:17,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 98 transitions, 943 flow [2024-06-03 21:20:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:20:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:20:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-03 21:20:17,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 21:20:17,697 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 695 flow. Second operand 9 states and 108 transitions. [2024-06-03 21:20:17,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 98 transitions, 943 flow [2024-06-03 21:20:17,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 870 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-03 21:20:17,710 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 720 flow [2024-06-03 21:20:17,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=720, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2024-06-03 21:20:17,711 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2024-06-03 21:20:17,711 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 720 flow [2024-06-03 21:20:17,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:17,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:17,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:17,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 21:20:17,712 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:20:17,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:17,712 INFO L85 PathProgramCache]: Analyzing trace with hash 791178339, now seen corresponding path program 3 times [2024-06-03 21:20:17,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:17,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2327446] [2024-06-03 21:20:17,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:17,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:20:21,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:21,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2327446] [2024-06-03 21:20:21,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2327446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:21,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:21,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140840280] [2024-06-03 21:20:21,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:21,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:21,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:21,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:21,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:21,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:20:21,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 720 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:21,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:21,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:20:21,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:21,786 INFO L124 PetriNetUnfolderBase]: 225/425 cut-off events. [2024-06-03 21:20:21,786 INFO L125 PetriNetUnfolderBase]: For 6746/6746 co-relation queries the response was YES. [2024-06-03 21:20:21,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2401 conditions, 425 events. 225/425 cut-off events. For 6746/6746 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1753 event pairs, 58 based on Foata normal form. 4/429 useless extension candidates. Maximal degree in co-relation 2354. Up to 344 conditions per place. [2024-06-03 21:20:21,790 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 74 selfloop transitions, 23 changer transitions 0/100 dead transitions. [2024-06-03 21:20:21,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 100 transitions, 998 flow [2024-06-03 21:20:21,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:20:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:20:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-03 21:20:21,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40725806451612906 [2024-06-03 21:20:21,801 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 720 flow. Second operand 8 states and 101 transitions. [2024-06-03 21:20:21,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 100 transitions, 998 flow [2024-06-03 21:20:21,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 100 transitions, 918 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-03 21:20:21,809 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 744 flow [2024-06-03 21:20:21,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=744, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2024-06-03 21:20:21,809 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 66 predicate places. [2024-06-03 21:20:21,809 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 744 flow [2024-06-03 21:20:21,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:21,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:21,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:21,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 21:20:21,810 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:20:21,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:21,810 INFO L85 PathProgramCache]: Analyzing trace with hash 791178122, now seen corresponding path program 6 times [2024-06-03 21:20:21,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:21,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308305994] [2024-06-03 21:20:21,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:21,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:20:26,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:26,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308305994] [2024-06-03 21:20:26,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308305994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:26,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:26,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:26,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018482208] [2024-06-03 21:20:26,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:26,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:26,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:26,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:26,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:26,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:20:26,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 744 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:26,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:26,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:20:26,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:27,022 INFO L124 PetriNetUnfolderBase]: 228/432 cut-off events. [2024-06-03 21:20:27,022 INFO L125 PetriNetUnfolderBase]: For 6251/6251 co-relation queries the response was YES. [2024-06-03 21:20:27,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2446 conditions, 432 events. 228/432 cut-off events. For 6251/6251 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1801 event pairs, 58 based on Foata normal form. 1/433 useless extension candidates. Maximal degree in co-relation 2398. Up to 358 conditions per place. [2024-06-03 21:20:27,026 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 76 selfloop transitions, 22 changer transitions 0/101 dead transitions. [2024-06-03 21:20:27,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 101 transitions, 1010 flow [2024-06-03 21:20:27,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:20:27,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:20:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-03 21:20:27,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675 [2024-06-03 21:20:27,027 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 744 flow. Second operand 8 states and 99 transitions. [2024-06-03 21:20:27,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 101 transitions, 1010 flow [2024-06-03 21:20:27,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 934 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-03 21:20:27,036 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 757 flow [2024-06-03 21:20:27,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=757, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2024-06-03 21:20:27,037 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 68 predicate places. [2024-06-03 21:20:27,037 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 757 flow [2024-06-03 21:20:27,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:27,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:27,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:27,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 21:20:27,037 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:20:27,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:27,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1541951733, now seen corresponding path program 4 times [2024-06-03 21:20:27,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:27,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109960976] [2024-06-03 21:20:27,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:27,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:20:31,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:31,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109960976] [2024-06-03 21:20:31,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109960976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:31,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:31,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:31,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659935962] [2024-06-03 21:20:31,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:31,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:31,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:31,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:31,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:31,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:20:31,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 757 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:31,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:31,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:20:31,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:32,266 INFO L124 PetriNetUnfolderBase]: 231/436 cut-off events. [2024-06-03 21:20:32,266 INFO L125 PetriNetUnfolderBase]: For 6631/6631 co-relation queries the response was YES. [2024-06-03 21:20:32,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 436 events. 231/436 cut-off events. For 6631/6631 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1820 event pairs, 70 based on Foata normal form. 1/437 useless extension candidates. Maximal degree in co-relation 2406. Up to 392 conditions per place. [2024-06-03 21:20:32,269 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 86 selfloop transitions, 13 changer transitions 0/102 dead transitions. [2024-06-03 21:20:32,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 102 transitions, 995 flow [2024-06-03 21:20:32,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:20:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:20:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-03 21:20:32,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-03 21:20:32,270 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 757 flow. Second operand 8 states and 94 transitions. [2024-06-03 21:20:32,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 102 transitions, 995 flow [2024-06-03 21:20:32,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 102 transitions, 922 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-03 21:20:32,279 INFO L231 Difference]: Finished difference. Result has 100 places, 95 transitions, 743 flow [2024-06-03 21:20:32,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=743, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2024-06-03 21:20:32,279 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 70 predicate places. [2024-06-03 21:20:32,279 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 743 flow [2024-06-03 21:20:32,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:32,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:32,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:32,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 21:20:32,280 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:20:32,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:32,280 INFO L85 PathProgramCache]: Analyzing trace with hash 950037856, now seen corresponding path program 7 times [2024-06-03 21:20:32,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:32,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778603606] [2024-06-03 21:20:32,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:32,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:20:37,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:37,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778603606] [2024-06-03 21:20:37,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778603606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:37,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:37,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:37,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19180484] [2024-06-03 21:20:37,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:37,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:37,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:37,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:37,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:20:37,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 743 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:37,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:37,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:20:37,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:38,089 INFO L124 PetriNetUnfolderBase]: 229/434 cut-off events. [2024-06-03 21:20:38,089 INFO L125 PetriNetUnfolderBase]: For 6709/6709 co-relation queries the response was YES. [2024-06-03 21:20:38,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2417 conditions, 434 events. 229/434 cut-off events. For 6709/6709 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1810 event pairs, 59 based on Foata normal form. 1/435 useless extension candidates. Maximal degree in co-relation 2367. Up to 333 conditions per place. [2024-06-03 21:20:38,105 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 67 selfloop transitions, 38 changer transitions 0/108 dead transitions. [2024-06-03 21:20:38,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 108 transitions, 1042 flow [2024-06-03 21:20:38,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:20:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:20:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-03 21:20:38,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 21:20:38,107 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 743 flow. Second operand 10 states and 120 transitions. [2024-06-03 21:20:38,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 108 transitions, 1042 flow [2024-06-03 21:20:38,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 108 transitions, 998 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-03 21:20:38,115 INFO L231 Difference]: Finished difference. Result has 105 places, 99 transitions, 861 flow [2024-06-03 21:20:38,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=861, PETRI_PLACES=105, PETRI_TRANSITIONS=99} [2024-06-03 21:20:38,116 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 75 predicate places. [2024-06-03 21:20:38,116 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 99 transitions, 861 flow [2024-06-03 21:20:38,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:38,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:38,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:38,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 21:20:38,116 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:20:38,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:38,117 INFO L85 PathProgramCache]: Analyzing trace with hash 798529989, now seen corresponding path program 5 times [2024-06-03 21:20:38,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:38,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146450509] [2024-06-03 21:20:38,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:38,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:20:41,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:41,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146450509] [2024-06-03 21:20:41,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146450509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:41,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:41,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:41,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160244878] [2024-06-03 21:20:41,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:41,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:41,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:41,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:41,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:42,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:20:42,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 99 transitions, 861 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:42,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:42,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:20:42,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:42,255 INFO L124 PetriNetUnfolderBase]: 230/436 cut-off events. [2024-06-03 21:20:42,255 INFO L125 PetriNetUnfolderBase]: For 7495/7495 co-relation queries the response was YES. [2024-06-03 21:20:42,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2518 conditions, 436 events. 230/436 cut-off events. For 7495/7495 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1824 event pairs, 58 based on Foata normal form. 2/438 useless extension candidates. Maximal degree in co-relation 2466. Up to 292 conditions per place. [2024-06-03 21:20:42,259 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 68 selfloop transitions, 42 changer transitions 0/113 dead transitions. [2024-06-03 21:20:42,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 113 transitions, 1221 flow [2024-06-03 21:20:42,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:20:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:20:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-03 21:20:42,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42338709677419356 [2024-06-03 21:20:42,262 INFO L175 Difference]: Start difference. First operand has 105 places, 99 transitions, 861 flow. Second operand 8 states and 105 transitions. [2024-06-03 21:20:42,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 113 transitions, 1221 flow [2024-06-03 21:20:42,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 113 transitions, 1091 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-06-03 21:20:42,272 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 886 flow [2024-06-03 21:20:42,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=886, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2024-06-03 21:20:42,273 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 76 predicate places. [2024-06-03 21:20:42,273 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 886 flow [2024-06-03 21:20:42,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:42,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:42,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:42,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 21:20:42,274 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:20:42,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:42,274 INFO L85 PathProgramCache]: Analyzing trace with hash 798806819, now seen corresponding path program 1 times [2024-06-03 21:20:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:42,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678645782] [2024-06-03 21:20:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:42,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:46,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-03 21:20:46,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:46,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678645782] [2024-06-03 21:20:46,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678645782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:46,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:46,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:46,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839707770] [2024-06-03 21:20:46,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:46,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:46,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:46,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:46,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:46,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:20:46,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 886 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:46,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:46,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:20:46,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:46,593 INFO L124 PetriNetUnfolderBase]: 227/430 cut-off events. [2024-06-03 21:20:46,593 INFO L125 PetriNetUnfolderBase]: For 6885/6885 co-relation queries the response was YES. [2024-06-03 21:20:46,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2427 conditions, 430 events. 227/430 cut-off events. For 6885/6885 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1779 event pairs, 69 based on Foata normal form. 2/432 useless extension candidates. Maximal degree in co-relation 2374. Up to 380 conditions per place. [2024-06-03 21:20:46,596 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 95 selfloop transitions, 13 changer transitions 0/111 dead transitions. [2024-06-03 21:20:46,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 111 transitions, 1120 flow [2024-06-03 21:20:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:20:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:20:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-03 21:20:46,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-03 21:20:46,603 INFO L175 Difference]: Start difference. First operand has 106 places, 103 transitions, 886 flow. Second operand 8 states and 94 transitions. [2024-06-03 21:20:46,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 111 transitions, 1120 flow [2024-06-03 21:20:46,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 111 transitions, 1045 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-03 21:20:46,613 INFO L231 Difference]: Finished difference. Result has 109 places, 103 transitions, 841 flow [2024-06-03 21:20:46,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=841, PETRI_PLACES=109, PETRI_TRANSITIONS=103} [2024-06-03 21:20:46,614 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 79 predicate places. [2024-06-03 21:20:46,614 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 103 transitions, 841 flow [2024-06-03 21:20:46,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:46,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:46,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:46,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 21:20:46,615 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:20:46,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:46,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1945037783, now seen corresponding path program 1 times [2024-06-03 21:20:46,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:46,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262983621] [2024-06-03 21:20:46,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:46,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:50,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-03 21:20:50,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:50,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262983621] [2024-06-03 21:20:50,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262983621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:50,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:50,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:50,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130875689] [2024-06-03 21:20:50,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:50,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:50,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:50,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:50,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:50,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:20:50,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 103 transitions, 841 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:50,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:50,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:20:50,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:50,693 INFO L124 PetriNetUnfolderBase]: 236/452 cut-off events. [2024-06-03 21:20:50,694 INFO L125 PetriNetUnfolderBase]: For 7105/7105 co-relation queries the response was YES. [2024-06-03 21:20:50,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2474 conditions, 452 events. 236/452 cut-off events. For 7105/7105 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1953 event pairs, 45 based on Foata normal form. 2/454 useless extension candidates. Maximal degree in co-relation 2420. Up to 372 conditions per place. [2024-06-03 21:20:50,696 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 100 selfloop transitions, 18 changer transitions 0/121 dead transitions. [2024-06-03 21:20:50,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 121 transitions, 1135 flow [2024-06-03 21:20:50,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:20:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:20:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-03 21:20:50,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4014336917562724 [2024-06-03 21:20:50,698 INFO L175 Difference]: Start difference. First operand has 109 places, 103 transitions, 841 flow. Second operand 9 states and 112 transitions. [2024-06-03 21:20:50,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 121 transitions, 1135 flow [2024-06-03 21:20:50,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 121 transitions, 1103 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 21:20:50,708 INFO L231 Difference]: Finished difference. Result has 113 places, 105 transitions, 871 flow [2024-06-03 21:20:50,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=871, PETRI_PLACES=113, PETRI_TRANSITIONS=105} [2024-06-03 21:20:50,709 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 83 predicate places. [2024-06-03 21:20:50,709 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 105 transitions, 871 flow [2024-06-03 21:20:50,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:50,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:50,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:50,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 21:20:50,709 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:20:50,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:50,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1856382743, now seen corresponding path program 2 times [2024-06-03 21:20:50,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:50,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290210409] [2024-06-03 21:20:50,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:50,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:20:54,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:54,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290210409] [2024-06-03 21:20:54,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290210409] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:54,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:54,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425611582] [2024-06-03 21:20:54,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:54,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:54,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:54,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:54,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:54,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:20:54,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 105 transitions, 871 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:54,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:54,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:20:54,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:55,013 INFO L124 PetriNetUnfolderBase]: 240/460 cut-off events. [2024-06-03 21:20:55,013 INFO L125 PetriNetUnfolderBase]: For 7491/7491 co-relation queries the response was YES. [2024-06-03 21:20:55,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 460 events. 240/460 cut-off events. For 7491/7491 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2007 event pairs, 54 based on Foata normal form. 2/462 useless extension candidates. Maximal degree in co-relation 2503. Up to 389 conditions per place. [2024-06-03 21:20:55,016 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 98 selfloop transitions, 19 changer transitions 0/120 dead transitions. [2024-06-03 21:20:55,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 120 transitions, 1155 flow [2024-06-03 21:20:55,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:20:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:20:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-03 21:20:55,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-03 21:20:55,017 INFO L175 Difference]: Start difference. First operand has 113 places, 105 transitions, 871 flow. Second operand 9 states and 111 transitions. [2024-06-03 21:20:55,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 120 transitions, 1155 flow [2024-06-03 21:20:55,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 120 transitions, 1113 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 21:20:55,027 INFO L231 Difference]: Finished difference. Result has 116 places, 106 transitions, 887 flow [2024-06-03 21:20:55,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=887, PETRI_PLACES=116, PETRI_TRANSITIONS=106} [2024-06-03 21:20:55,028 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 86 predicate places. [2024-06-03 21:20:55,028 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 106 transitions, 887 flow [2024-06-03 21:20:55,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:55,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:55,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:55,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 21:20:55,028 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:20:55,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:55,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1391671797, now seen corresponding path program 3 times [2024-06-03 21:20:55,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:55,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409309484] [2024-06-03 21:20:55,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:55,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:20:58,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:58,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409309484] [2024-06-03 21:20:58,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409309484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:58,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:58,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:58,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022364286] [2024-06-03 21:20:58,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:58,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:58,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:58,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:58,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:58,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:20:58,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 106 transitions, 887 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:58,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:58,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:20:58,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:59,114 INFO L124 PetriNetUnfolderBase]: 249/479 cut-off events. [2024-06-03 21:20:59,114 INFO L125 PetriNetUnfolderBase]: For 8248/8248 co-relation queries the response was YES. [2024-06-03 21:20:59,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2654 conditions, 479 events. 249/479 cut-off events. For 8248/8248 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2149 event pairs, 29 based on Foata normal form. 2/481 useless extension candidates. Maximal degree in co-relation 2597. Up to 371 conditions per place. [2024-06-03 21:20:59,117 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 101 selfloop transitions, 20 changer transitions 0/124 dead transitions. [2024-06-03 21:20:59,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 124 transitions, 1191 flow [2024-06-03 21:20:59,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:20:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:20:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-03 21:20:59,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104 [2024-06-03 21:20:59,119 INFO L175 Difference]: Start difference. First operand has 116 places, 106 transitions, 887 flow. Second operand 9 states and 110 transitions. [2024-06-03 21:20:59,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 124 transitions, 1191 flow [2024-06-03 21:20:59,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 124 transitions, 1143 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-03 21:20:59,129 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 907 flow [2024-06-03 21:20:59,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=907, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2024-06-03 21:20:59,130 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 88 predicate places. [2024-06-03 21:20:59,130 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 907 flow [2024-06-03 21:20:59,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:59,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:59,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:59,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 21:20:59,130 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:20:59,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:59,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1856377783, now seen corresponding path program 1 times [2024-06-03 21:20:59,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:59,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224321874] [2024-06-03 21:20:59,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:59,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:21:04,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:04,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224321874] [2024-06-03 21:21:04,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224321874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:04,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:04,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:21:04,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332897108] [2024-06-03 21:21:04,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:04,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:21:04,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:04,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:21:04,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:21:05,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:21:05,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 907 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:05,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:05,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:21:05,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:05,325 INFO L124 PetriNetUnfolderBase]: 255/489 cut-off events. [2024-06-03 21:21:05,325 INFO L125 PetriNetUnfolderBase]: For 8959/8959 co-relation queries the response was YES. [2024-06-03 21:21:05,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2753 conditions, 489 events. 255/489 cut-off events. For 8959/8959 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2189 event pairs, 53 based on Foata normal form. 2/491 useless extension candidates. Maximal degree in co-relation 2695. Up to 415 conditions per place. [2024-06-03 21:21:05,329 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 100 selfloop transitions, 22 changer transitions 0/125 dead transitions. [2024-06-03 21:21:05,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 125 transitions, 1231 flow [2024-06-03 21:21:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:21:05,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:21:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-03 21:21:05,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-03 21:21:05,331 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 907 flow. Second operand 10 states and 122 transitions. [2024-06-03 21:21:05,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 125 transitions, 1231 flow [2024-06-03 21:21:05,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 125 transitions, 1158 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-03 21:21:05,344 INFO L231 Difference]: Finished difference. Result has 119 places, 110 transitions, 923 flow [2024-06-03 21:21:05,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=923, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2024-06-03 21:21:05,344 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2024-06-03 21:21:05,344 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 923 flow [2024-06-03 21:21:05,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:05,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:05,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:05,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 21:21:05,345 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:21:05,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:05,345 INFO L85 PathProgramCache]: Analyzing trace with hash -900870533, now seen corresponding path program 4 times [2024-06-03 21:21:05,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:05,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590255209] [2024-06-03 21:21:05,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:05,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:09,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-03 21:21:09,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:09,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590255209] [2024-06-03 21:21:09,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590255209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:09,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:09,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:21:09,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328571364] [2024-06-03 21:21:09,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:09,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:21:09,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:09,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:21:09,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:21:09,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:21:09,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 923 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:09,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:09,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:21:09,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:09,425 INFO L124 PetriNetUnfolderBase]: 264/508 cut-off events. [2024-06-03 21:21:09,425 INFO L125 PetriNetUnfolderBase]: For 9516/9516 co-relation queries the response was YES. [2024-06-03 21:21:09,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 508 events. 264/508 cut-off events. For 9516/9516 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2325 event pairs, 60 based on Foata normal form. 2/510 useless extension candidates. Maximal degree in co-relation 2764. Up to 439 conditions per place. [2024-06-03 21:21:09,428 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 110 selfloop transitions, 14 changer transitions 0/127 dead transitions. [2024-06-03 21:21:09,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 127 transitions, 1235 flow [2024-06-03 21:21:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:21:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:21:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-03 21:21:09,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104 [2024-06-03 21:21:09,429 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 923 flow. Second operand 9 states and 110 transitions. [2024-06-03 21:21:09,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 127 transitions, 1235 flow [2024-06-03 21:21:09,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 127 transitions, 1164 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-03 21:21:09,442 INFO L231 Difference]: Finished difference. Result has 121 places, 112 transitions, 914 flow [2024-06-03 21:21:09,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=914, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2024-06-03 21:21:09,442 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 91 predicate places. [2024-06-03 21:21:09,442 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 914 flow [2024-06-03 21:21:09,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:09,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:09,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:09,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 21:21:09,443 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:21:09,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:09,443 INFO L85 PathProgramCache]: Analyzing trace with hash -898013573, now seen corresponding path program 5 times [2024-06-03 21:21:09,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:09,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793176946] [2024-06-03 21:21:09,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:09,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:21:13,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:13,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793176946] [2024-06-03 21:21:13,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793176946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:13,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:13,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:21:13,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502581571] [2024-06-03 21:21:13,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:13,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:21:13,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:13,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:21:13,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:21:13,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:21:13,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 112 transitions, 914 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:13,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:13,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:21:13,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:13,485 INFO L124 PetriNetUnfolderBase]: 268/516 cut-off events. [2024-06-03 21:21:13,485 INFO L125 PetriNetUnfolderBase]: For 10084/10084 co-relation queries the response was YES. [2024-06-03 21:21:13,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2843 conditions, 516 events. 268/516 cut-off events. For 10084/10084 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2404 event pairs, 62 based on Foata normal form. 2/518 useless extension candidates. Maximal degree in co-relation 2785. Up to 456 conditions per place. [2024-06-03 21:21:13,488 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 108 selfloop transitions, 15 changer transitions 0/126 dead transitions. [2024-06-03 21:21:13,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 126 transitions, 1214 flow [2024-06-03 21:21:13,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:21:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:21:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-03 21:21:13,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-03 21:21:13,490 INFO L175 Difference]: Start difference. First operand has 121 places, 112 transitions, 914 flow. Second operand 9 states and 109 transitions. [2024-06-03 21:21:13,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 126 transitions, 1214 flow [2024-06-03 21:21:13,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 126 transitions, 1172 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-03 21:21:13,504 INFO L231 Difference]: Finished difference. Result has 124 places, 113 transitions, 928 flow [2024-06-03 21:21:13,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=928, PETRI_PLACES=124, PETRI_TRANSITIONS=113} [2024-06-03 21:21:13,504 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 94 predicate places. [2024-06-03 21:21:13,505 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 113 transitions, 928 flow [2024-06-03 21:21:13,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:13,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:13,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:13,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 21:21:13,505 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:21:13,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:13,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1791522603, now seen corresponding path program 6 times [2024-06-03 21:21:13,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:13,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521718837] [2024-06-03 21:21:13,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:13,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:21:17,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:17,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521718837] [2024-06-03 21:21:17,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521718837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:17,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:17,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:21:17,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737424703] [2024-06-03 21:21:17,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:17,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:21:17,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:17,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:21:17,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:21:17,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:21:17,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 113 transitions, 928 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:17,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:17,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:21:17,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:17,627 INFO L124 PetriNetUnfolderBase]: 272/524 cut-off events. [2024-06-03 21:21:17,627 INFO L125 PetriNetUnfolderBase]: For 10761/10761 co-relation queries the response was YES. [2024-06-03 21:21:17,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2900 conditions, 524 events. 272/524 cut-off events. For 10761/10761 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2439 event pairs, 64 based on Foata normal form. 2/526 useless extension candidates. Maximal degree in co-relation 2841. Up to 466 conditions per place. [2024-06-03 21:21:17,630 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 109 selfloop transitions, 15 changer transitions 0/127 dead transitions. [2024-06-03 21:21:17,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 127 transitions, 1234 flow [2024-06-03 21:21:17,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:21:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:21:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-03 21:21:17,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 21:21:17,632 INFO L175 Difference]: Start difference. First operand has 124 places, 113 transitions, 928 flow. Second operand 9 states and 108 transitions. [2024-06-03 21:21:17,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 127 transitions, 1234 flow [2024-06-03 21:21:17,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 127 transitions, 1188 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-03 21:21:17,647 INFO L231 Difference]: Finished difference. Result has 127 places, 115 transitions, 951 flow [2024-06-03 21:21:17,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=951, PETRI_PLACES=127, PETRI_TRANSITIONS=115} [2024-06-03 21:21:17,648 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 97 predicate places. [2024-06-03 21:21:17,648 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 115 transitions, 951 flow [2024-06-03 21:21:17,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:17,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:17,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:17,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 21:21:17,649 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:21:17,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:17,649 INFO L85 PathProgramCache]: Analyzing trace with hash -898008613, now seen corresponding path program 2 times [2024-06-03 21:21:17,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:17,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918474063] [2024-06-03 21:21:17,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:17,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:21:22,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:22,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918474063] [2024-06-03 21:21:22,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918474063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:22,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:22,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:21:22,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694778588] [2024-06-03 21:21:22,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:22,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:21:22,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:22,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:21:22,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:21:22,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:21:22,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 115 transitions, 951 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:22,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:22,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:21:22,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:22,378 INFO L124 PetriNetUnfolderBase]: 278/534 cut-off events. [2024-06-03 21:21:22,378 INFO L125 PetriNetUnfolderBase]: For 11547/11547 co-relation queries the response was YES. [2024-06-03 21:21:22,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2990 conditions, 534 events. 278/534 cut-off events. For 11547/11547 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2490 event pairs, 64 based on Foata normal form. 2/536 useless extension candidates. Maximal degree in co-relation 2929. Up to 471 conditions per place. [2024-06-03 21:21:22,382 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 110 selfloop transitions, 18 changer transitions 0/131 dead transitions. [2024-06-03 21:21:22,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 131 transitions, 1289 flow [2024-06-03 21:21:22,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:21:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:21:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-03 21:21:22,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 21:21:22,383 INFO L175 Difference]: Start difference. First operand has 127 places, 115 transitions, 951 flow. Second operand 10 states and 120 transitions. [2024-06-03 21:21:22,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 131 transitions, 1289 flow [2024-06-03 21:21:22,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 131 transitions, 1243 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-03 21:21:22,399 INFO L231 Difference]: Finished difference. Result has 131 places, 117 transitions, 990 flow [2024-06-03 21:21:22,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=990, PETRI_PLACES=131, PETRI_TRANSITIONS=117} [2024-06-03 21:21:22,399 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 101 predicate places. [2024-06-03 21:21:22,399 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 117 transitions, 990 flow [2024-06-03 21:21:22,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:22,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:22,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:22,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 21:21:22,400 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:21:22,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:22,400 INFO L85 PathProgramCache]: Analyzing trace with hash -782544463, now seen corresponding path program 3 times [2024-06-03 21:21:22,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:22,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798291184] [2024-06-03 21:21:22,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:22,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:21:29,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:29,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798291184] [2024-06-03 21:21:29,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798291184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:29,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:29,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:21:29,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264278481] [2024-06-03 21:21:29,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:29,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:21:29,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:29,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:21:29,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:21:29,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:21:29,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 117 transitions, 990 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:29,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:29,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:21:29,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:29,768 INFO L124 PetriNetUnfolderBase]: 286/549 cut-off events. [2024-06-03 21:21:29,769 INFO L125 PetriNetUnfolderBase]: For 12529/12529 co-relation queries the response was YES. [2024-06-03 21:21:29,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3153 conditions, 549 events. 286/549 cut-off events. For 12529/12529 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2592 event pairs, 63 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 3091. Up to 473 conditions per place. [2024-06-03 21:21:29,772 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 107 selfloop transitions, 25 changer transitions 0/135 dead transitions. [2024-06-03 21:21:29,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 135 transitions, 1428 flow [2024-06-03 21:21:29,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:21:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:21:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-03 21:21:29,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 21:21:29,773 INFO L175 Difference]: Start difference. First operand has 131 places, 117 transitions, 990 flow. Second operand 11 states and 132 transitions. [2024-06-03 21:21:29,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 135 transitions, 1428 flow [2024-06-03 21:21:29,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 135 transitions, 1361 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-03 21:21:29,794 INFO L231 Difference]: Finished difference. Result has 134 places, 121 transitions, 1058 flow [2024-06-03 21:21:29,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1058, PETRI_PLACES=134, PETRI_TRANSITIONS=121} [2024-06-03 21:21:29,794 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 104 predicate places. [2024-06-03 21:21:29,794 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 121 transitions, 1058 flow [2024-06-03 21:21:29,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:29,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:29,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:29,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 21:21:29,795 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:21:29,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:29,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2131648787, now seen corresponding path program 4 times [2024-06-03 21:21:29,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:29,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998703737] [2024-06-03 21:21:29,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:29,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:34,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-03 21:21:34,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:34,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998703737] [2024-06-03 21:21:34,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998703737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:34,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:34,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:21:34,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802429463] [2024-06-03 21:21:34,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:34,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:21:34,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:34,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:21:34,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:21:35,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:21:35,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 121 transitions, 1058 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:35,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:35,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:21:35,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:35,412 INFO L124 PetriNetUnfolderBase]: 284/546 cut-off events. [2024-06-03 21:21:35,412 INFO L125 PetriNetUnfolderBase]: For 12450/12450 co-relation queries the response was YES. [2024-06-03 21:21:35,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3114 conditions, 546 events. 284/546 cut-off events. For 12450/12450 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2554 event pairs, 63 based on Foata normal form. 1/547 useless extension candidates. Maximal degree in co-relation 3051. Up to 471 conditions per place. [2024-06-03 21:21:35,415 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 106 selfloop transitions, 24 changer transitions 0/133 dead transitions. [2024-06-03 21:21:35,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 133 transitions, 1348 flow [2024-06-03 21:21:35,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:21:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:21:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-03 21:21:35,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3903225806451613 [2024-06-03 21:21:35,417 INFO L175 Difference]: Start difference. First operand has 134 places, 121 transitions, 1058 flow. Second operand 10 states and 121 transitions. [2024-06-03 21:21:35,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 133 transitions, 1348 flow [2024-06-03 21:21:35,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 133 transitions, 1255 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-03 21:21:35,437 INFO L231 Difference]: Finished difference. Result has 137 places, 121 transitions, 1018 flow [2024-06-03 21:21:35,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1018, PETRI_PLACES=137, PETRI_TRANSITIONS=121} [2024-06-03 21:21:35,438 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 107 predicate places. [2024-06-03 21:21:35,438 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 121 transitions, 1018 flow [2024-06-03 21:21:35,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:35,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:35,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:35,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 21:21:35,438 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:21:35,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:35,439 INFO L85 PathProgramCache]: Analyzing trace with hash 265405803, now seen corresponding path program 7 times [2024-06-03 21:21:35,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:35,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93994598] [2024-06-03 21:21:35,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:35,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:21:38,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:38,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93994598] [2024-06-03 21:21:38,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93994598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:38,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:38,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:21:38,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274269797] [2024-06-03 21:21:38,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:38,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:21:38,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:38,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:21:38,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:21:38,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:21:38,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 121 transitions, 1018 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:38,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:38,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:21:38,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:39,205 INFO L124 PetriNetUnfolderBase]: 288/554 cut-off events. [2024-06-03 21:21:39,205 INFO L125 PetriNetUnfolderBase]: For 13682/13682 co-relation queries the response was YES. [2024-06-03 21:21:39,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3171 conditions, 554 events. 288/554 cut-off events. For 13682/13682 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2611 event pairs, 29 based on Foata normal form. 2/556 useless extension candidates. Maximal degree in co-relation 3106. Up to 413 conditions per place. [2024-06-03 21:21:39,208 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 109 selfloop transitions, 23 changer transitions 0/135 dead transitions. [2024-06-03 21:21:39,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 135 transitions, 1338 flow [2024-06-03 21:21:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:21:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:21:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-03 21:21:39,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675 [2024-06-03 21:21:39,219 INFO L175 Difference]: Start difference. First operand has 137 places, 121 transitions, 1018 flow. Second operand 8 states and 99 transitions. [2024-06-03 21:21:39,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 135 transitions, 1338 flow [2024-06-03 21:21:39,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 1285 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-03 21:21:39,242 INFO L231 Difference]: Finished difference. Result has 136 places, 122 transitions, 1047 flow [2024-06-03 21:21:39,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1047, PETRI_PLACES=136, PETRI_TRANSITIONS=122} [2024-06-03 21:21:39,243 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 106 predicate places. [2024-06-03 21:21:39,243 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 122 transitions, 1047 flow [2024-06-03 21:21:39,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:39,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:39,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:39,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 21:21:39,244 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:21:39,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:39,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1476004531, now seen corresponding path program 8 times [2024-06-03 21:21:39,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:39,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719248991] [2024-06-03 21:21:39,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:39,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:21:43,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:43,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719248991] [2024-06-03 21:21:43,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719248991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:43,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:43,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:21:43,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16039175] [2024-06-03 21:21:43,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:43,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:21:43,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:43,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:21:43,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:21:43,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:21:43,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 122 transitions, 1047 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:43,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:43,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:21:43,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:43,590 INFO L124 PetriNetUnfolderBase]: 292/562 cut-off events. [2024-06-03 21:21:43,590 INFO L125 PetriNetUnfolderBase]: For 14737/14737 co-relation queries the response was YES. [2024-06-03 21:21:43,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3289 conditions, 562 events. 292/562 cut-off events. For 14737/14737 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2653 event pairs, 56 based on Foata normal form. 2/564 useless extension candidates. Maximal degree in co-relation 3223. Up to 471 conditions per place. [2024-06-03 21:21:43,594 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 108 selfloop transitions, 24 changer transitions 0/135 dead transitions. [2024-06-03 21:21:43,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 135 transitions, 1367 flow [2024-06-03 21:21:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:21:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:21:43,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-03 21:21:43,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-03 21:21:43,605 INFO L175 Difference]: Start difference. First operand has 136 places, 122 transitions, 1047 flow. Second operand 8 states and 100 transitions. [2024-06-03 21:21:43,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 135 transitions, 1367 flow [2024-06-03 21:21:43,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 135 transitions, 1295 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-03 21:21:43,630 INFO L231 Difference]: Finished difference. Result has 138 places, 123 transitions, 1059 flow [2024-06-03 21:21:43,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1059, PETRI_PLACES=138, PETRI_TRANSITIONS=123} [2024-06-03 21:21:43,631 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 108 predicate places. [2024-06-03 21:21:43,631 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 123 transitions, 1059 flow [2024-06-03 21:21:43,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:43,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:43,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:43,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 21:21:43,632 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:21:43,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1035028631, now seen corresponding path program 5 times [2024-06-03 21:21:43,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:43,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396579774] [2024-06-03 21:21:43,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:43,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:21:48,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:48,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396579774] [2024-06-03 21:21:48,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396579774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:48,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:48,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:21:48,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202431371] [2024-06-03 21:21:48,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:48,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:21:48,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:48,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:21:48,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:21:48,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:21:48,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 123 transitions, 1059 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:48,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:48,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:21:48,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:49,065 INFO L124 PetriNetUnfolderBase]: 298/574 cut-off events. [2024-06-03 21:21:49,065 INFO L125 PetriNetUnfolderBase]: For 13348/13348 co-relation queries the response was YES. [2024-06-03 21:21:49,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3318 conditions, 574 events. 298/574 cut-off events. For 13348/13348 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2749 event pairs, 54 based on Foata normal form. 2/576 useless extension candidates. Maximal degree in co-relation 3251. Up to 472 conditions per place. [2024-06-03 21:21:49,069 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 102 selfloop transitions, 33 changer transitions 0/138 dead transitions. [2024-06-03 21:21:49,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 138 transitions, 1415 flow [2024-06-03 21:21:49,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:21:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:21:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-03 21:21:49,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-03 21:21:49,081 INFO L175 Difference]: Start difference. First operand has 138 places, 123 transitions, 1059 flow. Second operand 9 states and 111 transitions. [2024-06-03 21:21:49,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 138 transitions, 1415 flow [2024-06-03 21:21:49,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 138 transitions, 1351 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-03 21:21:49,105 INFO L231 Difference]: Finished difference. Result has 141 places, 125 transitions, 1122 flow [2024-06-03 21:21:49,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1122, PETRI_PLACES=141, PETRI_TRANSITIONS=125} [2024-06-03 21:21:49,105 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 111 predicate places. [2024-06-03 21:21:49,105 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 125 transitions, 1122 flow [2024-06-03 21:21:49,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:49,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:49,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:49,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 21:21:49,106 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:21:49,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:49,106 INFO L85 PathProgramCache]: Analyzing trace with hash -919742421, now seen corresponding path program 9 times [2024-06-03 21:21:49,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:49,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807323030] [2024-06-03 21:21:49,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:49,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:21:52,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:52,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807323030] [2024-06-03 21:21:52,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807323030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:52,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:52,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:21:52,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220972287] [2024-06-03 21:21:52,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:52,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:21:52,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:52,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:21:52,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:21:52,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:21:52,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 125 transitions, 1122 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:52,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:52,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:21:52,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:53,286 INFO L124 PetriNetUnfolderBase]: 302/582 cut-off events. [2024-06-03 21:21:53,286 INFO L125 PetriNetUnfolderBase]: For 12798/12798 co-relation queries the response was YES. [2024-06-03 21:21:53,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3371 conditions, 582 events. 302/582 cut-off events. For 12798/12798 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2813 event pairs, 63 based on Foata normal form. 2/584 useless extension candidates. Maximal degree in co-relation 3303. Up to 508 conditions per place. [2024-06-03 21:21:53,290 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 114 selfloop transitions, 19 changer transitions 0/136 dead transitions. [2024-06-03 21:21:53,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 136 transitions, 1430 flow [2024-06-03 21:21:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:21:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:21:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-03 21:21:53,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-03 21:21:53,305 INFO L175 Difference]: Start difference. First operand has 141 places, 125 transitions, 1122 flow. Second operand 8 states and 97 transitions. [2024-06-03 21:21:53,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 136 transitions, 1430 flow [2024-06-03 21:21:53,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 136 transitions, 1331 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-03 21:21:53,328 INFO L231 Difference]: Finished difference. Result has 142 places, 126 transitions, 1087 flow [2024-06-03 21:21:53,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1087, PETRI_PLACES=142, PETRI_TRANSITIONS=126} [2024-06-03 21:21:53,331 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 112 predicate places. [2024-06-03 21:21:53,331 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 126 transitions, 1087 flow [2024-06-03 21:21:53,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:53,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:53,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:53,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 21:21:53,332 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:21:53,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:53,332 INFO L85 PathProgramCache]: Analyzing trace with hash -919557971, now seen corresponding path program 6 times [2024-06-03 21:21:53,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:53,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18780896] [2024-06-03 21:21:53,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:53,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:21:58,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:58,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18780896] [2024-06-03 21:21:58,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18780896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:58,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:58,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:21:58,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6217069] [2024-06-03 21:21:58,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:58,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:21:58,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:58,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:21:58,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:21:59,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:21:59,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 126 transitions, 1087 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:59,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:59,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:21:59,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:59,414 INFO L124 PetriNetUnfolderBase]: 318/614 cut-off events. [2024-06-03 21:21:59,414 INFO L125 PetriNetUnfolderBase]: For 13334/13334 co-relation queries the response was YES. [2024-06-03 21:21:59,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3549 conditions, 614 events. 318/614 cut-off events. For 13334/13334 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3006 event pairs, 66 based on Foata normal form. 2/616 useless extension candidates. Maximal degree in co-relation 3480. Up to 479 conditions per place. [2024-06-03 21:21:59,419 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 104 selfloop transitions, 36 changer transitions 0/143 dead transitions. [2024-06-03 21:21:59,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 143 transitions, 1559 flow [2024-06-03 21:21:59,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:21:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:21:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-03 21:21:59,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050179211469534 [2024-06-03 21:21:59,432 INFO L175 Difference]: Start difference. First operand has 142 places, 126 transitions, 1087 flow. Second operand 9 states and 113 transitions. [2024-06-03 21:21:59,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 143 transitions, 1559 flow [2024-06-03 21:21:59,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 143 transitions, 1505 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-03 21:21:59,455 INFO L231 Difference]: Finished difference. Result has 145 places, 131 transitions, 1216 flow [2024-06-03 21:21:59,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1216, PETRI_PLACES=145, PETRI_TRANSITIONS=131} [2024-06-03 21:21:59,455 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2024-06-03 21:21:59,455 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 131 transitions, 1216 flow [2024-06-03 21:21:59,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:59,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:59,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:59,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 21:21:59,456 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:21:59,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:59,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1471357941, now seen corresponding path program 7 times [2024-06-03 21:21:59,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:59,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700179359] [2024-06-03 21:21:59,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:59,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:04,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:22:04,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:04,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700179359] [2024-06-03 21:22:04,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700179359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:04,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:04,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:22:04,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651552364] [2024-06-03 21:22:04,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:04,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:22:04,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:04,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:22:04,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:22:04,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:22:04,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 131 transitions, 1216 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:04,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:04,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:22:04,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:04,820 INFO L124 PetriNetUnfolderBase]: 316/609 cut-off events. [2024-06-03 21:22:04,820 INFO L125 PetriNetUnfolderBase]: For 12566/12566 co-relation queries the response was YES. [2024-06-03 21:22:04,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3569 conditions, 609 events. 316/609 cut-off events. For 12566/12566 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2977 event pairs, 66 based on Foata normal form. 1/610 useless extension candidates. Maximal degree in co-relation 3499. Up to 478 conditions per place. [2024-06-03 21:22:04,824 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 103 selfloop transitions, 39 changer transitions 0/145 dead transitions. [2024-06-03 21:22:04,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 145 transitions, 1644 flow [2024-06-03 21:22:04,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:22:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:22:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 21:22:04,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40860215053763443 [2024-06-03 21:22:04,826 INFO L175 Difference]: Start difference. First operand has 145 places, 131 transitions, 1216 flow. Second operand 9 states and 114 transitions. [2024-06-03 21:22:04,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 145 transitions, 1644 flow [2024-06-03 21:22:04,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 145 transitions, 1559 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-03 21:22:04,848 INFO L231 Difference]: Finished difference. Result has 148 places, 133 transitions, 1265 flow [2024-06-03 21:22:04,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1265, PETRI_PLACES=148, PETRI_TRANSITIONS=133} [2024-06-03 21:22:04,848 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2024-06-03 21:22:04,848 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 133 transitions, 1265 flow [2024-06-03 21:22:04,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:04,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:04,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:04,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 21:22:04,849 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:22:04,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:04,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1243458917, now seen corresponding path program 10 times [2024-06-03 21:22:04,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:04,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096877690] [2024-06-03 21:22:04,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:04,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:22:09,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:09,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096877690] [2024-06-03 21:22:09,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096877690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:09,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:09,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:22:09,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660215820] [2024-06-03 21:22:09,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:09,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:22:09,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:09,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:22:09,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:22:09,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:22:09,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 133 transitions, 1265 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:09,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:09,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:22:09,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:09,848 INFO L124 PetriNetUnfolderBase]: 313/606 cut-off events. [2024-06-03 21:22:09,848 INFO L125 PetriNetUnfolderBase]: For 11758/11758 co-relation queries the response was YES. [2024-06-03 21:22:09,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 606 events. 313/606 cut-off events. For 11758/11758 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2962 event pairs, 68 based on Foata normal form. 2/608 useless extension candidates. Maximal degree in co-relation 3441. Up to 523 conditions per place. [2024-06-03 21:22:09,852 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 118 selfloop transitions, 20 changer transitions 0/141 dead transitions. [2024-06-03 21:22:09,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 141 transitions, 1559 flow [2024-06-03 21:22:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:22:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:22:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-03 21:22:09,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-03 21:22:09,853 INFO L175 Difference]: Start difference. First operand has 148 places, 133 transitions, 1265 flow. Second operand 8 states and 97 transitions. [2024-06-03 21:22:09,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 141 transitions, 1559 flow [2024-06-03 21:22:09,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 141 transitions, 1469 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-03 21:22:09,878 INFO L231 Difference]: Finished difference. Result has 149 places, 133 transitions, 1219 flow [2024-06-03 21:22:09,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1219, PETRI_PLACES=149, PETRI_TRANSITIONS=133} [2024-06-03 21:22:09,878 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 119 predicate places. [2024-06-03 21:22:09,878 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 133 transitions, 1219 flow [2024-06-03 21:22:09,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:09,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:09,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:09,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 21:22:09,879 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:22:09,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1243274467, now seen corresponding path program 8 times [2024-06-03 21:22:09,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:09,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073186742] [2024-06-03 21:22:09,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:09,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:22:15,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:15,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073186742] [2024-06-03 21:22:15,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073186742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:15,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:15,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:22:15,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587760408] [2024-06-03 21:22:15,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:15,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:22:15,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:15,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:22:15,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:22:15,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:22:15,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 133 transitions, 1219 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:15,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:15,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:22:15,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:16,050 INFO L124 PetriNetUnfolderBase]: 329/636 cut-off events. [2024-06-03 21:22:16,050 INFO L125 PetriNetUnfolderBase]: For 13162/13162 co-relation queries the response was YES. [2024-06-03 21:22:16,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3781 conditions, 636 events. 329/636 cut-off events. For 13162/13162 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3163 event pairs, 66 based on Foata normal form. 2/638 useless extension candidates. Maximal degree in co-relation 3710. Up to 517 conditions per place. [2024-06-03 21:22:16,055 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 115 selfloop transitions, 30 changer transitions 0/148 dead transitions. [2024-06-03 21:22:16,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 148 transitions, 1711 flow [2024-06-03 21:22:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:22:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:22:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-03 21:22:16,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050179211469534 [2024-06-03 21:22:16,056 INFO L175 Difference]: Start difference. First operand has 149 places, 133 transitions, 1219 flow. Second operand 9 states and 113 transitions. [2024-06-03 21:22:16,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 148 transitions, 1711 flow [2024-06-03 21:22:16,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 148 transitions, 1627 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 21:22:16,082 INFO L231 Difference]: Finished difference. Result has 151 places, 138 transitions, 1313 flow [2024-06-03 21:22:16,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1313, PETRI_PLACES=151, PETRI_TRANSITIONS=138} [2024-06-03 21:22:16,082 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2024-06-03 21:22:16,083 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 138 transitions, 1313 flow [2024-06-03 21:22:16,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:16,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:16,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:16,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 21:22:16,083 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:22:16,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:16,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1243280977, now seen corresponding path program 9 times [2024-06-03 21:22:16,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:16,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026021284] [2024-06-03 21:22:16,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:16,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:22:23,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:23,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026021284] [2024-06-03 21:22:23,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026021284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:23,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:23,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:22:23,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911133568] [2024-06-03 21:22:23,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:23,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:22:23,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:23,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:22:23,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:22:23,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:22:23,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 138 transitions, 1313 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:23,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:23,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:22:23,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:23,887 INFO L124 PetriNetUnfolderBase]: 327/633 cut-off events. [2024-06-03 21:22:23,888 INFO L125 PetriNetUnfolderBase]: For 13059/13059 co-relation queries the response was YES. [2024-06-03 21:22:23,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3773 conditions, 633 events. 327/633 cut-off events. For 13059/13059 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3123 event pairs, 66 based on Foata normal form. 1/634 useless extension candidates. Maximal degree in co-relation 3701. Up to 531 conditions per place. [2024-06-03 21:22:23,892 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 120 selfloop transitions, 29 changer transitions 0/152 dead transitions. [2024-06-03 21:22:23,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 152 transitions, 1749 flow [2024-06-03 21:22:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:22:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:22:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-03 21:22:23,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-03 21:22:23,893 INFO L175 Difference]: Start difference. First operand has 151 places, 138 transitions, 1313 flow. Second operand 9 states and 111 transitions. [2024-06-03 21:22:23,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 152 transitions, 1749 flow [2024-06-03 21:22:23,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 152 transitions, 1611 flow, removed 48 selfloop flow, removed 6 redundant places. [2024-06-03 21:22:23,918 INFO L231 Difference]: Finished difference. Result has 156 places, 144 transitions, 1381 flow [2024-06-03 21:22:23,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1381, PETRI_PLACES=156, PETRI_TRANSITIONS=144} [2024-06-03 21:22:23,919 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2024-06-03 21:22:23,919 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 144 transitions, 1381 flow [2024-06-03 21:22:23,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:23,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:23,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:23,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 21:22:23,919 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:22:23,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:23,919 INFO L85 PathProgramCache]: Analyzing trace with hash -963422329, now seen corresponding path program 1 times [2024-06-03 21:22:23,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:23,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939360381] [2024-06-03 21:22:23,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:23,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:28,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-03 21:22:28,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:28,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939360381] [2024-06-03 21:22:28,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939360381] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:28,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:28,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:22:28,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855709342] [2024-06-03 21:22:28,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:28,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:22:28,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:28,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:22:28,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:22:28,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:22:28,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 144 transitions, 1381 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:28,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:28,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:22:28,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:28,693 INFO L124 PetriNetUnfolderBase]: 330/637 cut-off events. [2024-06-03 21:22:28,693 INFO L125 PetriNetUnfolderBase]: For 13312/13312 co-relation queries the response was YES. [2024-06-03 21:22:28,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3797 conditions, 637 events. 330/637 cut-off events. For 13312/13312 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3164 event pairs, 93 based on Foata normal form. 1/638 useless extension candidates. Maximal degree in co-relation 3722. Up to 567 conditions per place. [2024-06-03 21:22:28,697 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 134 selfloop transitions, 19 changer transitions 0/156 dead transitions. [2024-06-03 21:22:28,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 156 transitions, 1807 flow [2024-06-03 21:22:28,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:22:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:22:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-03 21:22:28,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-03 21:22:28,698 INFO L175 Difference]: Start difference. First operand has 156 places, 144 transitions, 1381 flow. Second operand 10 states and 116 transitions. [2024-06-03 21:22:28,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 156 transitions, 1807 flow [2024-06-03 21:22:28,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 156 transitions, 1726 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-06-03 21:22:28,724 INFO L231 Difference]: Finished difference. Result has 162 places, 146 transitions, 1375 flow [2024-06-03 21:22:28,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1375, PETRI_PLACES=162, PETRI_TRANSITIONS=146} [2024-06-03 21:22:28,725 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2024-06-03 21:22:28,725 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 146 transitions, 1375 flow [2024-06-03 21:22:28,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:28,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:28,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:28,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 21:22:28,725 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:22:28,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:28,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1007099107, now seen corresponding path program 10 times [2024-06-03 21:22:28,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:28,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583321975] [2024-06-03 21:22:28,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:28,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:22:34,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:34,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583321975] [2024-06-03 21:22:34,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583321975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:34,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:34,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:22:34,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724642540] [2024-06-03 21:22:34,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:34,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:22:34,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:34,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:22:34,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:22:34,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:22:34,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 146 transitions, 1375 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:34,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:34,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:22:34,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:34,961 INFO L124 PetriNetUnfolderBase]: 342/662 cut-off events. [2024-06-03 21:22:34,961 INFO L125 PetriNetUnfolderBase]: For 15368/15368 co-relation queries the response was YES. [2024-06-03 21:22:34,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4036 conditions, 662 events. 342/662 cut-off events. For 15368/15368 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3300 event pairs, 96 based on Foata normal form. 2/664 useless extension candidates. Maximal degree in co-relation 3959. Up to 574 conditions per place. [2024-06-03 21:22:34,966 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 135 selfloop transitions, 22 changer transitions 0/160 dead transitions. [2024-06-03 21:22:34,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 160 transitions, 1891 flow [2024-06-03 21:22:34,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:22:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:22:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-03 21:22:34,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-03 21:22:34,967 INFO L175 Difference]: Start difference. First operand has 162 places, 146 transitions, 1375 flow. Second operand 9 states and 109 transitions. [2024-06-03 21:22:34,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 160 transitions, 1891 flow [2024-06-03 21:22:34,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 160 transitions, 1832 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-03 21:22:34,996 INFO L231 Difference]: Finished difference. Result has 164 places, 151 transitions, 1488 flow [2024-06-03 21:22:34,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1488, PETRI_PLACES=164, PETRI_TRANSITIONS=151} [2024-06-03 21:22:34,996 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 134 predicate places. [2024-06-03 21:22:34,996 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 151 transitions, 1488 flow [2024-06-03 21:22:34,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:34,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:34,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:34,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 21:22:34,997 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:22:34,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:34,997 INFO L85 PathProgramCache]: Analyzing trace with hash -963661587, now seen corresponding path program 11 times [2024-06-03 21:22:34,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:34,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075575309] [2024-06-03 21:22:34,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:34,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:22:40,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:40,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075575309] [2024-06-03 21:22:40,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075575309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:40,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:40,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:22:40,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890050065] [2024-06-03 21:22:40,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:40,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:22:40,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:40,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:22:40,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:22:40,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 21:22:40,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 151 transitions, 1488 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:40,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:40,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 21:22:40,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:41,265 INFO L124 PetriNetUnfolderBase]: 345/666 cut-off events. [2024-06-03 21:22:41,265 INFO L125 PetriNetUnfolderBase]: For 16148/16148 co-relation queries the response was YES. [2024-06-03 21:22:41,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4155 conditions, 666 events. 345/666 cut-off events. For 16148/16148 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3341 event pairs, 65 based on Foata normal form. 1/667 useless extension candidates. Maximal degree in co-relation 4077. Up to 491 conditions per place. [2024-06-03 21:22:41,270 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 109 selfloop transitions, 59 changer transitions 0/171 dead transitions. [2024-06-03 21:22:41,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 171 transitions, 2116 flow [2024-06-03 21:22:41,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:22:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:22:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-03 21:22:41,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2024-06-03 21:22:41,271 INFO L175 Difference]: Start difference. First operand has 164 places, 151 transitions, 1488 flow. Second operand 10 states and 135 transitions. [2024-06-03 21:22:41,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 171 transitions, 2116 flow [2024-06-03 21:22:41,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 171 transitions, 2000 flow, removed 50 selfloop flow, removed 5 redundant places. [2024-06-03 21:22:41,302 INFO L231 Difference]: Finished difference. Result has 172 places, 160 transitions, 1749 flow [2024-06-03 21:22:41,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1749, PETRI_PLACES=172, PETRI_TRANSITIONS=160} [2024-06-03 21:22:41,302 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 142 predicate places. [2024-06-03 21:22:41,303 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 160 transitions, 1749 flow [2024-06-03 21:22:41,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:41,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:41,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:41,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 21:22:41,303 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:22:41,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:41,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1015379827, now seen corresponding path program 12 times [2024-06-03 21:22:41,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:41,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880852461] [2024-06-03 21:22:41,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:41,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:22:46,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:46,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880852461] [2024-06-03 21:22:46,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880852461] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:46,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:46,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:22:46,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574248342] [2024-06-03 21:22:46,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:46,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:22:46,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:46,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:22:46,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:22:46,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:22:46,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 160 transitions, 1749 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:46,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:46,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:22:46,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:47,154 INFO L124 PetriNetUnfolderBase]: 343/663 cut-off events. [2024-06-03 21:22:47,154 INFO L125 PetriNetUnfolderBase]: For 16076/16076 co-relation queries the response was YES. [2024-06-03 21:22:47,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4230 conditions, 663 events. 343/663 cut-off events. For 16076/16076 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3320 event pairs, 65 based on Foata normal form. 1/664 useless extension candidates. Maximal degree in co-relation 4147. Up to 489 conditions per place. [2024-06-03 21:22:47,159 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 107 selfloop transitions, 62 changer transitions 0/172 dead transitions. [2024-06-03 21:22:47,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 172 transitions, 2143 flow [2024-06-03 21:22:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:22:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:22:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-03 21:22:47,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39002932551319647 [2024-06-03 21:22:47,160 INFO L175 Difference]: Start difference. First operand has 172 places, 160 transitions, 1749 flow. Second operand 11 states and 133 transitions. [2024-06-03 21:22:47,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 172 transitions, 2143 flow [2024-06-03 21:22:47,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 172 transitions, 2002 flow, removed 59 selfloop flow, removed 4 redundant places. [2024-06-03 21:22:47,195 INFO L231 Difference]: Finished difference. Result has 179 places, 161 transitions, 1763 flow [2024-06-03 21:22:47,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1763, PETRI_PLACES=179, PETRI_TRANSITIONS=161} [2024-06-03 21:22:47,196 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2024-06-03 21:22:47,196 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 161 transitions, 1763 flow [2024-06-03 21:22:47,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:47,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:47,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:47,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 21:22:47,196 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:22:47,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:47,196 INFO L85 PathProgramCache]: Analyzing trace with hash -955387129, now seen corresponding path program 2 times [2024-06-03 21:22:47,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:47,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477504393] [2024-06-03 21:22:47,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:47,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:22:51,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:51,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477504393] [2024-06-03 21:22:51,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477504393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:51,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:51,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:22:51,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109544233] [2024-06-03 21:22:51,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:51,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:22:51,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:51,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:22:51,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:22:52,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:22:52,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 161 transitions, 1763 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:52,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:52,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:22:52,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:52,536 INFO L124 PetriNetUnfolderBase]: 340/656 cut-off events. [2024-06-03 21:22:52,536 INFO L125 PetriNetUnfolderBase]: For 15569/15569 co-relation queries the response was YES. [2024-06-03 21:22:52,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4175 conditions, 656 events. 340/656 cut-off events. For 15569/15569 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3285 event pairs, 93 based on Foata normal form. 1/657 useless extension candidates. Maximal degree in co-relation 4090. Up to 591 conditions per place. [2024-06-03 21:22:52,541 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 151 selfloop transitions, 15 changer transitions 0/169 dead transitions. [2024-06-03 21:22:52,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 169 transitions, 2113 flow [2024-06-03 21:22:52,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:22:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:22:52,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-03 21:22:52,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3727598566308244 [2024-06-03 21:22:52,543 INFO L175 Difference]: Start difference. First operand has 179 places, 161 transitions, 1763 flow. Second operand 9 states and 104 transitions. [2024-06-03 21:22:52,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 169 transitions, 2113 flow [2024-06-03 21:22:52,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 169 transitions, 1992 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-03 21:22:52,582 INFO L231 Difference]: Finished difference. Result has 181 places, 161 transitions, 1677 flow [2024-06-03 21:22:52,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1677, PETRI_PLACES=181, PETRI_TRANSITIONS=161} [2024-06-03 21:22:52,582 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 151 predicate places. [2024-06-03 21:22:52,582 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 161 transitions, 1677 flow [2024-06-03 21:22:52,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:52,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:52,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:52,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 21:22:52,583 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:22:52,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:52,583 INFO L85 PathProgramCache]: Analyzing trace with hash -681767693, now seen corresponding path program 1 times [2024-06-03 21:22:52,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:52,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336909761] [2024-06-03 21:22:52,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:52,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:58,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:22:58,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:58,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336909761] [2024-06-03 21:22:58,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336909761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:58,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:58,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:22:58,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091828885] [2024-06-03 21:22:58,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:58,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:22:58,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:58,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:22:58,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:22:58,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 21:22:58,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 161 transitions, 1677 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:58,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:58,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 21:22:58,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:59,100 INFO L124 PetriNetUnfolderBase]: 344/665 cut-off events. [2024-06-03 21:22:59,101 INFO L125 PetriNetUnfolderBase]: For 16961/16961 co-relation queries the response was YES. [2024-06-03 21:22:59,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4126 conditions, 665 events. 344/665 cut-off events. For 16961/16961 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3324 event pairs, 29 based on Foata normal form. 2/667 useless extension candidates. Maximal degree in co-relation 4040. Up to 490 conditions per place. [2024-06-03 21:22:59,105 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 150 selfloop transitions, 24 changer transitions 0/177 dead transitions. [2024-06-03 21:22:59,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 177 transitions, 2075 flow [2024-06-03 21:22:59,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:22:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:22:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-03 21:22:59,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4229390681003584 [2024-06-03 21:22:59,106 INFO L175 Difference]: Start difference. First operand has 181 places, 161 transitions, 1677 flow. Second operand 9 states and 118 transitions. [2024-06-03 21:22:59,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 177 transitions, 2075 flow [2024-06-03 21:22:59,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 177 transitions, 2038 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-03 21:22:59,144 INFO L231 Difference]: Finished difference. Result has 182 places, 162 transitions, 1711 flow [2024-06-03 21:22:59,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1711, PETRI_PLACES=182, PETRI_TRANSITIONS=162} [2024-06-03 21:22:59,145 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 152 predicate places. [2024-06-03 21:22:59,145 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 162 transitions, 1711 flow [2024-06-03 21:22:59,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:59,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:59,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:59,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 21:22:59,145 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:22:59,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:59,146 INFO L85 PathProgramCache]: Analyzing trace with hash -568177493, now seen corresponding path program 2 times [2024-06-03 21:22:59,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:59,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059741959] [2024-06-03 21:22:59,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:59,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:23:03,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:03,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059741959] [2024-06-03 21:23:03,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059741959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:03,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:03,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:23:03,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367547105] [2024-06-03 21:23:03,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:03,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:23:03,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:03,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:23:03,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:23:03,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:23:03,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 162 transitions, 1711 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:03,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:03,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:23:03,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:04,134 INFO L124 PetriNetUnfolderBase]: 348/673 cut-off events. [2024-06-03 21:23:04,134 INFO L125 PetriNetUnfolderBase]: For 17675/17675 co-relation queries the response was YES. [2024-06-03 21:23:04,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4240 conditions, 673 events. 348/673 cut-off events. For 17675/17675 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3388 event pairs, 55 based on Foata normal form. 2/675 useless extension candidates. Maximal degree in co-relation 4153. Up to 578 conditions per place. [2024-06-03 21:23:04,139 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 156 selfloop transitions, 20 changer transitions 0/179 dead transitions. [2024-06-03 21:23:04,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 179 transitions, 2119 flow [2024-06-03 21:23:04,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:23:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:23:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-03 21:23:04,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3903225806451613 [2024-06-03 21:23:04,140 INFO L175 Difference]: Start difference. First operand has 182 places, 162 transitions, 1711 flow. Second operand 10 states and 121 transitions. [2024-06-03 21:23:04,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 179 transitions, 2119 flow [2024-06-03 21:23:04,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 179 transitions, 2064 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-03 21:23:04,179 INFO L231 Difference]: Finished difference. Result has 185 places, 163 transitions, 1718 flow [2024-06-03 21:23:04,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1718, PETRI_PLACES=185, PETRI_TRANSITIONS=163} [2024-06-03 21:23:04,179 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 155 predicate places. [2024-06-03 21:23:04,179 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 163 transitions, 1718 flow [2024-06-03 21:23:04,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:04,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:04,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:04,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 21:23:04,180 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:23:04,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:04,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1690798079, now seen corresponding path program 3 times [2024-06-03 21:23:04,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:04,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986793885] [2024-06-03 21:23:04,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:04,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:23:09,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:09,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986793885] [2024-06-03 21:23:09,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986793885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:09,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:09,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:23:09,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618039812] [2024-06-03 21:23:09,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:09,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:23:09,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:09,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:23:09,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:23:09,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 21:23:09,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 163 transitions, 1718 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:09,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:09,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 21:23:09,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:09,515 INFO L124 PetriNetUnfolderBase]: 352/681 cut-off events. [2024-06-03 21:23:09,516 INFO L125 PetriNetUnfolderBase]: For 18841/18841 co-relation queries the response was YES. [2024-06-03 21:23:09,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4286 conditions, 681 events. 352/681 cut-off events. For 18841/18841 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3461 event pairs, 59 based on Foata normal form. 2/683 useless extension candidates. Maximal degree in co-relation 4198. Up to 575 conditions per place. [2024-06-03 21:23:09,521 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 146 selfloop transitions, 28 changer transitions 0/177 dead transitions. [2024-06-03 21:23:09,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 177 transitions, 2116 flow [2024-06-03 21:23:09,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:23:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:23:09,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-03 21:23:09,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265232974910394 [2024-06-03 21:23:09,522 INFO L175 Difference]: Start difference. First operand has 185 places, 163 transitions, 1718 flow. Second operand 9 states and 119 transitions. [2024-06-03 21:23:09,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 177 transitions, 2116 flow [2024-06-03 21:23:09,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 177 transitions, 2064 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-03 21:23:09,564 INFO L231 Difference]: Finished difference. Result has 186 places, 164 transitions, 1748 flow [2024-06-03 21:23:09,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1666, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1748, PETRI_PLACES=186, PETRI_TRANSITIONS=164} [2024-06-03 21:23:09,564 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 156 predicate places. [2024-06-03 21:23:09,564 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 164 transitions, 1748 flow [2024-06-03 21:23:09,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:09,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:09,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:09,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 21:23:09,565 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:23:09,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:09,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2068616001, now seen corresponding path program 4 times [2024-06-03 21:23:09,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:09,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156849987] [2024-06-03 21:23:09,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:09,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:23:14,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:14,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156849987] [2024-06-03 21:23:14,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156849987] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:14,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:14,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:23:14,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875111325] [2024-06-03 21:23:14,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:14,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:23:14,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:14,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:23:14,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:23:14,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:23:14,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 164 transitions, 1748 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:14,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:14,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:23:14,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:14,880 INFO L124 PetriNetUnfolderBase]: 356/689 cut-off events. [2024-06-03 21:23:14,880 INFO L125 PetriNetUnfolderBase]: For 19763/19763 co-relation queries the response was YES. [2024-06-03 21:23:14,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4358 conditions, 689 events. 356/689 cut-off events. For 19763/19763 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3530 event pairs, 66 based on Foata normal form. 2/691 useless extension candidates. Maximal degree in co-relation 4269. Up to 605 conditions per place. [2024-06-03 21:23:14,885 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 161 selfloop transitions, 16 changer transitions 0/180 dead transitions. [2024-06-03 21:23:14,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 180 transitions, 2160 flow [2024-06-03 21:23:14,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:23:14,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:23:14,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-03 21:23:14,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-03 21:23:14,887 INFO L175 Difference]: Start difference. First operand has 186 places, 164 transitions, 1748 flow. Second operand 10 states and 119 transitions. [2024-06-03 21:23:14,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 180 transitions, 2160 flow [2024-06-03 21:23:14,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 180 transitions, 2092 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 21:23:14,929 INFO L231 Difference]: Finished difference. Result has 189 places, 165 transitions, 1738 flow [2024-06-03 21:23:14,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1680, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1738, PETRI_PLACES=189, PETRI_TRANSITIONS=165} [2024-06-03 21:23:14,929 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 159 predicate places. [2024-06-03 21:23:14,929 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 165 transitions, 1738 flow [2024-06-03 21:23:14,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:14,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:14,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:14,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 21:23:14,929 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:23:14,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:14,930 INFO L85 PathProgramCache]: Analyzing trace with hash -291862919, now seen corresponding path program 5 times [2024-06-03 21:23:14,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:14,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882253599] [2024-06-03 21:23:14,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:14,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:23:21,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:21,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882253599] [2024-06-03 21:23:21,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882253599] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:21,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:21,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:23:21,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466517534] [2024-06-03 21:23:21,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:21,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:23:21,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:21,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:23:21,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:23:21,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:23:21,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 165 transitions, 1738 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:21,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:21,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:23:21,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:22,350 INFO L124 PetriNetUnfolderBase]: 360/697 cut-off events. [2024-06-03 21:23:22,351 INFO L125 PetriNetUnfolderBase]: For 20646/20646 co-relation queries the response was YES. [2024-06-03 21:23:22,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4390 conditions, 697 events. 360/697 cut-off events. For 20646/20646 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3587 event pairs, 68 based on Foata normal form. 2/699 useless extension candidates. Maximal degree in co-relation 4300. Up to 608 conditions per place. [2024-06-03 21:23:22,356 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 156 selfloop transitions, 21 changer transitions 0/180 dead transitions. [2024-06-03 21:23:22,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 180 transitions, 2148 flow [2024-06-03 21:23:22,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:23:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:23:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-03 21:23:22,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-03 21:23:22,359 INFO L175 Difference]: Start difference. First operand has 189 places, 165 transitions, 1738 flow. Second operand 11 states and 130 transitions. [2024-06-03 21:23:22,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 180 transitions, 2148 flow [2024-06-03 21:23:22,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 180 transitions, 2100 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-03 21:23:22,403 INFO L231 Difference]: Finished difference. Result has 192 places, 166 transitions, 1762 flow [2024-06-03 21:23:22,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1690, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1762, PETRI_PLACES=192, PETRI_TRANSITIONS=166} [2024-06-03 21:23:22,404 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 162 predicate places. [2024-06-03 21:23:22,404 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 166 transitions, 1762 flow [2024-06-03 21:23:22,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:22,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:22,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:22,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 21:23:22,405 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:23:22,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:22,405 INFO L85 PathProgramCache]: Analyzing trace with hash -297225299, now seen corresponding path program 6 times [2024-06-03 21:23:22,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:22,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113810307] [2024-06-03 21:23:22,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:22,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:23:27,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:27,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113810307] [2024-06-03 21:23:27,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113810307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:27,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:27,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:23:27,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72517942] [2024-06-03 21:23:27,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:27,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:23:27,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:27,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:23:27,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:23:27,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:23:27,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 166 transitions, 1762 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:27,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:27,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:23:27,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:28,067 INFO L124 PetriNetUnfolderBase]: 364/705 cut-off events. [2024-06-03 21:23:28,067 INFO L125 PetriNetUnfolderBase]: For 21431/21431 co-relation queries the response was YES. [2024-06-03 21:23:28,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4462 conditions, 705 events. 364/705 cut-off events. For 21431/21431 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3644 event pairs, 70 based on Foata normal form. 2/707 useless extension candidates. Maximal degree in co-relation 4371. Up to 628 conditions per place. [2024-06-03 21:23:28,073 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 161 selfloop transitions, 17 changer transitions 0/181 dead transitions. [2024-06-03 21:23:28,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 181 transitions, 2188 flow [2024-06-03 21:23:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:23:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:23:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-03 21:23:28,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-03 21:23:28,075 INFO L175 Difference]: Start difference. First operand has 192 places, 166 transitions, 1762 flow. Second operand 10 states and 118 transitions. [2024-06-03 21:23:28,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 181 transitions, 2188 flow [2024-06-03 21:23:28,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 181 transitions, 2128 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-03 21:23:28,122 INFO L231 Difference]: Finished difference. Result has 194 places, 168 transitions, 1785 flow [2024-06-03 21:23:28,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1704, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1785, PETRI_PLACES=194, PETRI_TRANSITIONS=168} [2024-06-03 21:23:28,122 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 164 predicate places. [2024-06-03 21:23:28,122 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 168 transitions, 1785 flow [2024-06-03 21:23:28,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:28,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:28,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:28,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 21:23:28,123 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:23:28,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:28,123 INFO L85 PathProgramCache]: Analyzing trace with hash -297373169, now seen corresponding path program 7 times [2024-06-03 21:23:28,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:28,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531365340] [2024-06-03 21:23:28,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:28,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:23:33,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:33,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531365340] [2024-06-03 21:23:33,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531365340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:33,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:33,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:23:33,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928866097] [2024-06-03 21:23:33,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:33,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:23:33,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:33,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:23:33,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:23:33,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:23:33,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 168 transitions, 1785 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:33,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:33,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:23:33,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:33,941 INFO L124 PetriNetUnfolderBase]: 368/713 cut-off events. [2024-06-03 21:23:33,941 INFO L125 PetriNetUnfolderBase]: For 22341/22341 co-relation queries the response was YES. [2024-06-03 21:23:33,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4514 conditions, 713 events. 368/713 cut-off events. For 22341/22341 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3691 event pairs, 70 based on Foata normal form. 2/715 useless extension candidates. Maximal degree in co-relation 4421. Up to 631 conditions per place. [2024-06-03 21:23:33,946 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 164 selfloop transitions, 16 changer transitions 0/183 dead transitions. [2024-06-03 21:23:33,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 183 transitions, 2205 flow [2024-06-03 21:23:33,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:23:33,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:23:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-03 21:23:33,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-03 21:23:33,947 INFO L175 Difference]: Start difference. First operand has 194 places, 168 transitions, 1785 flow. Second operand 10 states and 118 transitions. [2024-06-03 21:23:33,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 183 transitions, 2205 flow [2024-06-03 21:23:33,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 183 transitions, 2154 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-03 21:23:33,995 INFO L231 Difference]: Finished difference. Result has 197 places, 169 transitions, 1798 flow [2024-06-03 21:23:33,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1798, PETRI_PLACES=197, PETRI_TRANSITIONS=169} [2024-06-03 21:23:33,995 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 167 predicate places. [2024-06-03 21:23:33,995 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 169 transitions, 1798 flow [2024-06-03 21:23:33,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:33,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:33,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:33,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 21:23:33,996 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:23:33,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:33,996 INFO L85 PathProgramCache]: Analyzing trace with hash -291647438, now seen corresponding path program 1 times [2024-06-03 21:23:33,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:33,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465046251] [2024-06-03 21:23:33,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:33,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:23:39,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465046251] [2024-06-03 21:23:39,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465046251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:39,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:39,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:23:39,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455331464] [2024-06-03 21:23:39,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:39,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:23:39,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:39,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:23:39,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:23:39,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:23:39,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 169 transitions, 1798 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:39,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:39,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:23:39,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:40,279 INFO L124 PetriNetUnfolderBase]: 394/767 cut-off events. [2024-06-03 21:23:40,280 INFO L125 PetriNetUnfolderBase]: For 33332/33332 co-relation queries the response was YES. [2024-06-03 21:23:40,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4817 conditions, 767 events. 394/767 cut-off events. For 33332/33332 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4050 event pairs, 76 based on Foata normal form. 12/779 useless extension candidates. Maximal degree in co-relation 4723. Up to 633 conditions per place. [2024-06-03 21:23:40,286 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 160 selfloop transitions, 21 changer transitions 7/191 dead transitions. [2024-06-03 21:23:40,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 191 transitions, 2337 flow [2024-06-03 21:23:40,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:23:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:23:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-03 21:23:40,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-03 21:23:40,287 INFO L175 Difference]: Start difference. First operand has 197 places, 169 transitions, 1798 flow. Second operand 11 states and 136 transitions. [2024-06-03 21:23:40,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 191 transitions, 2337 flow [2024-06-03 21:23:40,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 191 transitions, 2283 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-03 21:23:40,342 INFO L231 Difference]: Finished difference. Result has 201 places, 170 transitions, 1814 flow [2024-06-03 21:23:40,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1744, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1814, PETRI_PLACES=201, PETRI_TRANSITIONS=170} [2024-06-03 21:23:40,343 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 171 predicate places. [2024-06-03 21:23:40,343 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 170 transitions, 1814 flow [2024-06-03 21:23:40,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:40,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:40,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:40,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 21:23:40,344 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:23:40,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:40,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1656601909, now seen corresponding path program 1 times [2024-06-03 21:23:40,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:40,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557734367] [2024-06-03 21:23:40,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:40,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:23:45,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:45,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557734367] [2024-06-03 21:23:45,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557734367] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:45,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:45,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:23:45,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378173912] [2024-06-03 21:23:45,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:45,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:23:45,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:45,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:23:45,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:23:45,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:23:45,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 170 transitions, 1814 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:45,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:45,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:23:45,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:46,249 INFO L124 PetriNetUnfolderBase]: 373/723 cut-off events. [2024-06-03 21:23:46,249 INFO L125 PetriNetUnfolderBase]: For 23238/23238 co-relation queries the response was YES. [2024-06-03 21:23:46,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4590 conditions, 723 events. 373/723 cut-off events. For 23238/23238 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3758 event pairs, 46 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 4494. Up to 601 conditions per place. [2024-06-03 21:23:46,255 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 144 selfloop transitions, 41 changer transitions 0/188 dead transitions. [2024-06-03 21:23:46,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 188 transitions, 2298 flow [2024-06-03 21:23:46,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:23:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:23:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-03 21:23:46,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39002932551319647 [2024-06-03 21:23:46,257 INFO L175 Difference]: Start difference. First operand has 201 places, 170 transitions, 1814 flow. Second operand 11 states and 133 transitions. [2024-06-03 21:23:46,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 188 transitions, 2298 flow [2024-06-03 21:23:46,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 188 transitions, 2239 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-03 21:23:46,313 INFO L231 Difference]: Finished difference. Result has 205 places, 175 transitions, 1945 flow [2024-06-03 21:23:46,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1945, PETRI_PLACES=205, PETRI_TRANSITIONS=175} [2024-06-03 21:23:46,313 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 175 predicate places. [2024-06-03 21:23:46,314 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 175 transitions, 1945 flow [2024-06-03 21:23:46,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:46,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:46,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:46,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 21:23:46,314 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:23:46,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:46,314 INFO L85 PathProgramCache]: Analyzing trace with hash 835380139, now seen corresponding path program 2 times [2024-06-03 21:23:46,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:46,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573185640] [2024-06-03 21:23:46,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:46,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:23:51,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:51,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573185640] [2024-06-03 21:23:51,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573185640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:51,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:51,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:23:51,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622634780] [2024-06-03 21:23:51,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:51,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:23:51,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:51,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:23:51,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:23:52,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:23:52,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 175 transitions, 1945 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:52,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:52,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:23:52,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:52,344 INFO L124 PetriNetUnfolderBase]: 379/736 cut-off events. [2024-06-03 21:23:52,344 INFO L125 PetriNetUnfolderBase]: For 24342/24342 co-relation queries the response was YES. [2024-06-03 21:23:52,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4729 conditions, 736 events. 379/736 cut-off events. For 24342/24342 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3857 event pairs, 72 based on Foata normal form. 1/737 useless extension candidates. Maximal degree in co-relation 4631. Up to 636 conditions per place. [2024-06-03 21:23:52,350 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 160 selfloop transitions, 28 changer transitions 0/191 dead transitions. [2024-06-03 21:23:52,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 191 transitions, 2415 flow [2024-06-03 21:23:52,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:23:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:23:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-03 21:23:52,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-03 21:23:52,351 INFO L175 Difference]: Start difference. First operand has 205 places, 175 transitions, 1945 flow. Second operand 10 states and 125 transitions. [2024-06-03 21:23:52,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 191 transitions, 2415 flow [2024-06-03 21:23:52,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 191 transitions, 2301 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-03 21:23:52,409 INFO L231 Difference]: Finished difference. Result has 208 places, 179 transitions, 1975 flow [2024-06-03 21:23:52,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1831, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1975, PETRI_PLACES=208, PETRI_TRANSITIONS=179} [2024-06-03 21:23:52,410 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-03 21:23:52,410 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 179 transitions, 1975 flow [2024-06-03 21:23:52,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:52,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:52,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:52,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 21:23:52,411 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:23:52,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:52,411 INFO L85 PathProgramCache]: Analyzing trace with hash -273787953, now seen corresponding path program 8 times [2024-06-03 21:23:52,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:52,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062448741] [2024-06-03 21:23:52,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:52,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:58,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:23:58,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:58,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062448741] [2024-06-03 21:23:58,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062448741] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:58,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:58,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:23:58,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416423433] [2024-06-03 21:23:58,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:58,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:23:58,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:58,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:23:58,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:23:58,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:23:58,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 179 transitions, 1975 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:58,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:58,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:23:58,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:58,592 INFO L124 PetriNetUnfolderBase]: 383/744 cut-off events. [2024-06-03 21:23:58,592 INFO L125 PetriNetUnfolderBase]: For 26499/26499 co-relation queries the response was YES. [2024-06-03 21:23:58,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4765 conditions, 744 events. 383/744 cut-off events. For 26499/26499 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3921 event pairs, 57 based on Foata normal form. 2/746 useless extension candidates. Maximal degree in co-relation 4666. Up to 613 conditions per place. [2024-06-03 21:23:58,597 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 164 selfloop transitions, 27 changer transitions 0/194 dead transitions. [2024-06-03 21:23:58,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 194 transitions, 2419 flow [2024-06-03 21:23:58,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:23:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:23:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-03 21:23:58,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104 [2024-06-03 21:23:58,598 INFO L175 Difference]: Start difference. First operand has 208 places, 179 transitions, 1975 flow. Second operand 9 states and 110 transitions. [2024-06-03 21:23:58,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 194 transitions, 2419 flow [2024-06-03 21:23:58,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 194 transitions, 2339 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-03 21:23:58,667 INFO L231 Difference]: Finished difference. Result has 210 places, 180 transitions, 1987 flow [2024-06-03 21:23:58,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1987, PETRI_PLACES=210, PETRI_TRANSITIONS=180} [2024-06-03 21:23:58,667 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2024-06-03 21:23:58,667 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 180 transitions, 1987 flow [2024-06-03 21:23:58,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:58,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:58,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:58,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 21:23:58,667 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:23:58,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:58,668 INFO L85 PathProgramCache]: Analyzing trace with hash -994581109, now seen corresponding path program 9 times [2024-06-03 21:23:58,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:58,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288650516] [2024-06-03 21:23:58,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:58,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:24:04,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:04,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288650516] [2024-06-03 21:24:04,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288650516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:04,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:04,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:24:04,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281513310] [2024-06-03 21:24:04,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:04,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:24:04,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:04,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:24:04,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:24:04,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:24:04,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 180 transitions, 1987 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:04,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:04,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:24:04,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:05,172 INFO L124 PetriNetUnfolderBase]: 387/752 cut-off events. [2024-06-03 21:24:05,172 INFO L125 PetriNetUnfolderBase]: For 27635/27635 co-relation queries the response was YES. [2024-06-03 21:24:05,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4860 conditions, 752 events. 387/752 cut-off events. For 27635/27635 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3979 event pairs, 74 based on Foata normal form. 2/754 useless extension candidates. Maximal degree in co-relation 4760. Up to 658 conditions per place. [2024-06-03 21:24:05,178 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 168 selfloop transitions, 22 changer transitions 0/193 dead transitions. [2024-06-03 21:24:05,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 193 transitions, 2433 flow [2024-06-03 21:24:05,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:24:05,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:24:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-03 21:24:05,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-03 21:24:05,179 INFO L175 Difference]: Start difference. First operand has 210 places, 180 transitions, 1987 flow. Second operand 9 states and 107 transitions. [2024-06-03 21:24:05,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 193 transitions, 2433 flow [2024-06-03 21:24:05,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 193 transitions, 2351 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-03 21:24:05,245 INFO L231 Difference]: Finished difference. Result has 213 places, 182 transitions, 2004 flow [2024-06-03 21:24:05,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1909, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2004, PETRI_PLACES=213, PETRI_TRANSITIONS=182} [2024-06-03 21:24:05,245 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 183 predicate places. [2024-06-03 21:24:05,245 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 182 transitions, 2004 flow [2024-06-03 21:24:05,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:05,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:05,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:05,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 21:24:05,245 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:24:05,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:05,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1627028931, now seen corresponding path program 10 times [2024-06-03 21:24:05,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:05,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413568659] [2024-06-03 21:24:05,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:05,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:24:09,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:09,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413568659] [2024-06-03 21:24:09,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413568659] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:09,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:09,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:24:09,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318846576] [2024-06-03 21:24:09,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:09,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:24:09,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:09,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:24:09,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:24:09,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:24:09,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 182 transitions, 2004 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:09,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:09,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:24:09,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:09,955 INFO L124 PetriNetUnfolderBase]: 391/760 cut-off events. [2024-06-03 21:24:09,955 INFO L125 PetriNetUnfolderBase]: For 26600/26600 co-relation queries the response was YES. [2024-06-03 21:24:09,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4859 conditions, 760 events. 391/760 cut-off events. For 26600/26600 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4031 event pairs, 70 based on Foata normal form. 2/762 useless extension candidates. Maximal degree in co-relation 4757. Up to 656 conditions per place. [2024-06-03 21:24:09,961 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 171 selfloop transitions, 21 changer transitions 0/195 dead transitions. [2024-06-03 21:24:09,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 195 transitions, 2444 flow [2024-06-03 21:24:09,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:24:09,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:24:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-03 21:24:09,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-03 21:24:09,963 INFO L175 Difference]: Start difference. First operand has 213 places, 182 transitions, 2004 flow. Second operand 9 states and 107 transitions. [2024-06-03 21:24:09,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 195 transitions, 2444 flow [2024-06-03 21:24:10,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 195 transitions, 2381 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-03 21:24:10,031 INFO L231 Difference]: Finished difference. Result has 216 places, 183 transitions, 2019 flow [2024-06-03 21:24:10,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2019, PETRI_PLACES=216, PETRI_TRANSITIONS=183} [2024-06-03 21:24:10,031 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 186 predicate places. [2024-06-03 21:24:10,032 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 183 transitions, 2019 flow [2024-06-03 21:24:10,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:10,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:10,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:10,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 21:24:10,032 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:24:10,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:10,032 INFO L85 PathProgramCache]: Analyzing trace with hash -989218729, now seen corresponding path program 11 times [2024-06-03 21:24:10,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:10,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373320668] [2024-06-03 21:24:10,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:10,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:24:16,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:16,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373320668] [2024-06-03 21:24:16,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373320668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:16,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:16,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:24:16,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547088653] [2024-06-03 21:24:16,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:16,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:24:16,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:16,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:24:16,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:24:16,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 21:24:16,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 183 transitions, 2019 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:16,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:16,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 21:24:16,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:16,918 INFO L124 PetriNetUnfolderBase]: 395/768 cut-off events. [2024-06-03 21:24:16,918 INFO L125 PetriNetUnfolderBase]: For 26662/26662 co-relation queries the response was YES. [2024-06-03 21:24:16,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4898 conditions, 768 events. 395/768 cut-off events. For 26662/26662 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4082 event pairs, 74 based on Foata normal form. 2/770 useless extension candidates. Maximal degree in co-relation 4795. Up to 662 conditions per place. [2024-06-03 21:24:16,925 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 164 selfloop transitions, 28 changer transitions 0/195 dead transitions. [2024-06-03 21:24:16,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 195 transitions, 2457 flow [2024-06-03 21:24:16,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:24:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:24:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-03 21:24:16,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4229390681003584 [2024-06-03 21:24:16,927 INFO L175 Difference]: Start difference. First operand has 216 places, 183 transitions, 2019 flow. Second operand 9 states and 118 transitions. [2024-06-03 21:24:16,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 195 transitions, 2457 flow [2024-06-03 21:24:16,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 195 transitions, 2391 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-03 21:24:16,991 INFO L231 Difference]: Finished difference. Result has 218 places, 184 transitions, 2045 flow [2024-06-03 21:24:16,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1955, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2045, PETRI_PLACES=218, PETRI_TRANSITIONS=184} [2024-06-03 21:24:16,992 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 188 predicate places. [2024-06-03 21:24:16,992 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 184 transitions, 2045 flow [2024-06-03 21:24:16,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:16,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:16,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-03 21:24:16,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 21:24:16,993 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:24:16,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:16,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1471271901, now seen corresponding path program 3 times [2024-06-03 21:24:16,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:16,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383610205] [2024-06-03 21:24:16,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:16,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:24:23,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:23,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383610205] [2024-06-03 21:24:23,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383610205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:23,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:23,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:24:23,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993083831] [2024-06-03 21:24:23,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:23,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:24:23,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:23,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:24:23,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:24:23,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:24:23,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 184 transitions, 2045 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:23,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:23,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:24:23,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:24,021 INFO L124 PetriNetUnfolderBase]: 398/773 cut-off events. [2024-06-03 21:24:24,021 INFO L125 PetriNetUnfolderBase]: For 25500/25500 co-relation queries the response was YES. [2024-06-03 21:24:24,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4935 conditions, 773 events. 398/773 cut-off events. For 25500/25500 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4095 event pairs, 74 based on Foata normal form. 1/774 useless extension candidates. Maximal degree in co-relation 4831. Up to 630 conditions per place. [2024-06-03 21:24:24,027 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 145 selfloop transitions, 50 changer transitions 0/198 dead transitions. [2024-06-03 21:24:24,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 198 transitions, 2613 flow [2024-06-03 21:24:24,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:24:24,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:24:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 21:24:24,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 21:24:24,029 INFO L175 Difference]: Start difference. First operand has 218 places, 184 transitions, 2045 flow. Second operand 10 states and 124 transitions. [2024-06-03 21:24:24,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 198 transitions, 2613 flow [2024-06-03 21:24:24,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 198 transitions, 2539 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-03 21:24:24,098 INFO L231 Difference]: Finished difference. Result has 221 places, 186 transitions, 2133 flow [2024-06-03 21:24:24,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1971, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2133, PETRI_PLACES=221, PETRI_TRANSITIONS=186} [2024-06-03 21:24:24,099 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 191 predicate places. [2024-06-03 21:24:24,099 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 186 transitions, 2133 flow [2024-06-03 21:24:24,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:24,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:24,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:24,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 21:24:24,099 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:24:24,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:24,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1632746943, now seen corresponding path program 4 times [2024-06-03 21:24:24,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:24,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238699233] [2024-06-03 21:24:24,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:29,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-03 21:24:29,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:29,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238699233] [2024-06-03 21:24:29,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238699233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:29,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:29,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:24:29,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681113735] [2024-06-03 21:24:29,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:29,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:24:29,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:29,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:24:29,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:24:29,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:24:29,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 186 transitions, 2133 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:29,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:29,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:24:29,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:29,910 INFO L124 PetriNetUnfolderBase]: 396/770 cut-off events. [2024-06-03 21:24:29,910 INFO L125 PetriNetUnfolderBase]: For 25030/25030 co-relation queries the response was YES. [2024-06-03 21:24:29,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4887 conditions, 770 events. 396/770 cut-off events. For 25030/25030 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4101 event pairs, 74 based on Foata normal form. 1/771 useless extension candidates. Maximal degree in co-relation 4782. Up to 649 conditions per place. [2024-06-03 21:24:29,917 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 154 selfloop transitions, 41 changer transitions 0/198 dead transitions. [2024-06-03 21:24:29,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 198 transitions, 2564 flow [2024-06-03 21:24:29,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:24:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:24:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-03 21:24:29,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 21:24:29,917 INFO L175 Difference]: Start difference. First operand has 221 places, 186 transitions, 2133 flow. Second operand 10 states and 120 transitions. [2024-06-03 21:24:29,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 198 transitions, 2564 flow [2024-06-03 21:24:29,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 198 transitions, 2390 flow, removed 36 selfloop flow, removed 8 redundant places. [2024-06-03 21:24:29,984 INFO L231 Difference]: Finished difference. Result has 224 places, 187 transitions, 2080 flow [2024-06-03 21:24:29,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1961, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2080, PETRI_PLACES=224, PETRI_TRANSITIONS=187} [2024-06-03 21:24:29,985 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 194 predicate places. [2024-06-03 21:24:29,985 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 187 transitions, 2080 flow [2024-06-03 21:24:29,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:29,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:29,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:29,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-03 21:24:29,985 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:24:29,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:29,986 INFO L85 PathProgramCache]: Analyzing trace with hash -989003248, now seen corresponding path program 2 times [2024-06-03 21:24:29,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:29,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476058459] [2024-06-03 21:24:29,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:29,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:24:35,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:35,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476058459] [2024-06-03 21:24:35,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476058459] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:35,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:35,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:24:35,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216838394] [2024-06-03 21:24:35,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:35,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:24:35,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:35,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:24:35,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:24:35,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:24:35,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 187 transitions, 2080 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:35,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:35,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:24:35,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:35,629 INFO L124 PetriNetUnfolderBase]: 412/806 cut-off events. [2024-06-03 21:24:35,629 INFO L125 PetriNetUnfolderBase]: For 36464/36464 co-relation queries the response was YES. [2024-06-03 21:24:35,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5060 conditions, 806 events. 412/806 cut-off events. For 36464/36464 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4334 event pairs, 78 based on Foata normal form. 10/816 useless extension candidates. Maximal degree in co-relation 4953. Up to 656 conditions per place. [2024-06-03 21:24:35,636 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 163 selfloop transitions, 33 changer transitions 4/203 dead transitions. [2024-06-03 21:24:35,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 203 transitions, 2588 flow [2024-06-03 21:24:35,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:24:35,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:24:35,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 21:24:35,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 21:24:35,637 INFO L175 Difference]: Start difference. First operand has 224 places, 187 transitions, 2080 flow. Second operand 10 states and 124 transitions. [2024-06-03 21:24:35,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 203 transitions, 2588 flow [2024-06-03 21:24:35,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 203 transitions, 2444 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-03 21:24:35,710 INFO L231 Difference]: Finished difference. Result has 225 places, 187 transitions, 2022 flow [2024-06-03 21:24:35,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1936, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2022, PETRI_PLACES=225, PETRI_TRANSITIONS=187} [2024-06-03 21:24:35,711 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 195 predicate places. [2024-06-03 21:24:35,711 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 187 transitions, 2022 flow [2024-06-03 21:24:35,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:35,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:35,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:35,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-03 21:24:35,711 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:24:35,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:35,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2040929599, now seen corresponding path program 12 times [2024-06-03 21:24:35,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:35,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507525474] [2024-06-03 21:24:35,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:35,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:24:40,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:40,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507525474] [2024-06-03 21:24:40,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507525474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:40,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:40,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:24:40,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031018006] [2024-06-03 21:24:40,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:40,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:24:40,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:40,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:24:40,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:24:40,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:24:40,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 187 transitions, 2022 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:40,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:40,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:24:40,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:41,238 INFO L124 PetriNetUnfolderBase]: 410/804 cut-off events. [2024-06-03 21:24:41,238 INFO L125 PetriNetUnfolderBase]: For 27453/27453 co-relation queries the response was YES. [2024-06-03 21:24:41,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5031 conditions, 804 events. 410/804 cut-off events. For 27453/27453 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4340 event pairs, 83 based on Foata normal form. 2/806 useless extension candidates. Maximal degree in co-relation 4923. Up to 710 conditions per place. [2024-06-03 21:24:41,245 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 173 selfloop transitions, 22 changer transitions 0/198 dead transitions. [2024-06-03 21:24:41,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 198 transitions, 2472 flow [2024-06-03 21:24:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:24:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:24:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-03 21:24:41,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-03 21:24:41,246 INFO L175 Difference]: Start difference. First operand has 225 places, 187 transitions, 2022 flow. Second operand 9 states and 107 transitions. [2024-06-03 21:24:41,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 198 transitions, 2472 flow [2024-06-03 21:24:41,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 198 transitions, 2366 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-03 21:24:41,313 INFO L231 Difference]: Finished difference. Result has 226 places, 189 transitions, 2011 flow [2024-06-03 21:24:41,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2011, PETRI_PLACES=226, PETRI_TRANSITIONS=189} [2024-06-03 21:24:41,314 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 196 predicate places. [2024-06-03 21:24:41,314 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 189 transitions, 2011 flow [2024-06-03 21:24:41,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:41,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:41,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:41,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-03 21:24:41,314 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:24:41,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:41,315 INFO L85 PathProgramCache]: Analyzing trace with hash 107480223, now seen corresponding path program 13 times [2024-06-03 21:24:41,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:41,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230872265] [2024-06-03 21:24:41,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:41,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:24:47,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:47,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230872265] [2024-06-03 21:24:47,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230872265] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:47,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:47,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:24:47,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636516724] [2024-06-03 21:24:47,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:47,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:24:47,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:47,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:24:47,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:24:47,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 21:24:47,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 189 transitions, 2011 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:47,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:47,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 21:24:47,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:47,516 INFO L124 PetriNetUnfolderBase]: 414/812 cut-off events. [2024-06-03 21:24:47,516 INFO L125 PetriNetUnfolderBase]: For 27686/27686 co-relation queries the response was YES. [2024-06-03 21:24:47,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5039 conditions, 812 events. 414/812 cut-off events. For 27686/27686 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4411 event pairs, 81 based on Foata normal form. 2/814 useless extension candidates. Maximal degree in co-relation 4930. Up to 713 conditions per place. [2024-06-03 21:24:47,523 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 176 selfloop transitions, 21 changer transitions 0/200 dead transitions. [2024-06-03 21:24:47,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 200 transitions, 2457 flow [2024-06-03 21:24:47,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:24:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:24:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-03 21:24:47,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-03 21:24:47,524 INFO L175 Difference]: Start difference. First operand has 226 places, 189 transitions, 2011 flow. Second operand 9 states and 98 transitions. [2024-06-03 21:24:47,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 200 transitions, 2457 flow [2024-06-03 21:24:47,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 200 transitions, 2392 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 21:24:47,599 INFO L231 Difference]: Finished difference. Result has 229 places, 190 transitions, 2024 flow [2024-06-03 21:24:47,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2024, PETRI_PLACES=229, PETRI_TRANSITIONS=190} [2024-06-03 21:24:47,600 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-03 21:24:47,600 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 190 transitions, 2024 flow [2024-06-03 21:24:47,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:47,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:47,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:47,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-03 21:24:47,601 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:24:47,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:47,601 INFO L85 PathProgramCache]: Analyzing trace with hash 191055161, now seen corresponding path program 14 times [2024-06-03 21:24:47,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:47,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421500275] [2024-06-03 21:24:47,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:47,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:24:53,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:53,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421500275] [2024-06-03 21:24:53,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421500275] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:53,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:53,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:24:53,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828366216] [2024-06-03 21:24:53,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:53,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:24:53,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:53,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:24:53,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:24:53,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:24:53,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 190 transitions, 2024 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:53,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:53,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:24:53,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:54,143 INFO L124 PetriNetUnfolderBase]: 418/820 cut-off events. [2024-06-03 21:24:54,143 INFO L125 PetriNetUnfolderBase]: For 28827/28827 co-relation queries the response was YES. [2024-06-03 21:24:54,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5095 conditions, 820 events. 418/820 cut-off events. For 28827/28827 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4455 event pairs, 83 based on Foata normal form. 2/822 useless extension candidates. Maximal degree in co-relation 4985. Up to 693 conditions per place. [2024-06-03 21:24:54,150 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 159 selfloop transitions, 38 changer transitions 0/200 dead transitions. [2024-06-03 21:24:54,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 200 transitions, 2470 flow [2024-06-03 21:24:54,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:24:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:24:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-03 21:24:54,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-03 21:24:54,151 INFO L175 Difference]: Start difference. First operand has 229 places, 190 transitions, 2024 flow. Second operand 9 states and 109 transitions. [2024-06-03 21:24:54,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 200 transitions, 2470 flow [2024-06-03 21:24:54,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 200 transitions, 2402 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-03 21:24:54,229 INFO L231 Difference]: Finished difference. Result has 231 places, 191 transitions, 2070 flow [2024-06-03 21:24:54,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1956, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2070, PETRI_PLACES=231, PETRI_TRANSITIONS=191} [2024-06-03 21:24:54,229 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places. [2024-06-03 21:24:54,229 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 191 transitions, 2070 flow [2024-06-03 21:24:54,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:54,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:54,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:54,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-03 21:24:54,230 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:24:54,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:54,230 INFO L85 PathProgramCache]: Analyzing trace with hash 112990473, now seen corresponding path program 15 times [2024-06-03 21:24:54,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:54,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101217103] [2024-06-03 21:24:54,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:54,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:25:01,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:01,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101217103] [2024-06-03 21:25:01,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101217103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:01,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:01,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:25:01,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993959987] [2024-06-03 21:25:01,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:01,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:25:01,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:01,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:25:01,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:25:01,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:25:01,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 191 transitions, 2070 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:01,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:01,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:25:01,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:02,030 INFO L124 PetriNetUnfolderBase]: 415/815 cut-off events. [2024-06-03 21:25:02,030 INFO L125 PetriNetUnfolderBase]: For 26844/26844 co-relation queries the response was YES. [2024-06-03 21:25:02,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4957 conditions, 815 events. 415/815 cut-off events. For 26844/26844 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4413 event pairs, 82 based on Foata normal form. 2/817 useless extension candidates. Maximal degree in co-relation 4846. Up to 715 conditions per place. [2024-06-03 21:25:02,037 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 172 selfloop transitions, 25 changer transitions 0/200 dead transitions. [2024-06-03 21:25:02,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 200 transitions, 2484 flow [2024-06-03 21:25:02,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:25:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:25:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-03 21:25:02,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-03 21:25:02,039 INFO L175 Difference]: Start difference. First operand has 231 places, 191 transitions, 2070 flow. Second operand 9 states and 109 transitions. [2024-06-03 21:25:02,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 200 transitions, 2484 flow [2024-06-03 21:25:02,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 200 transitions, 2370 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-03 21:25:02,126 INFO L231 Difference]: Finished difference. Result has 232 places, 191 transitions, 2010 flow [2024-06-03 21:25:02,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1956, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2010, PETRI_PLACES=232, PETRI_TRANSITIONS=191} [2024-06-03 21:25:02,127 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 202 predicate places. [2024-06-03 21:25:02,127 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 191 transitions, 2010 flow [2024-06-03 21:25:02,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:02,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:02,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:02,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-03 21:25:02,127 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:25:02,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:02,128 INFO L85 PathProgramCache]: Analyzing trace with hash 113198235, now seen corresponding path program 5 times [2024-06-03 21:25:02,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:02,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980475559] [2024-06-03 21:25:02,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:02,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:25:07,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:07,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980475559] [2024-06-03 21:25:07,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980475559] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:07,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:07,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:25:07,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354025095] [2024-06-03 21:25:07,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:07,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:25:07,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:07,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:25:07,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:25:07,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:25:07,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 191 transitions, 2010 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:07,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:07,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:25:07,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:07,723 INFO L124 PetriNetUnfolderBase]: 418/820 cut-off events. [2024-06-03 21:25:07,723 INFO L125 PetriNetUnfolderBase]: For 25982/25982 co-relation queries the response was YES. [2024-06-03 21:25:07,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4932 conditions, 820 events. 418/820 cut-off events. For 25982/25982 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4458 event pairs, 82 based on Foata normal form. 1/821 useless extension candidates. Maximal degree in co-relation 4821. Up to 698 conditions per place. [2024-06-03 21:25:07,730 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 163 selfloop transitions, 37 changer transitions 0/203 dead transitions. [2024-06-03 21:25:07,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 203 transitions, 2582 flow [2024-06-03 21:25:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:25:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:25:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-03 21:25:07,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967741935483871 [2024-06-03 21:25:07,731 INFO L175 Difference]: Start difference. First operand has 232 places, 191 transitions, 2010 flow. Second operand 10 states and 123 transitions. [2024-06-03 21:25:07,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 203 transitions, 2582 flow [2024-06-03 21:25:07,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 203 transitions, 2433 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-03 21:25:07,808 INFO L231 Difference]: Finished difference. Result has 233 places, 193 transitions, 1984 flow [2024-06-03 21:25:07,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1861, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1984, PETRI_PLACES=233, PETRI_TRANSITIONS=193} [2024-06-03 21:25:07,808 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2024-06-03 21:25:07,808 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 193 transitions, 1984 flow [2024-06-03 21:25:07,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:07,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:07,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:07,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-03 21:25:07,809 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:25:07,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:07,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1155300197, now seen corresponding path program 6 times [2024-06-03 21:25:07,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:07,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944102423] [2024-06-03 21:25:07,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:07,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:25:13,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:13,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944102423] [2024-06-03 21:25:13,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944102423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:13,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:13,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:25:13,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951361547] [2024-06-03 21:25:13,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:13,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:25:13,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:13,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:25:13,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:25:13,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:25:13,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 193 transitions, 1984 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:13,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:13,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:25:13,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:13,865 INFO L124 PetriNetUnfolderBase]: 416/816 cut-off events. [2024-06-03 21:25:13,865 INFO L125 PetriNetUnfolderBase]: For 24865/24865 co-relation queries the response was YES. [2024-06-03 21:25:13,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4733 conditions, 816 events. 416/816 cut-off events. For 24865/24865 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4418 event pairs, 117 based on Foata normal form. 1/817 useless extension candidates. Maximal degree in co-relation 4622. Up to 746 conditions per place. [2024-06-03 21:25:13,871 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 182 selfloop transitions, 17 changer transitions 0/202 dead transitions. [2024-06-03 21:25:13,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 202 transitions, 2402 flow [2024-06-03 21:25:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:25:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:25:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-03 21:25:13,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2024-06-03 21:25:13,872 INFO L175 Difference]: Start difference. First operand has 233 places, 193 transitions, 1984 flow. Second operand 10 states and 114 transitions. [2024-06-03 21:25:13,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 202 transitions, 2402 flow [2024-06-03 21:25:13,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 202 transitions, 2260 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-03 21:25:13,941 INFO L231 Difference]: Finished difference. Result has 235 places, 193 transitions, 1881 flow [2024-06-03 21:25:13,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1881, PETRI_PLACES=235, PETRI_TRANSITIONS=193} [2024-06-03 21:25:13,941 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 205 predicate places. [2024-06-03 21:25:13,941 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 193 transitions, 1881 flow [2024-06-03 21:25:13,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:13,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:13,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:13,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-03 21:25:13,942 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:25:13,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:13,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1716269584, now seen corresponding path program 3 times [2024-06-03 21:25:13,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:13,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430583783] [2024-06-03 21:25:13,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:13,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:18,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:25:18,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:18,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430583783] [2024-06-03 21:25:18,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430583783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:18,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:18,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:25:18,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152514526] [2024-06-03 21:25:18,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:18,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:25:18,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:18,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:25:18,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:25:18,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:25:18,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 193 transitions, 1881 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:18,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:18,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:25:18,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:19,143 INFO L124 PetriNetUnfolderBase]: 432/852 cut-off events. [2024-06-03 21:25:19,144 INFO L125 PetriNetUnfolderBase]: For 38542/38542 co-relation queries the response was YES. [2024-06-03 21:25:19,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4853 conditions, 852 events. 432/852 cut-off events. For 38542/38542 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4675 event pairs, 63 based on Foata normal form. 10/862 useless extension candidates. Maximal degree in co-relation 4741. Up to 687 conditions per place. [2024-06-03 21:25:19,150 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 162 selfloop transitions, 38 changer transitions 4/207 dead transitions. [2024-06-03 21:25:19,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 207 transitions, 2391 flow [2024-06-03 21:25:19,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:25:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:25:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-03 21:25:19,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-03 21:25:19,151 INFO L175 Difference]: Start difference. First operand has 235 places, 193 transitions, 1881 flow. Second operand 10 states and 125 transitions. [2024-06-03 21:25:19,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 207 transitions, 2391 flow [2024-06-03 21:25:19,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 207 transitions, 2321 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-03 21:25:19,240 INFO L231 Difference]: Finished difference. Result has 235 places, 193 transitions, 1908 flow [2024-06-03 21:25:19,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1811, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1908, PETRI_PLACES=235, PETRI_TRANSITIONS=193} [2024-06-03 21:25:19,240 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 205 predicate places. [2024-06-03 21:25:19,241 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 193 transitions, 1908 flow [2024-06-03 21:25:19,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:19,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:19,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:19,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-03 21:25:19,241 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:25:19,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:19,241 INFO L85 PathProgramCache]: Analyzing trace with hash 112996425, now seen corresponding path program 7 times [2024-06-03 21:25:19,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:19,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421399754] [2024-06-03 21:25:19,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:19,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:25:25,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:25,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421399754] [2024-06-03 21:25:25,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421399754] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:25,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:25,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:25:25,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532007233] [2024-06-03 21:25:25,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:25,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:25:25,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:25,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:25:25,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:25:25,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:25:25,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 193 transitions, 1908 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:25,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:25,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:25:25,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:25,950 INFO L124 PetriNetUnfolderBase]: 424/840 cut-off events. [2024-06-03 21:25:25,950 INFO L125 PetriNetUnfolderBase]: For 25337/25337 co-relation queries the response was YES. [2024-06-03 21:25:25,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4767 conditions, 840 events. 424/840 cut-off events. For 25337/25337 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4630 event pairs, 86 based on Foata normal form. 1/841 useless extension candidates. Maximal degree in co-relation 4654. Up to 731 conditions per place. [2024-06-03 21:25:25,957 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 168 selfloop transitions, 31 changer transitions 0/202 dead transitions. [2024-06-03 21:25:25,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 202 transitions, 2326 flow [2024-06-03 21:25:25,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:25:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:25:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-03 21:25:25,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3903225806451613 [2024-06-03 21:25:25,958 INFO L175 Difference]: Start difference. First operand has 235 places, 193 transitions, 1908 flow. Second operand 10 states and 121 transitions. [2024-06-03 21:25:25,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 202 transitions, 2326 flow [2024-06-03 21:25:26,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 202 transitions, 2198 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-03 21:25:26,044 INFO L231 Difference]: Finished difference. Result has 236 places, 193 transitions, 1847 flow [2024-06-03 21:25:26,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1780, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1847, PETRI_PLACES=236, PETRI_TRANSITIONS=193} [2024-06-03 21:25:26,045 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 206 predicate places. [2024-06-03 21:25:26,045 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 193 transitions, 1847 flow [2024-06-03 21:25:26,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:26,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:26,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:26,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-03 21:25:26,045 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:25:26,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:26,046 INFO L85 PathProgramCache]: Analyzing trace with hash 191061113, now seen corresponding path program 8 times [2024-06-03 21:25:26,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:26,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242213175] [2024-06-03 21:25:26,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:26,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:25:31,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:31,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242213175] [2024-06-03 21:25:31,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242213175] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:31,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:31,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:25:31,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903338085] [2024-06-03 21:25:31,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:31,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:25:31,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:31,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:25:31,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:25:31,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:25:31,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 193 transitions, 1847 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:31,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:31,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:25:31,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:31,979 INFO L124 PetriNetUnfolderBase]: 427/845 cut-off events. [2024-06-03 21:25:31,980 INFO L125 PetriNetUnfolderBase]: For 25982/25982 co-relation queries the response was YES. [2024-06-03 21:25:31,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4763 conditions, 845 events. 427/845 cut-off events. For 25982/25982 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4669 event pairs, 86 based on Foata normal form. 1/846 useless extension candidates. Maximal degree in co-relation 4650. Up to 667 conditions per place. [2024-06-03 21:25:31,985 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 138 selfloop transitions, 65 changer transitions 0/206 dead transitions. [2024-06-03 21:25:31,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 206 transitions, 2331 flow [2024-06-03 21:25:31,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:25:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:25:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-03 21:25:31,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3844086021505376 [2024-06-03 21:25:31,986 INFO L175 Difference]: Start difference. First operand has 236 places, 193 transitions, 1847 flow. Second operand 12 states and 143 transitions. [2024-06-03 21:25:31,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 206 transitions, 2331 flow [2024-06-03 21:25:32,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 206 transitions, 2254 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-03 21:25:32,074 INFO L231 Difference]: Finished difference. Result has 239 places, 195 transitions, 1966 flow [2024-06-03 21:25:32,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1770, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1966, PETRI_PLACES=239, PETRI_TRANSITIONS=195} [2024-06-03 21:25:32,074 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 209 predicate places. [2024-06-03 21:25:32,074 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 195 transitions, 1966 flow [2024-06-03 21:25:32,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:32,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:32,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:32,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-03 21:25:32,074 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:25:32,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:32,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1841420047, now seen corresponding path program 9 times [2024-06-03 21:25:32,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:32,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656756288] [2024-06-03 21:25:32,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:32,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:36,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-03 21:25:36,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:36,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656756288] [2024-06-03 21:25:36,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656756288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:36,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:36,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:25:36,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832511482] [2024-06-03 21:25:36,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:36,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:25:36,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:36,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:25:36,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:25:37,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:25:37,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 195 transitions, 1966 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:37,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:37,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:25:37,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:37,530 INFO L124 PetriNetUnfolderBase]: 430/852 cut-off events. [2024-06-03 21:25:37,530 INFO L125 PetriNetUnfolderBase]: For 27447/27447 co-relation queries the response was YES. [2024-06-03 21:25:37,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4935 conditions, 852 events. 430/852 cut-off events. For 27447/27447 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4719 event pairs, 86 based on Foata normal form. 1/853 useless extension candidates. Maximal degree in co-relation 4821. Up to 672 conditions per place. [2024-06-03 21:25:37,541 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 140 selfloop transitions, 64 changer transitions 0/207 dead transitions. [2024-06-03 21:25:37,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 207 transitions, 2454 flow [2024-06-03 21:25:37,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:25:37,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:25:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-03 21:25:37,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39296187683284456 [2024-06-03 21:25:37,542 INFO L175 Difference]: Start difference. First operand has 239 places, 195 transitions, 1966 flow. Second operand 11 states and 134 transitions. [2024-06-03 21:25:37,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 207 transitions, 2454 flow [2024-06-03 21:25:37,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 207 transitions, 2274 flow, removed 25 selfloop flow, removed 12 redundant places. [2024-06-03 21:25:37,626 INFO L231 Difference]: Finished difference. Result has 238 places, 197 transitions, 1984 flow [2024-06-03 21:25:37,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1786, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1984, PETRI_PLACES=238, PETRI_TRANSITIONS=197} [2024-06-03 21:25:37,627 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places. [2024-06-03 21:25:37,627 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 197 transitions, 1984 flow [2024-06-03 21:25:37,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:37,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:37,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:37,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-03 21:25:37,627 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:25:37,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1155292478, now seen corresponding path program 4 times [2024-06-03 21:25:37,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:37,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850786312] [2024-06-03 21:25:37,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:37,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:25:42,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:42,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850786312] [2024-06-03 21:25:42,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850786312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:42,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:42,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:25:42,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560306470] [2024-06-03 21:25:42,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:42,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:25:42,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:42,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:25:42,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:25:42,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 21:25:42,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 197 transitions, 1984 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:42,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:42,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 21:25:42,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:43,095 INFO L124 PetriNetUnfolderBase]: 434/859 cut-off events. [2024-06-03 21:25:43,096 INFO L125 PetriNetUnfolderBase]: For 28550/28550 co-relation queries the response was YES. [2024-06-03 21:25:43,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4966 conditions, 859 events. 434/859 cut-off events. For 28550/28550 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4759 event pairs, 123 based on Foata normal form. 2/861 useless extension candidates. Maximal degree in co-relation 4853. Up to 776 conditions per place. [2024-06-03 21:25:43,101 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 186 selfloop transitions, 18 changer transitions 0/207 dead transitions. [2024-06-03 21:25:43,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 207 transitions, 2438 flow [2024-06-03 21:25:43,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:25:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:25:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-03 21:25:43,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121863799283154 [2024-06-03 21:25:43,104 INFO L175 Difference]: Start difference. First operand has 238 places, 197 transitions, 1984 flow. Second operand 9 states and 115 transitions. [2024-06-03 21:25:43,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 207 transitions, 2438 flow [2024-06-03 21:25:43,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 207 transitions, 2261 flow, removed 26 selfloop flow, removed 10 redundant places. [2024-06-03 21:25:43,183 INFO L231 Difference]: Finished difference. Result has 237 places, 198 transitions, 1876 flow [2024-06-03 21:25:43,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1807, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1876, PETRI_PLACES=237, PETRI_TRANSITIONS=198} [2024-06-03 21:25:43,184 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 207 predicate places. [2024-06-03 21:25:43,184 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 198 transitions, 1876 flow [2024-06-03 21:25:43,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:43,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:43,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:43,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-03 21:25:43,184 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:25:43,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:43,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1145769278, now seen corresponding path program 5 times [2024-06-03 21:25:43,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:43,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581037279] [2024-06-03 21:25:43,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:43,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:25:49,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:49,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581037279] [2024-06-03 21:25:49,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581037279] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:49,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:49,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:25:49,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479354286] [2024-06-03 21:25:49,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:49,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:25:49,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:49,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:25:49,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:25:50,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:25:50,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 198 transitions, 1876 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:50,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:50,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:25:50,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:50,480 INFO L124 PetriNetUnfolderBase]: 438/867 cut-off events. [2024-06-03 21:25:50,480 INFO L125 PetriNetUnfolderBase]: For 28323/28323 co-relation queries the response was YES. [2024-06-03 21:25:50,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4897 conditions, 867 events. 438/867 cut-off events. For 28323/28323 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4795 event pairs, 121 based on Foata normal form. 2/869 useless extension candidates. Maximal degree in co-relation 4784. Up to 770 conditions per place. [2024-06-03 21:25:50,487 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 187 selfloop transitions, 21 changer transitions 0/211 dead transitions. [2024-06-03 21:25:50,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 211 transitions, 2346 flow [2024-06-03 21:25:50,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:25:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:25:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-03 21:25:50,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36656891495601174 [2024-06-03 21:25:50,488 INFO L175 Difference]: Start difference. First operand has 237 places, 198 transitions, 1876 flow. Second operand 11 states and 125 transitions. [2024-06-03 21:25:50,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 211 transitions, 2346 flow [2024-06-03 21:25:50,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 211 transitions, 2289 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-03 21:25:50,575 INFO L231 Difference]: Finished difference. Result has 241 places, 199 transitions, 1895 flow [2024-06-03 21:25:50,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1819, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1895, PETRI_PLACES=241, PETRI_TRANSITIONS=199} [2024-06-03 21:25:50,576 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2024-06-03 21:25:50,576 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 199 transitions, 1895 flow [2024-06-03 21:25:50,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:50,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:50,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:50,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-03 21:25:50,576 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:25:50,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:50,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1411792988, now seen corresponding path program 6 times [2024-06-03 21:25:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:50,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798636652] [2024-06-03 21:25:50,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:50,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:55,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:25:55,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:55,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798636652] [2024-06-03 21:25:55,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798636652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:55,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:55,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:25:55,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368253086] [2024-06-03 21:25:55,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:55,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:25:55,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:55,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:25:55,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:25:55,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 21:25:55,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 199 transitions, 1895 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:55,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:55,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 21:25:55,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:55,908 INFO L124 PetriNetUnfolderBase]: 435/863 cut-off events. [2024-06-03 21:25:55,908 INFO L125 PetriNetUnfolderBase]: For 25586/25586 co-relation queries the response was YES. [2024-06-03 21:25:55,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4734 conditions, 863 events. 435/863 cut-off events. For 25586/25586 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4790 event pairs, 87 based on Foata normal form. 2/865 useless extension candidates. Maximal degree in co-relation 4620. Up to 719 conditions per place. [2024-06-03 21:25:55,916 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 163 selfloop transitions, 43 changer transitions 0/209 dead transitions. [2024-06-03 21:25:55,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 209 transitions, 2329 flow [2024-06-03 21:25:55,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:25:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:25:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-03 21:25:55,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42258064516129035 [2024-06-03 21:25:55,918 INFO L175 Difference]: Start difference. First operand has 241 places, 199 transitions, 1895 flow. Second operand 10 states and 131 transitions. [2024-06-03 21:25:55,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 209 transitions, 2329 flow [2024-06-03 21:25:56,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 209 transitions, 2263 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-03 21:25:56,011 INFO L231 Difference]: Finished difference. Result has 242 places, 199 transitions, 1919 flow [2024-06-03 21:25:56,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1829, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1919, PETRI_PLACES=242, PETRI_TRANSITIONS=199} [2024-06-03 21:25:56,011 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 212 predicate places. [2024-06-03 21:25:56,011 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 199 transitions, 1919 flow [2024-06-03 21:25:56,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:56,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:56,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:56,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-03 21:25:56,012 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:25:56,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:56,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1411793267, now seen corresponding path program 10 times [2024-06-03 21:25:56,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:56,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451816363] [2024-06-03 21:25:56,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:56,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:00,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:00,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:00,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451816363] [2024-06-03 21:26:00,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451816363] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:00,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:00,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:26:00,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197690156] [2024-06-03 21:26:00,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:00,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:26:00,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:00,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:26:00,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:26:00,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:26:00,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 199 transitions, 1919 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:00,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:00,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:26:00,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:01,325 INFO L124 PetriNetUnfolderBase]: 433/860 cut-off events. [2024-06-03 21:26:01,325 INFO L125 PetriNetUnfolderBase]: For 22643/22643 co-relation queries the response was YES. [2024-06-03 21:26:01,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4655 conditions, 860 events. 433/860 cut-off events. For 22643/22643 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4778 event pairs, 87 based on Foata normal form. 1/861 useless extension candidates. Maximal degree in co-relation 4540. Up to 674 conditions per place. [2024-06-03 21:26:01,332 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 145 selfloop transitions, 62 changer transitions 0/210 dead transitions. [2024-06-03 21:26:01,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 210 transitions, 2415 flow [2024-06-03 21:26:01,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:26:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:26:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 21:26:01,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 21:26:01,334 INFO L175 Difference]: Start difference. First operand has 242 places, 199 transitions, 1919 flow. Second operand 10 states and 124 transitions. [2024-06-03 21:26:01,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 210 transitions, 2415 flow [2024-06-03 21:26:01,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 210 transitions, 2259 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-06-03 21:26:01,414 INFO L231 Difference]: Finished difference. Result has 242 places, 201 transitions, 1958 flow [2024-06-03 21:26:01,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1763, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1958, PETRI_PLACES=242, PETRI_TRANSITIONS=201} [2024-06-03 21:26:01,415 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 212 predicate places. [2024-06-03 21:26:01,415 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 201 transitions, 1958 flow [2024-06-03 21:26:01,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:01,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:01,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:01,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-03 21:26:01,415 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:26:01,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:01,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1874740344, now seen corresponding path program 1 times [2024-06-03 21:26:01,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:01,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774633161] [2024-06-03 21:26:01,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:01,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:06,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:06,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774633161] [2024-06-03 21:26:06,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774633161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:06,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:06,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:26:06,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585541728] [2024-06-03 21:26:06,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:06,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:26:06,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:06,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:26:06,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:26:06,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:26:06,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 201 transitions, 1958 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:06,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:06,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:26:06,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:06,945 INFO L124 PetriNetUnfolderBase]: 449/896 cut-off events. [2024-06-03 21:26:06,946 INFO L125 PetriNetUnfolderBase]: For 34647/34647 co-relation queries the response was YES. [2024-06-03 21:26:06,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4791 conditions, 896 events. 449/896 cut-off events. For 34647/34647 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5024 event pairs, 73 based on Foata normal form. 8/904 useless extension candidates. Maximal degree in co-relation 4676. Up to 756 conditions per place. [2024-06-03 21:26:06,953 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 191 selfloop transitions, 15 changer transitions 16/225 dead transitions. [2024-06-03 21:26:06,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 225 transitions, 2503 flow [2024-06-03 21:26:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:26:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:26:06,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-03 21:26:06,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39296187683284456 [2024-06-03 21:26:06,954 INFO L175 Difference]: Start difference. First operand has 242 places, 201 transitions, 1958 flow. Second operand 11 states and 134 transitions. [2024-06-03 21:26:06,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 225 transitions, 2503 flow [2024-06-03 21:26:07,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 225 transitions, 2303 flow, removed 38 selfloop flow, removed 7 redundant places. [2024-06-03 21:26:07,035 INFO L231 Difference]: Finished difference. Result has 247 places, 198 transitions, 1769 flow [2024-06-03 21:26:07,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1758, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1769, PETRI_PLACES=247, PETRI_TRANSITIONS=198} [2024-06-03 21:26:07,036 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 217 predicate places. [2024-06-03 21:26:07,036 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 198 transitions, 1769 flow [2024-06-03 21:26:07,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:07,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:07,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:07,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-03 21:26:07,036 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:26:07,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:07,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1018124030, now seen corresponding path program 2 times [2024-06-03 21:26:07,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:07,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343951208] [2024-06-03 21:26:07,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:07,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:11,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:11,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343951208] [2024-06-03 21:26:11,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343951208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:11,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:11,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:26:11,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072171560] [2024-06-03 21:26:11,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:11,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:26:11,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:11,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:26:11,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:26:11,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:26:11,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 198 transitions, 1769 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:11,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:11,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:26:11,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:11,972 INFO L124 PetriNetUnfolderBase]: 437/874 cut-off events. [2024-06-03 21:26:11,972 INFO L125 PetriNetUnfolderBase]: For 39917/39917 co-relation queries the response was YES. [2024-06-03 21:26:11,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4605 conditions, 874 events. 437/874 cut-off events. For 39917/39917 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4906 event pairs, 74 based on Foata normal form. 10/884 useless extension candidates. Maximal degree in co-relation 4489. Up to 738 conditions per place. [2024-06-03 21:26:11,978 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 186 selfloop transitions, 18 changer transitions 12/219 dead transitions. [2024-06-03 21:26:11,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 219 transitions, 2343 flow [2024-06-03 21:26:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:26:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:26:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-03 21:26:11,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39296187683284456 [2024-06-03 21:26:11,979 INFO L175 Difference]: Start difference. First operand has 247 places, 198 transitions, 1769 flow. Second operand 11 states and 134 transitions. [2024-06-03 21:26:11,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 219 transitions, 2343 flow [2024-06-03 21:26:12,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 219 transitions, 2305 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-03 21:26:12,056 INFO L231 Difference]: Finished difference. Result has 242 places, 194 transitions, 1732 flow [2024-06-03 21:26:12,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1732, PETRI_PLACES=242, PETRI_TRANSITIONS=194} [2024-06-03 21:26:12,056 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 212 predicate places. [2024-06-03 21:26:12,056 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 194 transitions, 1732 flow [2024-06-03 21:26:12,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:12,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:12,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-03 21:26:12,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-03 21:26:12,057 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:26:12,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:12,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1994169400, now seen corresponding path program 3 times [2024-06-03 21:26:12,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:12,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723583651] [2024-06-03 21:26:12,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:12,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:18,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:18,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723583651] [2024-06-03 21:26:18,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723583651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:18,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:18,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:26:18,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453709044] [2024-06-03 21:26:18,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:18,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:26:18,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:18,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:26:18,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:26:19,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:26:19,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 194 transitions, 1732 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:19,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:19,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:26:19,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:19,514 INFO L124 PetriNetUnfolderBase]: 421/842 cut-off events. [2024-06-03 21:26:19,514 INFO L125 PetriNetUnfolderBase]: For 25692/25692 co-relation queries the response was YES. [2024-06-03 21:26:19,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4372 conditions, 842 events. 421/842 cut-off events. For 25692/25692 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4683 event pairs, 62 based on Foata normal form. 2/844 useless extension candidates. Maximal degree in co-relation 4259. Up to 740 conditions per place. [2024-06-03 21:26:19,520 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 190 selfloop transitions, 20 changer transitions 0/213 dead transitions. [2024-06-03 21:26:19,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 213 transitions, 2219 flow [2024-06-03 21:26:19,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:26:19,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:26:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-03 21:26:19,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041 [2024-06-03 21:26:19,521 INFO L175 Difference]: Start difference. First operand has 242 places, 194 transitions, 1732 flow. Second operand 11 states and 129 transitions. [2024-06-03 21:26:19,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 213 transitions, 2219 flow [2024-06-03 21:26:19,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 213 transitions, 2177 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 21:26:19,592 INFO L231 Difference]: Finished difference. Result has 241 places, 196 transitions, 1765 flow [2024-06-03 21:26:19,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1690, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1765, PETRI_PLACES=241, PETRI_TRANSITIONS=196} [2024-06-03 21:26:19,593 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2024-06-03 21:26:19,593 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 196 transitions, 1765 flow [2024-06-03 21:26:19,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:19,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:19,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:19,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-03 21:26:19,593 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:26:19,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:19,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1989873730, now seen corresponding path program 4 times [2024-06-03 21:26:19,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:19,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739013484] [2024-06-03 21:26:19,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:19,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:25,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:25,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:25,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739013484] [2024-06-03 21:26:25,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739013484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:25,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:25,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:26:25,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191065958] [2024-06-03 21:26:25,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:25,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:26:25,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:25,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:26:25,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:26:25,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:26:25,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 196 transitions, 1765 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:25,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:25,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:26:25,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:25,633 INFO L124 PetriNetUnfolderBase]: 433/870 cut-off events. [2024-06-03 21:26:25,633 INFO L125 PetriNetUnfolderBase]: For 34976/34976 co-relation queries the response was YES. [2024-06-03 21:26:25,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4538 conditions, 870 events. 433/870 cut-off events. For 34976/34976 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4864 event pairs, 66 based on Foata normal form. 8/878 useless extension candidates. Maximal degree in co-relation 4425. Up to 739 conditions per place. [2024-06-03 21:26:25,639 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 186 selfloop transitions, 16 changer transitions 12/217 dead transitions. [2024-06-03 21:26:25,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 217 transitions, 2287 flow [2024-06-03 21:26:25,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:26:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:26:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-03 21:26:25,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 21:26:25,639 INFO L175 Difference]: Start difference. First operand has 241 places, 196 transitions, 1765 flow. Second operand 11 states and 132 transitions. [2024-06-03 21:26:25,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 217 transitions, 2287 flow [2024-06-03 21:26:25,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 217 transitions, 2231 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-03 21:26:25,728 INFO L231 Difference]: Finished difference. Result has 244 places, 193 transitions, 1720 flow [2024-06-03 21:26:25,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1709, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1720, PETRI_PLACES=244, PETRI_TRANSITIONS=193} [2024-06-03 21:26:25,728 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2024-06-03 21:26:25,728 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 193 transitions, 1720 flow [2024-06-03 21:26:25,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:25,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:25,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:25,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-03 21:26:25,729 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:26:25,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:25,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1661736278, now seen corresponding path program 5 times [2024-06-03 21:26:25,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:25,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133538572] [2024-06-03 21:26:25,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:25,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:31,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:31,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133538572] [2024-06-03 21:26:31,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133538572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:31,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:31,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:26:31,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249292519] [2024-06-03 21:26:31,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:31,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:26:31,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:31,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:26:31,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:26:31,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:26:31,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 193 transitions, 1720 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:31,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:31,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:26:31,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:32,013 INFO L124 PetriNetUnfolderBase]: 419/840 cut-off events. [2024-06-03 21:26:32,013 INFO L125 PetriNetUnfolderBase]: For 26454/26454 co-relation queries the response was YES. [2024-06-03 21:26:32,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4375 conditions, 840 events. 419/840 cut-off events. For 26454/26454 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4653 event pairs, 47 based on Foata normal form. 2/842 useless extension candidates. Maximal degree in co-relation 4261. Up to 699 conditions per place. [2024-06-03 21:26:32,020 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 191 selfloop transitions, 21 changer transitions 0/215 dead transitions. [2024-06-03 21:26:32,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 215 transitions, 2219 flow [2024-06-03 21:26:32,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:26:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:26:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-03 21:26:32,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-03 21:26:32,021 INFO L175 Difference]: Start difference. First operand has 244 places, 193 transitions, 1720 flow. Second operand 11 states and 130 transitions. [2024-06-03 21:26:32,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 215 transitions, 2219 flow [2024-06-03 21:26:32,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 215 transitions, 2181 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 21:26:32,100 INFO L231 Difference]: Finished difference. Result has 241 places, 195 transitions, 1761 flow [2024-06-03 21:26:32,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1682, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1761, PETRI_PLACES=241, PETRI_TRANSITIONS=195} [2024-06-03 21:26:32,100 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2024-06-03 21:26:32,100 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 195 transitions, 1761 flow [2024-06-03 21:26:32,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:32,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:32,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:32,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-03 21:26:32,100 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:26:32,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:32,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1846843162, now seen corresponding path program 6 times [2024-06-03 21:26:32,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:32,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097048024] [2024-06-03 21:26:32,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:32,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:38,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:38,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097048024] [2024-06-03 21:26:38,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097048024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:38,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:38,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:26:38,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768002847] [2024-06-03 21:26:38,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:38,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:26:38,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:38,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:26:38,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:26:38,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:26:38,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 195 transitions, 1761 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:38,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:38,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:26:38,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:38,785 INFO L124 PetriNetUnfolderBase]: 427/856 cut-off events. [2024-06-03 21:26:38,785 INFO L125 PetriNetUnfolderBase]: For 26824/26824 co-relation queries the response was YES. [2024-06-03 21:26:38,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4497 conditions, 856 events. 427/856 cut-off events. For 26824/26824 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4769 event pairs, 70 based on Foata normal form. 2/858 useless extension candidates. Maximal degree in co-relation 4384. Up to 751 conditions per place. [2024-06-03 21:26:38,791 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 197 selfloop transitions, 16 changer transitions 0/216 dead transitions. [2024-06-03 21:26:38,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 216 transitions, 2266 flow [2024-06-03 21:26:38,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:26:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:26:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-03 21:26:38,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-03 21:26:38,793 INFO L175 Difference]: Start difference. First operand has 241 places, 195 transitions, 1761 flow. Second operand 11 states and 130 transitions. [2024-06-03 21:26:38,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 216 transitions, 2266 flow [2024-06-03 21:26:38,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 216 transitions, 2206 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-03 21:26:38,877 INFO L231 Difference]: Finished difference. Result has 245 places, 197 transitions, 1774 flow [2024-06-03 21:26:38,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1701, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1774, PETRI_PLACES=245, PETRI_TRANSITIONS=197} [2024-06-03 21:26:38,877 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2024-06-03 21:26:38,877 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 197 transitions, 1774 flow [2024-06-03 21:26:38,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:38,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:38,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:38,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-03 21:26:38,878 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:26:38,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:38,878 INFO L85 PathProgramCache]: Analyzing trace with hash 297414426, now seen corresponding path program 7 times [2024-06-03 21:26:38,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:38,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502196764] [2024-06-03 21:26:38,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:38,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:44,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:44,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502196764] [2024-06-03 21:26:44,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502196764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:44,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:44,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:26:44,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027594116] [2024-06-03 21:26:44,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:44,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:26:44,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:44,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:26:44,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:26:44,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:26:44,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 197 transitions, 1774 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:44,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:44,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:26:44,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:44,596 INFO L124 PetriNetUnfolderBase]: 439/884 cut-off events. [2024-06-03 21:26:44,597 INFO L125 PetriNetUnfolderBase]: For 37980/37980 co-relation queries the response was YES. [2024-06-03 21:26:44,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4627 conditions, 884 events. 439/884 cut-off events. For 37980/37980 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 4952 event pairs, 72 based on Foata normal form. 8/892 useless extension candidates. Maximal degree in co-relation 4512. Up to 764 conditions per place. [2024-06-03 21:26:44,604 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 189 selfloop transitions, 13 changer transitions 12/217 dead transitions. [2024-06-03 21:26:44,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 217 transitions, 2298 flow [2024-06-03 21:26:44,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:26:44,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:26:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-03 21:26:44,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3841642228739003 [2024-06-03 21:26:44,605 INFO L175 Difference]: Start difference. First operand has 245 places, 197 transitions, 1774 flow. Second operand 11 states and 131 transitions. [2024-06-03 21:26:44,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 217 transitions, 2298 flow [2024-06-03 21:26:44,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 217 transitions, 2244 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-03 21:26:44,696 INFO L231 Difference]: Finished difference. Result has 248 places, 194 transitions, 1725 flow [2024-06-03 21:26:44,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1720, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1725, PETRI_PLACES=248, PETRI_TRANSITIONS=194} [2024-06-03 21:26:44,697 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2024-06-03 21:26:44,697 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 194 transitions, 1725 flow [2024-06-03 21:26:44,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:44,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:44,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:44,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-03 21:26:44,697 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:26:44,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:44,698 INFO L85 PathProgramCache]: Analyzing trace with hash 302176026, now seen corresponding path program 8 times [2024-06-03 21:26:44,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:44,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076141406] [2024-06-03 21:26:44,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:44,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:50,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:50,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076141406] [2024-06-03 21:26:50,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076141406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:50,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:50,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:26:50,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057645572] [2024-06-03 21:26:50,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:50,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:26:50,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:50,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:26:50,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:26:50,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:26:50,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 194 transitions, 1725 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:50,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:50,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:26:50,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:51,177 INFO L124 PetriNetUnfolderBase]: 421/846 cut-off events. [2024-06-03 21:26:51,177 INFO L125 PetriNetUnfolderBase]: For 28123/28123 co-relation queries the response was YES. [2024-06-03 21:26:51,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4432 conditions, 846 events. 421/846 cut-off events. For 28123/28123 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4714 event pairs, 74 based on Foata normal form. 2/848 useless extension candidates. Maximal degree in co-relation 4316. Up to 760 conditions per place. [2024-06-03 21:26:51,183 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 189 selfloop transitions, 18 changer transitions 0/210 dead transitions. [2024-06-03 21:26:51,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 210 transitions, 2205 flow [2024-06-03 21:26:51,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:26:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:26:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-03 21:26:51,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375366568914956 [2024-06-03 21:26:51,184 INFO L175 Difference]: Start difference. First operand has 248 places, 194 transitions, 1725 flow. Second operand 11 states and 128 transitions. [2024-06-03 21:26:51,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 210 transitions, 2205 flow [2024-06-03 21:26:51,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 210 transitions, 2173 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 21:26:51,268 INFO L231 Difference]: Finished difference. Result has 244 places, 195 transitions, 1763 flow [2024-06-03 21:26:51,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1693, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1763, PETRI_PLACES=244, PETRI_TRANSITIONS=195} [2024-06-03 21:26:51,269 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2024-06-03 21:26:51,269 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 195 transitions, 1763 flow [2024-06-03 21:26:51,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:51,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:51,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:51,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-03 21:26:51,269 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:26:51,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash 301998396, now seen corresponding path program 9 times [2024-06-03 21:26:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:51,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400321714] [2024-06-03 21:26:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:51,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:55,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:55,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400321714] [2024-06-03 21:26:55,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400321714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:55,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:55,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:26:55,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746131881] [2024-06-03 21:26:55,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:55,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:26:55,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:55,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:26:55,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:26:56,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:26:56,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 195 transitions, 1763 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:56,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:56,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:26:56,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:56,447 INFO L124 PetriNetUnfolderBase]: 429/862 cut-off events. [2024-06-03 21:26:56,447 INFO L125 PetriNetUnfolderBase]: For 28549/28549 co-relation queries the response was YES. [2024-06-03 21:26:56,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4542 conditions, 862 events. 429/862 cut-off events. For 28549/28549 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4823 event pairs, 72 based on Foata normal form. 2/864 useless extension candidates. Maximal degree in co-relation 4428. Up to 762 conditions per place. [2024-06-03 21:26:56,454 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 191 selfloop transitions, 19 changer transitions 0/213 dead transitions. [2024-06-03 21:26:56,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 213 transitions, 2258 flow [2024-06-03 21:26:56,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:26:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:26:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-03 21:26:56,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-03 21:26:56,455 INFO L175 Difference]: Start difference. First operand has 244 places, 195 transitions, 1763 flow. Second operand 11 states and 130 transitions. [2024-06-03 21:26:56,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 213 transitions, 2258 flow [2024-06-03 21:26:56,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 213 transitions, 2182 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-03 21:26:56,565 INFO L231 Difference]: Finished difference. Result has 247 places, 197 transitions, 1772 flow [2024-06-03 21:26:56,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1687, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1772, PETRI_PLACES=247, PETRI_TRANSITIONS=197} [2024-06-03 21:26:56,565 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 217 predicate places. [2024-06-03 21:26:56,565 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 197 transitions, 1772 flow [2024-06-03 21:26:56,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:56,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:56,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:56,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-03 21:26:56,565 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:26:56,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:56,567 INFO L85 PathProgramCache]: Analyzing trace with hash -457637250, now seen corresponding path program 10 times [2024-06-03 21:26:56,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:56,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209995891] [2024-06-03 21:26:56,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:56,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:00,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:27:00,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:00,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209995891] [2024-06-03 21:27:00,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209995891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:00,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:00,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:27:00,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770173507] [2024-06-03 21:27:00,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:00,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:27:00,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:00,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:27:00,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:27:00,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:27:00,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 197 transitions, 1772 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:00,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:00,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:27:00,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:01,280 INFO L124 PetriNetUnfolderBase]: 433/870 cut-off events. [2024-06-03 21:27:01,280 INFO L125 PetriNetUnfolderBase]: For 29366/29366 co-relation queries the response was YES. [2024-06-03 21:27:01,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4596 conditions, 870 events. 433/870 cut-off events. For 29366/29366 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4881 event pairs, 76 based on Foata normal form. 2/872 useless extension candidates. Maximal degree in co-relation 4480. Up to 762 conditions per place. [2024-06-03 21:27:01,287 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 178 selfloop transitions, 31 changer transitions 0/212 dead transitions. [2024-06-03 21:27:01,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 212 transitions, 2256 flow [2024-06-03 21:27:01,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:27:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:27:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-03 21:27:01,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39296187683284456 [2024-06-03 21:27:01,288 INFO L175 Difference]: Start difference. First operand has 247 places, 197 transitions, 1772 flow. Second operand 11 states and 134 transitions. [2024-06-03 21:27:01,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 212 transitions, 2256 flow [2024-06-03 21:27:01,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 212 transitions, 2192 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-03 21:27:01,379 INFO L231 Difference]: Finished difference. Result has 250 places, 198 transitions, 1808 flow [2024-06-03 21:27:01,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1708, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1808, PETRI_PLACES=250, PETRI_TRANSITIONS=198} [2024-06-03 21:27:01,379 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 220 predicate places. [2024-06-03 21:27:01,379 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 198 transitions, 1808 flow [2024-06-03 21:27:01,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:01,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:01,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:01,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-03 21:27:01,379 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:27:01,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:01,380 INFO L85 PathProgramCache]: Analyzing trace with hash -406103150, now seen corresponding path program 11 times [2024-06-03 21:27:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:01,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785274283] [2024-06-03 21:27:01,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:01,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:27:07,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:07,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785274283] [2024-06-03 21:27:07,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785274283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:07,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:07,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:27:07,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842651142] [2024-06-03 21:27:07,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:07,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:27:07,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:07,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:27:07,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:27:07,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:27:07,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 198 transitions, 1808 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:07,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:07,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:27:07,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:07,803 INFO L124 PetriNetUnfolderBase]: 444/891 cut-off events. [2024-06-03 21:27:07,803 INFO L125 PetriNetUnfolderBase]: For 35233/35233 co-relation queries the response was YES. [2024-06-03 21:27:07,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4918 conditions, 891 events. 444/891 cut-off events. For 35233/35233 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5005 event pairs, 75 based on Foata normal form. 2/893 useless extension candidates. Maximal degree in co-relation 4801. Up to 766 conditions per place. [2024-06-03 21:27:07,810 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 186 selfloop transitions, 28 changer transitions 0/217 dead transitions. [2024-06-03 21:27:07,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 217 transitions, 2476 flow [2024-06-03 21:27:07,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:27:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:27:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2024-06-03 21:27:07,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 21:27:07,811 INFO L175 Difference]: Start difference. First operand has 250 places, 198 transitions, 1808 flow. Second operand 12 states and 144 transitions. [2024-06-03 21:27:07,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 217 transitions, 2476 flow [2024-06-03 21:27:07,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 217 transitions, 2398 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-03 21:27:07,913 INFO L231 Difference]: Finished difference. Result has 254 places, 200 transitions, 1860 flow [2024-06-03 21:27:07,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1730, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1860, PETRI_PLACES=254, PETRI_TRANSITIONS=200} [2024-06-03 21:27:07,913 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 224 predicate places. [2024-06-03 21:27:07,913 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 200 transitions, 1860 flow [2024-06-03 21:27:07,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:07,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:07,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:07,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-03 21:27:07,913 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:27:07,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:07,914 INFO L85 PathProgramCache]: Analyzing trace with hash -451381140, now seen corresponding path program 12 times [2024-06-03 21:27:07,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:07,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829494224] [2024-06-03 21:27:07,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:07,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:27:14,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:14,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829494224] [2024-06-03 21:27:14,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829494224] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:14,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:14,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:27:14,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612545055] [2024-06-03 21:27:14,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:14,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:27:14,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:14,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:27:14,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:27:14,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:27:14,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 200 transitions, 1860 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:14,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:14,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:27:14,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:14,552 INFO L124 PetriNetUnfolderBase]: 453/914 cut-off events. [2024-06-03 21:27:14,553 INFO L125 PetriNetUnfolderBase]: For 49829/49829 co-relation queries the response was YES. [2024-06-03 21:27:14,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4899 conditions, 914 events. 453/914 cut-off events. For 49829/49829 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5206 event pairs, 82 based on Foata normal form. 10/924 useless extension candidates. Maximal degree in co-relation 4781. Up to 774 conditions per place. [2024-06-03 21:27:14,560 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 181 selfloop transitions, 27 changer transitions 6/217 dead transitions. [2024-06-03 21:27:14,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 217 transitions, 2390 flow [2024-06-03 21:27:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:27:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:27:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-03 21:27:14,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-03 21:27:14,561 INFO L175 Difference]: Start difference. First operand has 254 places, 200 transitions, 1860 flow. Second operand 11 states and 136 transitions. [2024-06-03 21:27:14,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 217 transitions, 2390 flow [2024-06-03 21:27:14,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 217 transitions, 2295 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-06-03 21:27:14,667 INFO L231 Difference]: Finished difference. Result has 257 places, 197 transitions, 1793 flow [2024-06-03 21:27:14,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1765, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1793, PETRI_PLACES=257, PETRI_TRANSITIONS=197} [2024-06-03 21:27:14,668 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 227 predicate places. [2024-06-03 21:27:14,668 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 197 transitions, 1793 flow [2024-06-03 21:27:14,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:14,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:14,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:14,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-03 21:27:14,668 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:27:14,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:14,668 INFO L85 PathProgramCache]: Analyzing trace with hash -572336930, now seen corresponding path program 13 times [2024-06-03 21:27:14,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:14,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649727088] [2024-06-03 21:27:14,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:14,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:27:20,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:20,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649727088] [2024-06-03 21:27:20,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649727088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:20,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:20,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:27:20,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140198001] [2024-06-03 21:27:20,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:20,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:27:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:20,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:27:20,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:27:20,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:27:20,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 197 transitions, 1793 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:20,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:20,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:27:20,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:20,513 INFO L124 PetriNetUnfolderBase]: 448/905 cut-off events. [2024-06-03 21:27:20,513 INFO L125 PetriNetUnfolderBase]: For 43681/43681 co-relation queries the response was YES. [2024-06-03 21:27:20,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4775 conditions, 905 events. 448/905 cut-off events. For 43681/43681 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5103 event pairs, 78 based on Foata normal form. 8/913 useless extension candidates. Maximal degree in co-relation 4655. Up to 794 conditions per place. [2024-06-03 21:27:20,520 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 188 selfloop transitions, 13 changer transitions 11/215 dead transitions. [2024-06-03 21:27:20,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 215 transitions, 2315 flow [2024-06-03 21:27:20,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:27:20,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:27:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-03 21:27:20,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041 [2024-06-03 21:27:20,521 INFO L175 Difference]: Start difference. First operand has 257 places, 197 transitions, 1793 flow. Second operand 11 states and 129 transitions. [2024-06-03 21:27:20,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 215 transitions, 2315 flow [2024-06-03 21:27:20,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 215 transitions, 2247 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-03 21:27:20,627 INFO L231 Difference]: Finished difference. Result has 257 places, 194 transitions, 1712 flow [2024-06-03 21:27:20,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1725, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1712, PETRI_PLACES=257, PETRI_TRANSITIONS=194} [2024-06-03 21:27:20,628 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 227 predicate places. [2024-06-03 21:27:20,628 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 194 transitions, 1712 flow [2024-06-03 21:27:20,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:20,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:20,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:20,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-03 21:27:20,629 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:27:20,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:20,629 INFO L85 PathProgramCache]: Analyzing trace with hash -628632630, now seen corresponding path program 14 times [2024-06-03 21:27:20,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:20,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752785182] [2024-06-03 21:27:20,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:20,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:27:26,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:26,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752785182] [2024-06-03 21:27:26,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752785182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:26,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:26,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:27:26,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273694253] [2024-06-03 21:27:26,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:26,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:27:26,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:26,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:27:26,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:27:26,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 21:27:26,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 194 transitions, 1712 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:26,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:26,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 21:27:26,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:27,309 INFO L124 PetriNetUnfolderBase]: 433/872 cut-off events. [2024-06-03 21:27:27,309 INFO L125 PetriNetUnfolderBase]: For 32582/32582 co-relation queries the response was YES. [2024-06-03 21:27:27,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4586 conditions, 872 events. 433/872 cut-off events. For 32582/32582 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4902 event pairs, 76 based on Foata normal form. 2/874 useless extension candidates. Maximal degree in co-relation 4465. Up to 780 conditions per place. [2024-06-03 21:27:27,316 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 192 selfloop transitions, 16 changer transitions 0/211 dead transitions. [2024-06-03 21:27:27,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 211 transitions, 2202 flow [2024-06-03 21:27:27,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:27:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:27:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-03 21:27:27,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-03 21:27:27,317 INFO L175 Difference]: Start difference. First operand has 257 places, 194 transitions, 1712 flow. Second operand 11 states and 116 transitions. [2024-06-03 21:27:27,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 211 transitions, 2202 flow [2024-06-03 21:27:27,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 211 transitions, 2166 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-03 21:27:27,424 INFO L231 Difference]: Finished difference. Result has 253 places, 195 transitions, 1750 flow [2024-06-03 21:27:27,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1676, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1750, PETRI_PLACES=253, PETRI_TRANSITIONS=195} [2024-06-03 21:27:27,425 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 223 predicate places. [2024-06-03 21:27:27,425 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 195 transitions, 1750 flow [2024-06-03 21:27:27,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:27,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:27,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:27,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-03 21:27:27,426 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:27:27,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:27,426 INFO L85 PathProgramCache]: Analyzing trace with hash 302182970, now seen corresponding path program 1 times [2024-06-03 21:27:27,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:27,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275700015] [2024-06-03 21:27:27,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:27,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:27:32,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:32,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275700015] [2024-06-03 21:27:32,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275700015] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:32,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:32,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:27:32,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227228278] [2024-06-03 21:27:32,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:32,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:27:32,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:32,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:27:32,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:27:32,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:27:32,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 195 transitions, 1750 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:32,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:32,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:27:32,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:33,095 INFO L124 PetriNetUnfolderBase]: 445/900 cut-off events. [2024-06-03 21:27:33,095 INFO L125 PetriNetUnfolderBase]: For 47277/47277 co-relation queries the response was YES. [2024-06-03 21:27:33,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4778 conditions, 900 events. 445/900 cut-off events. For 47277/47277 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5117 event pairs, 72 based on Foata normal form. 8/908 useless extension candidates. Maximal degree in co-relation 4659. Up to 776 conditions per place. [2024-06-03 21:27:33,103 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 183 selfloop transitions, 19 changer transitions 9/214 dead transitions. [2024-06-03 21:27:33,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 214 transitions, 2280 flow [2024-06-03 21:27:33,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:27:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:27:33,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-03 21:27:33,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-03 21:27:33,104 INFO L175 Difference]: Start difference. First operand has 253 places, 195 transitions, 1750 flow. Second operand 12 states and 141 transitions. [2024-06-03 21:27:33,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 214 transitions, 2280 flow [2024-06-03 21:27:33,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 214 transitions, 2216 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-03 21:27:33,219 INFO L231 Difference]: Finished difference. Result has 256 places, 192 transitions, 1708 flow [2024-06-03 21:27:33,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1686, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1708, PETRI_PLACES=256, PETRI_TRANSITIONS=192} [2024-06-03 21:27:33,219 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 226 predicate places. [2024-06-03 21:27:33,219 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 192 transitions, 1708 flow [2024-06-03 21:27:33,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:33,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:33,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:33,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-03 21:27:33,220 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:27:33,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:33,220 INFO L85 PathProgramCache]: Analyzing trace with hash -399662466, now seen corresponding path program 2 times [2024-06-03 21:27:33,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:33,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419744898] [2024-06-03 21:27:33,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:33,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:27:40,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:40,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419744898] [2024-06-03 21:27:40,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419744898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:40,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:40,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:27:40,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724629818] [2024-06-03 21:27:40,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:40,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:27:40,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:40,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:27:40,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:27:40,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:27:40,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 192 transitions, 1708 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:40,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:40,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:27:40,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:40,995 INFO L124 PetriNetUnfolderBase]: 440/897 cut-off events. [2024-06-03 21:27:40,995 INFO L125 PetriNetUnfolderBase]: For 48429/48429 co-relation queries the response was YES. [2024-06-03 21:27:41,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4703 conditions, 897 events. 440/897 cut-off events. For 48429/48429 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5111 event pairs, 86 based on Foata normal form. 8/905 useless extension candidates. Maximal degree in co-relation 4583. Up to 773 conditions per place. [2024-06-03 21:27:41,003 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 178 selfloop transitions, 20 changer transitions 9/210 dead transitions. [2024-06-03 21:27:41,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 210 transitions, 2226 flow [2024-06-03 21:27:41,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:27:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:27:41,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-03 21:27:41,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3844086021505376 [2024-06-03 21:27:41,005 INFO L175 Difference]: Start difference. First operand has 256 places, 192 transitions, 1708 flow. Second operand 12 states and 143 transitions. [2024-06-03 21:27:41,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 210 transitions, 2226 flow [2024-06-03 21:27:41,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 210 transitions, 2184 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-03 21:27:41,116 INFO L231 Difference]: Finished difference. Result has 255 places, 189 transitions, 1675 flow [2024-06-03 21:27:41,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1666, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1675, PETRI_PLACES=255, PETRI_TRANSITIONS=189} [2024-06-03 21:27:41,116 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places. [2024-06-03 21:27:41,116 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 189 transitions, 1675 flow [2024-06-03 21:27:41,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:41,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:41,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:41,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-03 21:27:41,116 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:27:41,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:41,117 INFO L85 PathProgramCache]: Analyzing trace with hash -399423456, now seen corresponding path program 3 times [2024-06-03 21:27:41,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:41,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385092540] [2024-06-03 21:27:41,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:41,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:46,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-03 21:27:46,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:46,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385092540] [2024-06-03 21:27:46,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385092540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:46,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:46,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:27:46,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809196997] [2024-06-03 21:27:46,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:46,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:27:46,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:46,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:27:46,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:27:46,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:27:46,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 189 transitions, 1675 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:46,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:46,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:27:46,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:46,814 INFO L124 PetriNetUnfolderBase]: 453/928 cut-off events. [2024-06-03 21:27:46,815 INFO L125 PetriNetUnfolderBase]: For 61603/61603 co-relation queries the response was YES. [2024-06-03 21:27:46,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5435 conditions, 928 events. 453/928 cut-off events. For 61603/61603 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5312 event pairs, 92 based on Foata normal form. 6/934 useless extension candidates. Maximal degree in co-relation 5315. Up to 733 conditions per place. [2024-06-03 21:27:46,824 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 181 selfloop transitions, 19 changer transitions 7/210 dead transitions. [2024-06-03 21:27:46,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 210 transitions, 2379 flow [2024-06-03 21:27:46,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:27:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:27:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-03 21:27:46,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369 [2024-06-03 21:27:46,825 INFO L175 Difference]: Start difference. First operand has 255 places, 189 transitions, 1675 flow. Second operand 11 states and 138 transitions. [2024-06-03 21:27:46,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 210 transitions, 2379 flow [2024-06-03 21:27:46,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 210 transitions, 2331 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-03 21:27:46,993 INFO L231 Difference]: Finished difference. Result has 252 places, 186 transitions, 1637 flow [2024-06-03 21:27:46,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1637, PETRI_PLACES=252, PETRI_TRANSITIONS=186} [2024-06-03 21:27:46,993 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places. [2024-06-03 21:27:46,993 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 186 transitions, 1637 flow [2024-06-03 21:27:46,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:46,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:46,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:46,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-03 21:27:46,993 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:27:46,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:46,994 INFO L85 PathProgramCache]: Analyzing trace with hash -405918576, now seen corresponding path program 4 times [2024-06-03 21:27:46,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:46,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985784947] [2024-06-03 21:27:46,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:46,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:27:53,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:53,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985784947] [2024-06-03 21:27:53,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985784947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:53,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:53,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:27:53,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948275632] [2024-06-03 21:27:53,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:53,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:27:53,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:53,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:27:53,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:27:54,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:27:54,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 186 transitions, 1637 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:54,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:54,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:27:54,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:54,644 INFO L124 PetriNetUnfolderBase]: 443/906 cut-off events. [2024-06-03 21:27:54,644 INFO L125 PetriNetUnfolderBase]: For 62366/62366 co-relation queries the response was YES. [2024-06-03 21:27:54,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5136 conditions, 906 events. 443/906 cut-off events. For 62366/62366 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5138 event pairs, 97 based on Foata normal form. 8/914 useless extension candidates. Maximal degree in co-relation 5017. Up to 786 conditions per place. [2024-06-03 21:27:54,652 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 174 selfloop transitions, 18 changer transitions 9/204 dead transitions. [2024-06-03 21:27:54,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 204 transitions, 2143 flow [2024-06-03 21:27:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:27:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:27:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-03 21:27:54,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-03 21:27:54,654 INFO L175 Difference]: Start difference. First operand has 252 places, 186 transitions, 1637 flow. Second operand 12 states and 141 transitions. [2024-06-03 21:27:54,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 204 transitions, 2143 flow [2024-06-03 21:27:54,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 204 transitions, 2101 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-03 21:27:54,800 INFO L231 Difference]: Finished difference. Result has 250 places, 183 transitions, 1602 flow [2024-06-03 21:27:54,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1595, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1602, PETRI_PLACES=250, PETRI_TRANSITIONS=183} [2024-06-03 21:27:54,800 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 220 predicate places. [2024-06-03 21:27:54,800 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 183 transitions, 1602 flow [2024-06-03 21:27:54,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:54,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:54,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:54,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-03 21:27:54,801 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:27:54,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:54,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1651937802, now seen corresponding path program 15 times [2024-06-03 21:27:54,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:54,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836616432] [2024-06-03 21:27:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:59,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-03 21:27:59,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:59,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836616432] [2024-06-03 21:27:59,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836616432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:59,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:59,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:27:59,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590951790] [2024-06-03 21:27:59,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:59,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:27:59,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:59,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:27:59,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:27:59,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 21:27:59,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 183 transitions, 1602 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:59,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:59,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 21:27:59,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:00,321 INFO L124 PetriNetUnfolderBase]: 438/899 cut-off events. [2024-06-03 21:28:00,321 INFO L125 PetriNetUnfolderBase]: For 61640/61640 co-relation queries the response was YES. [2024-06-03 21:28:00,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5076 conditions, 899 events. 438/899 cut-off events. For 61640/61640 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5073 event pairs, 68 based on Foata normal form. 8/907 useless extension candidates. Maximal degree in co-relation 4959. Up to 680 conditions per place. [2024-06-03 21:28:00,327 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 161 selfloop transitions, 12 changer transitions 27/203 dead transitions. [2024-06-03 21:28:00,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 203 transitions, 2106 flow [2024-06-03 21:28:00,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:28:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:28:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-03 21:28:00,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-03 21:28:00,328 INFO L175 Difference]: Start difference. First operand has 250 places, 183 transitions, 1602 flow. Second operand 10 states and 111 transitions. [2024-06-03 21:28:00,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 203 transitions, 2106 flow [2024-06-03 21:28:00,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 203 transitions, 2059 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-03 21:28:00,452 INFO L231 Difference]: Finished difference. Result has 246 places, 169 transitions, 1485 flow [2024-06-03 21:28:00,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1485, PETRI_PLACES=246, PETRI_TRANSITIONS=169} [2024-06-03 21:28:00,452 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 216 predicate places. [2024-06-03 21:28:00,452 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 169 transitions, 1485 flow [2024-06-03 21:28:00,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:00,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:00,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:00,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-03 21:28:00,452 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:28:00,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:00,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1096353428, now seen corresponding path program 16 times [2024-06-03 21:28:00,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:00,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731031595] [2024-06-03 21:28:00,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:00,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:28:04,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:04,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731031595] [2024-06-03 21:28:04,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731031595] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:04,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:04,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:28:04,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217470400] [2024-06-03 21:28:04,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:04,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:28:04,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:04,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:28:04,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:28:04,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:28:04,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 169 transitions, 1485 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:04,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:04,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:28:04,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:04,794 INFO L124 PetriNetUnfolderBase]: 385/794 cut-off events. [2024-06-03 21:28:04,794 INFO L125 PetriNetUnfolderBase]: For 67147/67147 co-relation queries the response was YES. [2024-06-03 21:28:04,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4788 conditions, 794 events. 385/794 cut-off events. For 67147/67147 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4398 event pairs, 71 based on Foata normal form. 10/804 useless extension candidates. Maximal degree in co-relation 4684. Up to 637 conditions per place. [2024-06-03 21:28:04,800 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 150 selfloop transitions, 19 changer transitions 14/186 dead transitions. [2024-06-03 21:28:04,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 186 transitions, 2023 flow [2024-06-03 21:28:04,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:28:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:28:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-03 21:28:04,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-03 21:28:04,801 INFO L175 Difference]: Start difference. First operand has 246 places, 169 transitions, 1485 flow. Second operand 10 states and 119 transitions. [2024-06-03 21:28:04,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 186 transitions, 2023 flow [2024-06-03 21:28:04,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 186 transitions, 1971 flow, removed 13 selfloop flow, removed 12 redundant places. [2024-06-03 21:28:04,928 INFO L231 Difference]: Finished difference. Result has 229 places, 163 transitions, 1429 flow [2024-06-03 21:28:04,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1429, PETRI_PLACES=229, PETRI_TRANSITIONS=163} [2024-06-03 21:28:04,928 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-03 21:28:04,928 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 163 transitions, 1429 flow [2024-06-03 21:28:04,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:04,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:04,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:04,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-03 21:28:04,929 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:28:04,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:04,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1769747274, now seen corresponding path program 17 times [2024-06-03 21:28:04,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:04,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059272065] [2024-06-03 21:28:04,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:04,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:28:09,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:09,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059272065] [2024-06-03 21:28:09,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059272065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:09,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:09,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:28:09,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145128389] [2024-06-03 21:28:09,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:09,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:28:09,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:09,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:28:09,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:28:09,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:28:09,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 163 transitions, 1429 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:09,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:09,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:28:09,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:09,735 INFO L124 PetriNetUnfolderBase]: 366/761 cut-off events. [2024-06-03 21:28:09,735 INFO L125 PetriNetUnfolderBase]: For 51421/51421 co-relation queries the response was YES. [2024-06-03 21:28:09,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4442 conditions, 761 events. 366/761 cut-off events. For 51421/51421 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4150 event pairs, 52 based on Foata normal form. 8/769 useless extension candidates. Maximal degree in co-relation 4344. Up to 591 conditions per place. [2024-06-03 21:28:09,739 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 142 selfloop transitions, 10 changer transitions 24/179 dead transitions. [2024-06-03 21:28:09,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 179 transitions, 1871 flow [2024-06-03 21:28:09,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:28:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:28:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-03 21:28:09,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-03 21:28:09,741 INFO L175 Difference]: Start difference. First operand has 229 places, 163 transitions, 1429 flow. Second operand 10 states and 116 transitions. [2024-06-03 21:28:09,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 179 transitions, 1871 flow [2024-06-03 21:28:09,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 179 transitions, 1809 flow, removed 10 selfloop flow, removed 11 redundant places. [2024-06-03 21:28:09,835 INFO L231 Difference]: Finished difference. Result has 223 places, 148 transitions, 1279 flow [2024-06-03 21:28:09,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1279, PETRI_PLACES=223, PETRI_TRANSITIONS=148} [2024-06-03 21:28:09,836 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 193 predicate places. [2024-06-03 21:28:09,836 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 148 transitions, 1279 flow [2024-06-03 21:28:09,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:09,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:09,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:09,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-03 21:28:09,836 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:28:09,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash 102509066, now seen corresponding path program 18 times [2024-06-03 21:28:09,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:09,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147376318] [2024-06-03 21:28:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:09,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:28:14,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:14,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147376318] [2024-06-03 21:28:14,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147376318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:14,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:14,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:28:14,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013449438] [2024-06-03 21:28:14,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:14,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:28:14,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:14,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:28:14,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:28:14,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:28:14,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 148 transitions, 1279 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:14,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:14,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:28:14,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:15,164 INFO L124 PetriNetUnfolderBase]: 325/668 cut-off events. [2024-06-03 21:28:15,164 INFO L125 PetriNetUnfolderBase]: For 37063/37063 co-relation queries the response was YES. [2024-06-03 21:28:15,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3986 conditions, 668 events. 325/668 cut-off events. For 37063/37063 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3484 event pairs, 50 based on Foata normal form. 2/670 useless extension candidates. Maximal degree in co-relation 3891. Up to 577 conditions per place. [2024-06-03 21:28:15,169 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 146 selfloop transitions, 13 changer transitions 1/163 dead transitions. [2024-06-03 21:28:15,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 163 transitions, 1661 flow [2024-06-03 21:28:15,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:28:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:28:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-03 21:28:15,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36451612903225805 [2024-06-03 21:28:15,170 INFO L175 Difference]: Start difference. First operand has 223 places, 148 transitions, 1279 flow. Second operand 10 states and 113 transitions. [2024-06-03 21:28:15,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 163 transitions, 1661 flow [2024-06-03 21:28:15,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 163 transitions, 1612 flow, removed 12 selfloop flow, removed 14 redundant places. [2024-06-03 21:28:15,258 INFO L231 Difference]: Finished difference. Result has 204 places, 149 transitions, 1292 flow [2024-06-03 21:28:15,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1292, PETRI_PLACES=204, PETRI_TRANSITIONS=149} [2024-06-03 21:28:15,258 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 174 predicate places. [2024-06-03 21:28:15,258 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 149 transitions, 1292 flow [2024-06-03 21:28:15,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:15,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:15,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:15,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-03 21:28:15,259 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:28:15,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:15,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1581649082, now seen corresponding path program 19 times [2024-06-03 21:28:15,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:15,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376265207] [2024-06-03 21:28:15,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:15,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:28:20,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:20,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376265207] [2024-06-03 21:28:20,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376265207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:20,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:20,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:28:20,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552999631] [2024-06-03 21:28:20,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:20,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:28:20,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:20,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:28:20,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:28:20,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:28:20,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 149 transitions, 1292 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:20,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:20,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:28:20,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:20,857 INFO L124 PetriNetUnfolderBase]: 359/742 cut-off events. [2024-06-03 21:28:20,857 INFO L125 PetriNetUnfolderBase]: For 53844/53844 co-relation queries the response was YES. [2024-06-03 21:28:20,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4737 conditions, 742 events. 359/742 cut-off events. For 53844/53844 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3979 event pairs, 70 based on Foata normal form. 8/750 useless extension candidates. Maximal degree in co-relation 4648. Up to 555 conditions per place. [2024-06-03 21:28:20,863 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 142 selfloop transitions, 16 changer transitions 11/172 dead transitions. [2024-06-03 21:28:20,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 172 transitions, 1938 flow [2024-06-03 21:28:20,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:28:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:28:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-03 21:28:20,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-03 21:28:20,864 INFO L175 Difference]: Start difference. First operand has 204 places, 149 transitions, 1292 flow. Second operand 10 states and 125 transitions. [2024-06-03 21:28:20,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 172 transitions, 1938 flow [2024-06-03 21:28:20,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 172 transitions, 1890 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-03 21:28:20,974 INFO L231 Difference]: Finished difference. Result has 207 places, 147 transitions, 1267 flow [2024-06-03 21:28:20,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1267, PETRI_PLACES=207, PETRI_TRANSITIONS=147} [2024-06-03 21:28:20,975 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 177 predicate places. [2024-06-03 21:28:20,975 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 147 transitions, 1267 flow [2024-06-03 21:28:20,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:20,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:20,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:20,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-03 21:28:20,976 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:28:20,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:20,976 INFO L85 PathProgramCache]: Analyzing trace with hash 890947948, now seen corresponding path program 20 times [2024-06-03 21:28:20,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:20,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886553837] [2024-06-03 21:28:20,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:20,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:28:26,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:26,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886553837] [2024-06-03 21:28:26,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886553837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:26,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:26,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:28:26,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404108763] [2024-06-03 21:28:26,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:26,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:28:26,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:26,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:28:26,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:28:26,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:28:26,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 147 transitions, 1267 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:26,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:26,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:28:26,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:27,315 INFO L124 PetriNetUnfolderBase]: 328/677 cut-off events. [2024-06-03 21:28:27,315 INFO L125 PetriNetUnfolderBase]: For 42570/42570 co-relation queries the response was YES. [2024-06-03 21:28:27,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4259 conditions, 677 events. 328/677 cut-off events. For 42570/42570 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3531 event pairs, 61 based on Foata normal form. 2/679 useless extension candidates. Maximal degree in co-relation 4168. Up to 595 conditions per place. [2024-06-03 21:28:27,320 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 138 selfloop transitions, 18 changer transitions 2/161 dead transitions. [2024-06-03 21:28:27,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 161 transitions, 1649 flow [2024-06-03 21:28:27,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:28:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:28:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-03 21:28:27,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-03 21:28:27,321 INFO L175 Difference]: Start difference. First operand has 207 places, 147 transitions, 1267 flow. Second operand 10 states and 115 transitions. [2024-06-03 21:28:27,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 161 transitions, 1649 flow [2024-06-03 21:28:27,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 161 transitions, 1606 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-03 21:28:27,410 INFO L231 Difference]: Finished difference. Result has 208 places, 148 transitions, 1298 flow [2024-06-03 21:28:27,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1298, PETRI_PLACES=208, PETRI_TRANSITIONS=148} [2024-06-03 21:28:27,411 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-03 21:28:27,411 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 148 transitions, 1298 flow [2024-06-03 21:28:27,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:27,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:27,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:27,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-03 21:28:27,411 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:28:27,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:27,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1577065112, now seen corresponding path program 21 times [2024-06-03 21:28:27,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:27,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190156865] [2024-06-03 21:28:27,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:27,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:28:32,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:32,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190156865] [2024-06-03 21:28:32,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190156865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:32,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:32,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:28:32,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713106593] [2024-06-03 21:28:32,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:32,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:28:32,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:32,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:28:32,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:28:32,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:28:32,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 148 transitions, 1298 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:32,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:32,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:28:32,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:32,921 INFO L124 PetriNetUnfolderBase]: 331/682 cut-off events. [2024-06-03 21:28:32,921 INFO L125 PetriNetUnfolderBase]: For 40987/40987 co-relation queries the response was YES. [2024-06-03 21:28:32,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4297 conditions, 682 events. 331/682 cut-off events. For 40987/40987 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3547 event pairs, 46 based on Foata normal form. 2/684 useless extension candidates. Maximal degree in co-relation 4206. Up to 568 conditions per place. [2024-06-03 21:28:32,926 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 138 selfloop transitions, 21 changer transitions 1/163 dead transitions. [2024-06-03 21:28:32,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 163 transitions, 1680 flow [2024-06-03 21:28:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:28:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:28:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-03 21:28:32,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-03 21:28:32,927 INFO L175 Difference]: Start difference. First operand has 208 places, 148 transitions, 1298 flow. Second operand 10 states and 116 transitions. [2024-06-03 21:28:32,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 163 transitions, 1680 flow [2024-06-03 21:28:33,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 163 transitions, 1614 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-03 21:28:33,026 INFO L231 Difference]: Finished difference. Result has 209 places, 149 transitions, 1312 flow [2024-06-03 21:28:33,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1312, PETRI_PLACES=209, PETRI_TRANSITIONS=149} [2024-06-03 21:28:33,027 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2024-06-03 21:28:33,027 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 149 transitions, 1312 flow [2024-06-03 21:28:33,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:33,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:33,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:33,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-03 21:28:33,027 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-03 21:28:33,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:33,027 INFO L85 PathProgramCache]: Analyzing trace with hash -601003860, now seen corresponding path program 22 times [2024-06-03 21:28:33,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:33,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105715540] [2024-06-03 21:28:33,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:33,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:28:38,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:38,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105715540] [2024-06-03 21:28:38,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105715540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:38,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:38,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:28:38,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077148426] [2024-06-03 21:28:38,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:38,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:28:38,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:38,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:28:38,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:28:38,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:28:38,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 149 transitions, 1312 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:38,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:38,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:28:38,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:39,052 INFO L124 PetriNetUnfolderBase]: 335/690 cut-off events. [2024-06-03 21:28:39,052 INFO L125 PetriNetUnfolderBase]: For 43313/43313 co-relation queries the response was YES. [2024-06-03 21:28:39,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4369 conditions, 690 events. 335/690 cut-off events. For 43313/43313 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3609 event pairs, 65 based on Foata normal form. 2/692 useless extension candidates. Maximal degree in co-relation 4278. Up to 560 conditions per place. [2024-06-03 21:28:39,057 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 120 selfloop transitions, 38 changer transitions 1/162 dead transitions. [2024-06-03 21:28:39,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 162 transitions, 1690 flow [2024-06-03 21:28:39,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:28:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:28:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-03 21:28:39,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-03 21:28:39,059 INFO L175 Difference]: Start difference. First operand has 209 places, 149 transitions, 1312 flow. Second operand 10 states and 122 transitions. [2024-06-03 21:28:39,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 162 transitions, 1690 flow [2024-06-03 21:28:39,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 162 transitions, 1620 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-03 21:28:39,165 INFO L231 Difference]: Finished difference. Result has 211 places, 150 transitions, 1358 flow [2024-06-03 21:28:39,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1358, PETRI_PLACES=211, PETRI_TRANSITIONS=150} [2024-06-03 21:28:39,166 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-03 21:28:39,166 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 150 transitions, 1358 flow [2024-06-03 21:28:39,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:39,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:39,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:39,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-03 21:28:39,166 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-03 21:28:39,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:39,167 INFO L85 PathProgramCache]: Analyzing trace with hash -601008510, now seen corresponding path program 23 times [2024-06-03 21:28:39,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:39,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625136641] [2024-06-03 21:28:39,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:39,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:28:45,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:45,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625136641] [2024-06-03 21:28:45,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625136641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:45,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:45,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:28:45,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544006248] [2024-06-03 21:28:45,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:45,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:28:45,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:45,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:28:45,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:28:45,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:28:45,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 150 transitions, 1358 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:45,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:45,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:28:45,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:46,071 INFO L124 PetriNetUnfolderBase]: 368/757 cut-off events. [2024-06-03 21:28:46,071 INFO L125 PetriNetUnfolderBase]: For 61782/61782 co-relation queries the response was YES. [2024-06-03 21:28:46,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5398 conditions, 757 events. 368/757 cut-off events. For 61782/61782 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4072 event pairs, 72 based on Foata normal form. 2/759 useless extension candidates. Maximal degree in co-relation 5306. Up to 534 conditions per place. [2024-06-03 21:28:46,077 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 123 selfloop transitions, 42 changer transitions 1/169 dead transitions. [2024-06-03 21:28:46,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 169 transitions, 1966 flow [2024-06-03 21:28:46,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:28:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:28:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-03 21:28:46,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096774193548387 [2024-06-03 21:28:46,078 INFO L175 Difference]: Start difference. First operand has 211 places, 150 transitions, 1358 flow. Second operand 10 states and 127 transitions. [2024-06-03 21:28:46,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 169 transitions, 1966 flow [2024-06-03 21:28:46,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 169 transitions, 1860 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-03 21:28:46,216 INFO L231 Difference]: Finished difference. Result has 213 places, 152 transitions, 1410 flow [2024-06-03 21:28:46,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1410, PETRI_PLACES=213, PETRI_TRANSITIONS=152} [2024-06-03 21:28:46,220 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 183 predicate places. [2024-06-03 21:28:46,220 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 152 transitions, 1410 flow [2024-06-03 21:28:46,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:46,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:46,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:46,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-03 21:28:46,220 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-03 21:28:46,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:46,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1068079468, now seen corresponding path program 24 times [2024-06-03 21:28:46,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:46,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246712276] [2024-06-03 21:28:46,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:46,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:28:51,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:51,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246712276] [2024-06-03 21:28:51,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246712276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:51,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:51,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:28:51,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185784679] [2024-06-03 21:28:51,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:51,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:28:51,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:51,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:28:51,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:28:51,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:28:51,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 152 transitions, 1410 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:51,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:51,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:28:51,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:52,301 INFO L124 PetriNetUnfolderBase]: 355/734 cut-off events. [2024-06-03 21:28:52,301 INFO L125 PetriNetUnfolderBase]: For 57855/57855 co-relation queries the response was YES. [2024-06-03 21:28:52,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4653 conditions, 734 events. 355/734 cut-off events. For 57855/57855 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3943 event pairs, 69 based on Foata normal form. 10/744 useless extension candidates. Maximal degree in co-relation 4560. Up to 572 conditions per place. [2024-06-03 21:28:52,307 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 122 selfloop transitions, 35 changer transitions 7/167 dead transitions. [2024-06-03 21:28:52,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 167 transitions, 1828 flow [2024-06-03 21:28:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:28:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:28:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 21:28:52,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 21:28:52,308 INFO L175 Difference]: Start difference. First operand has 213 places, 152 transitions, 1410 flow. Second operand 10 states and 124 transitions. [2024-06-03 21:28:52,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 167 transitions, 1828 flow [2024-06-03 21:28:52,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 167 transitions, 1727 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-03 21:28:52,409 INFO L231 Difference]: Finished difference. Result has 215 places, 149 transitions, 1358 flow [2024-06-03 21:28:52,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1358, PETRI_PLACES=215, PETRI_TRANSITIONS=149} [2024-06-03 21:28:52,409 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 185 predicate places. [2024-06-03 21:28:52,409 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 149 transitions, 1358 flow [2024-06-03 21:28:52,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:52,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:52,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:52,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-03 21:28:52,410 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-03 21:28:52,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:52,410 INFO L85 PathProgramCache]: Analyzing trace with hash -924451240, now seen corresponding path program 5 times [2024-06-03 21:28:52,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:52,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958712030] [2024-06-03 21:28:52,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:52,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:01,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:29:01,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:01,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958712030] [2024-06-03 21:29:01,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958712030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:01,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:01,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:29:01,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060000313] [2024-06-03 21:29:01,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:01,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:29:01,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:01,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:29:01,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:29:01,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:29:01,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 149 transitions, 1358 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:01,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:01,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:29:01,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:01,888 INFO L124 PetriNetUnfolderBase]: 350/725 cut-off events. [2024-06-03 21:29:01,888 INFO L125 PetriNetUnfolderBase]: For 53783/53783 co-relation queries the response was YES. [2024-06-03 21:29:01,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4564 conditions, 725 events. 350/725 cut-off events. For 53783/53783 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3893 event pairs, 67 based on Foata normal form. 8/733 useless extension candidates. Maximal degree in co-relation 4471. Up to 574 conditions per place. [2024-06-03 21:29:01,894 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 123 selfloop transitions, 31 changer transitions 8/165 dead transitions. [2024-06-03 21:29:01,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 165 transitions, 1774 flow [2024-06-03 21:29:01,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:29:01,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:29:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-03 21:29:01,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 21:29:01,895 INFO L175 Difference]: Start difference. First operand has 215 places, 149 transitions, 1358 flow. Second operand 11 states and 132 transitions. [2024-06-03 21:29:01,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 165 transitions, 1774 flow [2024-06-03 21:29:02,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 165 transitions, 1651 flow, removed 8 selfloop flow, removed 13 redundant places. [2024-06-03 21:29:02,009 INFO L231 Difference]: Finished difference. Result has 213 places, 146 transitions, 1284 flow [2024-06-03 21:29:02,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1284, PETRI_PLACES=213, PETRI_TRANSITIONS=146} [2024-06-03 21:29:02,009 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 183 predicate places. [2024-06-03 21:29:02,009 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 146 transitions, 1284 flow [2024-06-03 21:29:02,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:02,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:02,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:02,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-03 21:29:02,010 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-03 21:29:02,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:02,010 INFO L85 PathProgramCache]: Analyzing trace with hash -600823936, now seen corresponding path program 6 times [2024-06-03 21:29:02,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:02,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585995075] [2024-06-03 21:29:02,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:02,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:29:12,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:12,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585995075] [2024-06-03 21:29:12,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585995075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:12,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:12,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:29:12,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808178804] [2024-06-03 21:29:12,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:12,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:29:12,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:12,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:29:12,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:29:12,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:29:12,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 146 transitions, 1284 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:12,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:12,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:29:12,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:12,888 INFO L124 PetriNetUnfolderBase]: 345/722 cut-off events. [2024-06-03 21:29:12,888 INFO L125 PetriNetUnfolderBase]: For 53415/53415 co-relation queries the response was YES. [2024-06-03 21:29:12,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4448 conditions, 722 events. 345/722 cut-off events. For 53415/53415 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3871 event pairs, 69 based on Foata normal form. 8/730 useless extension candidates. Maximal degree in co-relation 4357. Up to 567 conditions per place. [2024-06-03 21:29:12,893 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 122 selfloop transitions, 29 changer transitions 8/162 dead transitions. [2024-06-03 21:29:12,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 162 transitions, 1692 flow [2024-06-03 21:29:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:29:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:29:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-03 21:29:12,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 21:29:12,894 INFO L175 Difference]: Start difference. First operand has 213 places, 146 transitions, 1284 flow. Second operand 11 states and 132 transitions. [2024-06-03 21:29:12,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 162 transitions, 1692 flow [2024-06-03 21:29:12,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 162 transitions, 1622 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-03 21:29:13,000 INFO L231 Difference]: Finished difference. Result has 211 places, 143 transitions, 1257 flow [2024-06-03 21:29:13,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1257, PETRI_PLACES=211, PETRI_TRANSITIONS=143} [2024-06-03 21:29:13,001 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-03 21:29:13,001 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 143 transitions, 1257 flow [2024-06-03 21:29:13,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:13,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:13,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:13,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-03 21:29:13,001 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-03 21:29:13,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:13,001 INFO L85 PathProgramCache]: Analyzing trace with hash -594328816, now seen corresponding path program 7 times [2024-06-03 21:29:13,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:13,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182174606] [2024-06-03 21:29:13,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:13,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:29:18,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:18,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182174606] [2024-06-03 21:29:18,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182174606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:18,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:18,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:29:18,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276729214] [2024-06-03 21:29:18,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:18,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:29:18,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:18,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:29:18,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:29:18,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:29:18,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 143 transitions, 1257 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:18,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:18,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:29:18,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:18,611 INFO L124 PetriNetUnfolderBase]: 336/707 cut-off events. [2024-06-03 21:29:18,611 INFO L125 PetriNetUnfolderBase]: For 47345/47345 co-relation queries the response was YES. [2024-06-03 21:29:18,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4331 conditions, 707 events. 336/707 cut-off events. For 47345/47345 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3779 event pairs, 65 based on Foata normal form. 6/713 useless extension candidates. Maximal degree in co-relation 4241. Up to 555 conditions per place. [2024-06-03 21:29:18,617 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 118 selfloop transitions, 26 changer transitions 10/157 dead transitions. [2024-06-03 21:29:18,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 157 transitions, 1629 flow [2024-06-03 21:29:18,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:29:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:29:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-03 21:29:18,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36950146627565983 [2024-06-03 21:29:18,618 INFO L175 Difference]: Start difference. First operand has 211 places, 143 transitions, 1257 flow. Second operand 11 states and 126 transitions. [2024-06-03 21:29:18,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 157 transitions, 1629 flow [2024-06-03 21:29:18,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 157 transitions, 1563 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-03 21:29:18,709 INFO L231 Difference]: Finished difference. Result has 209 places, 140 transitions, 1221 flow [2024-06-03 21:29:18,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1221, PETRI_PLACES=209, PETRI_TRANSITIONS=140} [2024-06-03 21:29:18,709 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2024-06-03 21:29:18,709 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 140 transitions, 1221 flow [2024-06-03 21:29:18,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:18,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:18,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:18,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-03 21:29:18,710 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-03 21:29:18,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:18,710 INFO L85 PathProgramCache]: Analyzing trace with hash -792083986, now seen corresponding path program 25 times [2024-06-03 21:29:18,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:18,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116465686] [2024-06-03 21:29:18,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:18,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:29:24,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:24,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116465686] [2024-06-03 21:29:24,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116465686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:24,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:24,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:29:24,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252795509] [2024-06-03 21:29:24,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:24,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:29:24,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:24,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:29:24,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:29:25,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:29:25,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 140 transitions, 1221 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:25,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:25,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:29:25,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:25,561 INFO L124 PetriNetUnfolderBase]: 325/678 cut-off events. [2024-06-03 21:29:25,562 INFO L125 PetriNetUnfolderBase]: For 40230/40230 co-relation queries the response was YES. [2024-06-03 21:29:25,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4197 conditions, 678 events. 325/678 cut-off events. For 40230/40230 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3566 event pairs, 70 based on Foata normal form. 2/680 useless extension candidates. Maximal degree in co-relation 4108. Up to 559 conditions per place. [2024-06-03 21:29:25,567 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 112 selfloop transitions, 35 changer transitions 1/151 dead transitions. [2024-06-03 21:29:25,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 151 transitions, 1569 flow [2024-06-03 21:29:25,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:29:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:29:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-03 21:29:25,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-03 21:29:25,568 INFO L175 Difference]: Start difference. First operand has 209 places, 140 transitions, 1221 flow. Second operand 10 states and 122 transitions. [2024-06-03 21:29:25,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 151 transitions, 1569 flow [2024-06-03 21:29:25,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 151 transitions, 1509 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 21:29:25,668 INFO L231 Difference]: Finished difference. Result has 204 places, 141 transitions, 1267 flow [2024-06-03 21:29:25,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1267, PETRI_PLACES=204, PETRI_TRANSITIONS=141} [2024-06-03 21:29:25,669 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 174 predicate places. [2024-06-03 21:29:25,669 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 141 transitions, 1267 flow [2024-06-03 21:29:25,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:25,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:25,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:25,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-03 21:29:25,669 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-03 21:29:25,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:25,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1321926668, now seen corresponding path program 26 times [2024-06-03 21:29:25,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:25,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398255468] [2024-06-03 21:29:25,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:25,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:29:32,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:32,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398255468] [2024-06-03 21:29:32,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398255468] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:32,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:32,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:29:32,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134550193] [2024-06-03 21:29:32,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:32,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:29:32,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:32,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:29:32,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:29:33,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:29:33,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 141 transitions, 1267 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:33,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:33,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:29:33,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:33,664 INFO L124 PetriNetUnfolderBase]: 358/745 cut-off events. [2024-06-03 21:29:33,664 INFO L125 PetriNetUnfolderBase]: For 54992/54992 co-relation queries the response was YES. [2024-06-03 21:29:33,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5187 conditions, 745 events. 358/745 cut-off events. For 54992/54992 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3988 event pairs, 81 based on Foata normal form. 2/747 useless extension candidates. Maximal degree in co-relation 5100. Up to 553 conditions per place. [2024-06-03 21:29:33,669 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 117 selfloop transitions, 37 changer transitions 1/158 dead transitions. [2024-06-03 21:29:33,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 158 transitions, 1837 flow [2024-06-03 21:29:33,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:29:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:29:33,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-03 21:29:33,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096774193548387 [2024-06-03 21:29:33,670 INFO L175 Difference]: Start difference. First operand has 204 places, 141 transitions, 1267 flow. Second operand 10 states and 127 transitions. [2024-06-03 21:29:33,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 158 transitions, 1837 flow [2024-06-03 21:29:33,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 158 transitions, 1725 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-03 21:29:33,793 INFO L231 Difference]: Finished difference. Result has 205 places, 143 transitions, 1301 flow [2024-06-03 21:29:33,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1301, PETRI_PLACES=205, PETRI_TRANSITIONS=143} [2024-06-03 21:29:33,794 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 175 predicate places. [2024-06-03 21:29:33,794 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 143 transitions, 1301 flow [2024-06-03 21:29:33,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:33,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:33,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:33,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-03 21:29:33,795 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-03 21:29:33,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:33,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1255708584, now seen corresponding path program 27 times [2024-06-03 21:29:33,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:33,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891390202] [2024-06-03 21:29:33,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:33,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:29:42,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:42,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891390202] [2024-06-03 21:29:42,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891390202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:42,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:42,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:29:42,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239106851] [2024-06-03 21:29:42,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:42,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:29:42,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:42,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:29:42,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:29:42,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 21:29:42,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 143 transitions, 1301 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:42,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:42,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 21:29:42,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:43,243 INFO L124 PetriNetUnfolderBase]: 362/753 cut-off events. [2024-06-03 21:29:43,243 INFO L125 PetriNetUnfolderBase]: For 56857/56857 co-relation queries the response was YES. [2024-06-03 21:29:43,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5226 conditions, 753 events. 362/753 cut-off events. For 56857/56857 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4072 event pairs, 83 based on Foata normal form. 2/755 useless extension candidates. Maximal degree in co-relation 5139. Up to 580 conditions per place. [2024-06-03 21:29:43,249 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 99 selfloop transitions, 53 changer transitions 1/156 dead transitions. [2024-06-03 21:29:43,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 156 transitions, 1667 flow [2024-06-03 21:29:43,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:29:43,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:29:43,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 154 transitions. [2024-06-03 21:29:43,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41397849462365593 [2024-06-03 21:29:43,250 INFO L175 Difference]: Start difference. First operand has 205 places, 143 transitions, 1301 flow. Second operand 12 states and 154 transitions. [2024-06-03 21:29:43,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 156 transitions, 1667 flow [2024-06-03 21:29:43,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 156 transitions, 1588 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-03 21:29:43,375 INFO L231 Difference]: Finished difference. Result has 211 places, 144 transitions, 1370 flow [2024-06-03 21:29:43,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1370, PETRI_PLACES=211, PETRI_TRANSITIONS=144} [2024-06-03 21:29:43,375 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-03 21:29:43,375 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 144 transitions, 1370 flow [2024-06-03 21:29:43,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:43,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:43,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:43,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-03 21:29:43,375 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-03 21:29:43,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:43,376 INFO L85 PathProgramCache]: Analyzing trace with hash -785827876, now seen corresponding path program 28 times [2024-06-03 21:29:43,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:43,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312776948] [2024-06-03 21:29:43,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:43,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:29:48,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:48,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312776948] [2024-06-03 21:29:48,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312776948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:48,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:48,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:29:48,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101007397] [2024-06-03 21:29:48,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:48,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:29:48,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:48,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:29:48,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:29:49,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:29:49,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 144 transitions, 1370 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:49,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:49,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:29:49,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:49,297 INFO L124 PetriNetUnfolderBase]: 349/730 cut-off events. [2024-06-03 21:29:49,298 INFO L125 PetriNetUnfolderBase]: For 55004/55004 co-relation queries the response was YES. [2024-06-03 21:29:49,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4587 conditions, 730 events. 349/730 cut-off events. For 55004/55004 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3931 event pairs, 74 based on Foata normal form. 10/740 useless extension candidates. Maximal degree in co-relation 4498. Up to 579 conditions per place. [2024-06-03 21:29:49,303 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 115 selfloop transitions, 32 changer transitions 7/157 dead transitions. [2024-06-03 21:29:49,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 157 transitions, 1756 flow [2024-06-03 21:29:49,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:29:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:29:49,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 21:29:49,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 21:29:49,304 INFO L175 Difference]: Start difference. First operand has 211 places, 144 transitions, 1370 flow. Second operand 10 states and 124 transitions. [2024-06-03 21:29:49,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 157 transitions, 1756 flow [2024-06-03 21:29:49,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 157 transitions, 1606 flow, removed 24 selfloop flow, removed 10 redundant places. [2024-06-03 21:29:49,407 INFO L231 Difference]: Finished difference. Result has 211 places, 141 transitions, 1267 flow [2024-06-03 21:29:49,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1267, PETRI_PLACES=211, PETRI_TRANSITIONS=141} [2024-06-03 21:29:49,407 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-03 21:29:49,408 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 141 transitions, 1267 flow [2024-06-03 21:29:49,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:49,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:49,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:49,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-03 21:29:49,408 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-03 21:29:49,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:49,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1454573604, now seen corresponding path program 29 times [2024-06-03 21:29:49,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:49,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841061749] [2024-06-03 21:29:49,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:49,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:54,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:29:54,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:54,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841061749] [2024-06-03 21:29:54,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841061749] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:54,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:54,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:29:54,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454280448] [2024-06-03 21:29:54,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:54,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:29:54,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:54,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:29:54,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:29:54,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:29:54,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 141 transitions, 1267 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:54,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:54,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:29:54,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:54,749 INFO L124 PetriNetUnfolderBase]: 348/729 cut-off events. [2024-06-03 21:29:54,750 INFO L125 PetriNetUnfolderBase]: For 56428/56428 co-relation queries the response was YES. [2024-06-03 21:29:54,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4526 conditions, 729 events. 348/729 cut-off events. For 56428/56428 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3948 event pairs, 106 based on Foata normal form. 10/739 useless extension candidates. Maximal degree in co-relation 4436. Up to 616 conditions per place. [2024-06-03 21:29:54,755 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 125 selfloop transitions, 20 changer transitions 7/155 dead transitions. [2024-06-03 21:29:54,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 155 transitions, 1685 flow [2024-06-03 21:29:54,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:29:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:29:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-03 21:29:54,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3903225806451613 [2024-06-03 21:29:54,756 INFO L175 Difference]: Start difference. First operand has 211 places, 141 transitions, 1267 flow. Second operand 10 states and 121 transitions. [2024-06-03 21:29:54,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 155 transitions, 1685 flow [2024-06-03 21:29:54,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 155 transitions, 1599 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-03 21:29:54,867 INFO L231 Difference]: Finished difference. Result has 210 places, 138 transitions, 1236 flow [2024-06-03 21:29:54,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1236, PETRI_PLACES=210, PETRI_TRANSITIONS=138} [2024-06-03 21:29:54,867 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2024-06-03 21:29:54,867 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 138 transitions, 1236 flow [2024-06-03 21:29:54,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:54,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:54,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:54,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-03 21:29:54,867 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-03 21:29:54,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:54,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1155692888, now seen corresponding path program 30 times [2024-06-03 21:29:54,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:54,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127479933] [2024-06-03 21:29:54,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:54,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:29:59,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:59,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127479933] [2024-06-03 21:29:59,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127479933] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:59,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:59,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:29:59,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559674499] [2024-06-03 21:29:59,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:59,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:29:59,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:59,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:29:59,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:29:59,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:29:59,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 138 transitions, 1236 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:59,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:59,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:29:59,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:00,200 INFO L124 PetriNetUnfolderBase]: 340/711 cut-off events. [2024-06-03 21:30:00,200 INFO L125 PetriNetUnfolderBase]: For 49279/49279 co-relation queries the response was YES. [2024-06-03 21:30:00,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4646 conditions, 711 events. 340/711 cut-off events. For 49279/49279 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3820 event pairs, 73 based on Foata normal form. 2/713 useless extension candidates. Maximal degree in co-relation 4556. Up to 609 conditions per place. [2024-06-03 21:30:00,205 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 126 selfloop transitions, 22 changer transitions 2/153 dead transitions. [2024-06-03 21:30:00,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 153 transitions, 1763 flow [2024-06-03 21:30:00,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:30:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:30:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-03 21:30:00,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-03 21:30:00,206 INFO L175 Difference]: Start difference. First operand has 210 places, 138 transitions, 1236 flow. Second operand 10 states and 119 transitions. [2024-06-03 21:30:00,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 153 transitions, 1763 flow [2024-06-03 21:30:00,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 153 transitions, 1663 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-06-03 21:30:00,315 INFO L231 Difference]: Finished difference. Result has 211 places, 140 transitions, 1269 flow [2024-06-03 21:30:00,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1269, PETRI_PLACES=211, PETRI_TRANSITIONS=140} [2024-06-03 21:30:00,316 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-03 21:30:00,316 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 140 transitions, 1269 flow [2024-06-03 21:30:00,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:00,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:00,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:00,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-03 21:30:00,316 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-03 21:30:00,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:00,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1255886214, now seen corresponding path program 31 times [2024-06-03 21:30:00,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:00,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449913732] [2024-06-03 21:30:00,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:00,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:30:06,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:06,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449913732] [2024-06-03 21:30:06,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449913732] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:06,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:06,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:30:06,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591501734] [2024-06-03 21:30:06,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:06,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:30:06,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:06,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:30:06,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:30:06,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:30:06,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 140 transitions, 1269 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:06,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:06,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:30:06,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:07,215 INFO L124 PetriNetUnfolderBase]: 362/753 cut-off events. [2024-06-03 21:30:07,215 INFO L125 PetriNetUnfolderBase]: For 66825/66825 co-relation queries the response was YES. [2024-06-03 21:30:07,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5505 conditions, 753 events. 362/753 cut-off events. For 66825/66825 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4075 event pairs, 84 based on Foata normal form. 2/755 useless extension candidates. Maximal degree in co-relation 5414. Up to 478 conditions per place. [2024-06-03 21:30:07,221 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 90 selfloop transitions, 63 changer transitions 1/157 dead transitions. [2024-06-03 21:30:07,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 157 transitions, 1855 flow [2024-06-03 21:30:07,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:30:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:30:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-03 21:30:07,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-03 21:30:07,222 INFO L175 Difference]: Start difference. First operand has 211 places, 140 transitions, 1269 flow. Second operand 10 states and 130 transitions. [2024-06-03 21:30:07,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 157 transitions, 1855 flow [2024-06-03 21:30:07,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 157 transitions, 1776 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-03 21:30:07,350 INFO L231 Difference]: Finished difference. Result has 215 places, 142 transitions, 1398 flow [2024-06-03 21:30:07,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1398, PETRI_PLACES=215, PETRI_TRANSITIONS=142} [2024-06-03 21:30:07,351 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 185 predicate places. [2024-06-03 21:30:07,351 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 142 transitions, 1398 flow [2024-06-03 21:30:07,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:07,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:07,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:07,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-03 21:30:07,352 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-03 21:30:07,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash -958317766, now seen corresponding path program 32 times [2024-06-03 21:30:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:07,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787993551] [2024-06-03 21:30:07,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:30:12,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:12,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787993551] [2024-06-03 21:30:12,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787993551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:12,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:12,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:30:12,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068557449] [2024-06-03 21:30:12,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:12,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:30:12,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:12,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:30:12,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:30:12,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:30:12,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 142 transitions, 1398 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:12,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:12,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:30:12,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:13,269 INFO L124 PetriNetUnfolderBase]: 367/768 cut-off events. [2024-06-03 21:30:13,269 INFO L125 PetriNetUnfolderBase]: For 74092/74092 co-relation queries the response was YES. [2024-06-03 21:30:13,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5473 conditions, 768 events. 367/768 cut-off events. For 74092/74092 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4189 event pairs, 91 based on Foata normal form. 8/776 useless extension candidates. Maximal degree in co-relation 5381. Up to 659 conditions per place. [2024-06-03 21:30:13,275 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 124 selfloop transitions, 18 changer transitions 9/154 dead transitions. [2024-06-03 21:30:13,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 154 transitions, 1744 flow [2024-06-03 21:30:13,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:30:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:30:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-03 21:30:13,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2024-06-03 21:30:13,276 INFO L175 Difference]: Start difference. First operand has 215 places, 142 transitions, 1398 flow. Second operand 10 states and 117 transitions. [2024-06-03 21:30:13,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 154 transitions, 1744 flow [2024-06-03 21:30:13,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 154 transitions, 1607 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-06-03 21:30:13,421 INFO L231 Difference]: Finished difference. Result has 220 places, 139 transitions, 1276 flow [2024-06-03 21:30:13,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1261, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1276, PETRI_PLACES=220, PETRI_TRANSITIONS=139} [2024-06-03 21:30:13,421 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 190 predicate places. [2024-06-03 21:30:13,421 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 139 transitions, 1276 flow [2024-06-03 21:30:13,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:13,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:13,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:13,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-03 21:30:13,421 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-03 21:30:13,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:13,422 INFO L85 PathProgramCache]: Analyzing trace with hash -963079366, now seen corresponding path program 33 times [2024-06-03 21:30:13,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:13,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324689428] [2024-06-03 21:30:13,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:13,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:30:18,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:18,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324689428] [2024-06-03 21:30:18,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324689428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:18,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:18,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:30:18,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260713635] [2024-06-03 21:30:18,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:18,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:30:18,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:18,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:30:18,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:30:18,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:30:18,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 139 transitions, 1276 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:18,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:18,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:30:18,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:19,150 INFO L124 PetriNetUnfolderBase]: 357/750 cut-off events. [2024-06-03 21:30:19,150 INFO L125 PetriNetUnfolderBase]: For 71149/71149 co-relation queries the response was YES. [2024-06-03 21:30:19,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5136 conditions, 750 events. 357/750 cut-off events. For 71149/71149 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4064 event pairs, 80 based on Foata normal form. 8/758 useless extension candidates. Maximal degree in co-relation 5042. Up to 631 conditions per place. [2024-06-03 21:30:19,157 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 121 selfloop transitions, 16 changer transitions 13/153 dead transitions. [2024-06-03 21:30:19,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 153 transitions, 1624 flow [2024-06-03 21:30:19,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:30:19,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:30:19,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-03 21:30:19,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-03 21:30:19,158 INFO L175 Difference]: Start difference. First operand has 220 places, 139 transitions, 1276 flow. Second operand 10 states and 118 transitions. [2024-06-03 21:30:19,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 153 transitions, 1624 flow [2024-06-03 21:30:19,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 153 transitions, 1578 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-03 21:30:19,328 INFO L231 Difference]: Finished difference. Result has 217 places, 135 transitions, 1205 flow [2024-06-03 21:30:19,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1205, PETRI_PLACES=217, PETRI_TRANSITIONS=135} [2024-06-03 21:30:19,328 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 187 predicate places. [2024-06-03 21:30:19,328 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 135 transitions, 1205 flow [2024-06-03 21:30:19,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:19,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:19,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:19,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-03 21:30:19,329 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:30:19,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:19,329 INFO L85 PathProgramCache]: Analyzing trace with hash -816154822, now seen corresponding path program 34 times [2024-06-03 21:30:19,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:19,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319776432] [2024-06-03 21:30:19,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:19,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:30:24,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:24,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319776432] [2024-06-03 21:30:24,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319776432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:24,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:24,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:30:24,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064995634] [2024-06-03 21:30:24,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:24,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:30:24,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:24,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:30:24,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:30:24,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:30:24,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 135 transitions, 1205 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:24,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:24,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:30:24,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:25,072 INFO L124 PetriNetUnfolderBase]: 322/681 cut-off events. [2024-06-03 21:30:25,072 INFO L125 PetriNetUnfolderBase]: For 56939/56939 co-relation queries the response was YES. [2024-06-03 21:30:25,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4149 conditions, 681 events. 322/681 cut-off events. For 56939/56939 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3631 event pairs, 71 based on Foata normal form. 10/691 useless extension candidates. Maximal degree in co-relation 4056. Up to 456 conditions per place. [2024-06-03 21:30:25,078 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 86 selfloop transitions, 52 changer transitions 7/148 dead transitions. [2024-06-03 21:30:25,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 148 transitions, 1573 flow [2024-06-03 21:30:25,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:30:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:30:25,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-03 21:30:25,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-03 21:30:25,079 INFO L175 Difference]: Start difference. First operand has 217 places, 135 transitions, 1205 flow. Second operand 10 states and 129 transitions. [2024-06-03 21:30:25,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 148 transitions, 1573 flow [2024-06-03 21:30:25,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 148 transitions, 1442 flow, removed 13 selfloop flow, removed 13 redundant places. [2024-06-03 21:30:25,187 INFO L231 Difference]: Finished difference. Result has 209 places, 132 transitions, 1161 flow [2024-06-03 21:30:25,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1161, PETRI_PLACES=209, PETRI_TRANSITIONS=132} [2024-06-03 21:30:25,187 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2024-06-03 21:30:25,187 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 132 transitions, 1161 flow [2024-06-03 21:30:25,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:25,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:25,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:25,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-03 21:30:25,187 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:30:25,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:25,188 INFO L85 PathProgramCache]: Analyzing trace with hash -792077042, now seen corresponding path program 8 times [2024-06-03 21:30:25,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:25,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297720795] [2024-06-03 21:30:25,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:25,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:30:31,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:31,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297720795] [2024-06-03 21:30:31,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297720795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:31,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:31,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:30:31,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155099063] [2024-06-03 21:30:31,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:31,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:30:31,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:31,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:30:31,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:30:31,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:30:31,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 132 transitions, 1161 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:31,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:31,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:30:31,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:32,352 INFO L124 PetriNetUnfolderBase]: 317/672 cut-off events. [2024-06-03 21:30:32,352 INFO L125 PetriNetUnfolderBase]: For 50221/50221 co-relation queries the response was YES. [2024-06-03 21:30:32,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3931 conditions, 672 events. 317/672 cut-off events. For 50221/50221 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3573 event pairs, 71 based on Foata normal form. 8/680 useless extension candidates. Maximal degree in co-relation 3844. Up to 536 conditions per place. [2024-06-03 21:30:32,357 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 108 selfloop transitions, 27 changer transitions 8/146 dead transitions. [2024-06-03 21:30:32,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 146 transitions, 1527 flow [2024-06-03 21:30:32,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:30:32,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:30:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-03 21:30:32,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39002932551319647 [2024-06-03 21:30:32,359 INFO L175 Difference]: Start difference. First operand has 209 places, 132 transitions, 1161 flow. Second operand 11 states and 133 transitions. [2024-06-03 21:30:32,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 146 transitions, 1527 flow [2024-06-03 21:30:32,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 146 transitions, 1364 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-03 21:30:32,458 INFO L231 Difference]: Finished difference. Result has 209 places, 129 transitions, 1040 flow [2024-06-03 21:30:32,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1040, PETRI_PLACES=209, PETRI_TRANSITIONS=129} [2024-06-03 21:30:32,459 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2024-06-03 21:30:32,459 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 129 transitions, 1040 flow [2024-06-03 21:30:32,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:32,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:32,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:32,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-03 21:30:32,459 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:30:32,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:32,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1664511342, now seen corresponding path program 9 times [2024-06-03 21:30:32,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:32,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449566881] [2024-06-03 21:30:32,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:32,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:30:38,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:38,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449566881] [2024-06-03 21:30:38,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449566881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:38,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:38,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:30:38,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160447687] [2024-06-03 21:30:38,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:38,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:30:38,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:38,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:30:38,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:30:38,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:30:38,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 129 transitions, 1040 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:38,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:38,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:30:38,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:39,344 INFO L124 PetriNetUnfolderBase]: 312/668 cut-off events. [2024-06-03 21:30:39,344 INFO L125 PetriNetUnfolderBase]: For 48581/48581 co-relation queries the response was YES. [2024-06-03 21:30:39,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 668 events. 312/668 cut-off events. For 48581/48581 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3581 event pairs, 76 based on Foata normal form. 8/676 useless extension candidates. Maximal degree in co-relation 3653. Up to 530 conditions per place. [2024-06-03 21:30:39,349 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 105 selfloop transitions, 24 changer transitions 9/141 dead transitions. [2024-06-03 21:30:39,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 141 transitions, 1386 flow [2024-06-03 21:30:39,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:30:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:30:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-03 21:30:39,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079 [2024-06-03 21:30:39,351 INFO L175 Difference]: Start difference. First operand has 209 places, 129 transitions, 1040 flow. Second operand 11 states and 127 transitions. [2024-06-03 21:30:39,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 141 transitions, 1386 flow [2024-06-03 21:30:39,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 141 transitions, 1322 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-03 21:30:39,440 INFO L231 Difference]: Finished difference. Result has 208 places, 126 transitions, 1009 flow [2024-06-03 21:30:39,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1009, PETRI_PLACES=208, PETRI_TRANSITIONS=126} [2024-06-03 21:30:39,440 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-03 21:30:39,440 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 126 transitions, 1009 flow [2024-06-03 21:30:39,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:39,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:39,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:39,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-03 21:30:39,441 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:30:39,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:39,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1027561480, now seen corresponding path program 10 times [2024-06-03 21:30:39,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:39,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012408246] [2024-06-03 21:30:39,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:39,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:30:44,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:44,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012408246] [2024-06-03 21:30:44,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012408246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:44,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:44,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:30:44,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593037705] [2024-06-03 21:30:44,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:44,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:30:44,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:44,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:30:44,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:30:45,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:30:45,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 126 transitions, 1009 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:45,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:45,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:30:45,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:45,482 INFO L124 PetriNetUnfolderBase]: 329/712 cut-off events. [2024-06-03 21:30:45,483 INFO L125 PetriNetUnfolderBase]: For 55713/55713 co-relation queries the response was YES. [2024-06-03 21:30:45,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4329 conditions, 712 events. 329/712 cut-off events. For 55713/55713 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3866 event pairs, 111 based on Foata normal form. 6/718 useless extension candidates. Maximal degree in co-relation 4243. Up to 564 conditions per place. [2024-06-03 21:30:45,488 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 120 selfloop transitions, 15 changer transitions 7/145 dead transitions. [2024-06-03 21:30:45,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 145 transitions, 1523 flow [2024-06-03 21:30:45,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:30:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:30:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-03 21:30:45,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-03 21:30:45,489 INFO L175 Difference]: Start difference. First operand has 208 places, 126 transitions, 1009 flow. Second operand 11 states and 130 transitions. [2024-06-03 21:30:45,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 145 transitions, 1523 flow [2024-06-03 21:30:45,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 145 transitions, 1463 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-03 21:30:45,608 INFO L231 Difference]: Finished difference. Result has 207 places, 124 transitions, 971 flow [2024-06-03 21:30:45,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=971, PETRI_PLACES=207, PETRI_TRANSITIONS=124} [2024-06-03 21:30:45,608 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 177 predicate places. [2024-06-03 21:30:45,608 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 124 transitions, 971 flow [2024-06-03 21:30:45,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:45,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:45,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:45,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-03 21:30:45,608 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:30:45,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:45,609 INFO L85 PathProgramCache]: Analyzing trace with hash -785581922, now seen corresponding path program 11 times [2024-06-03 21:30:45,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:45,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46142172] [2024-06-03 21:30:45,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:45,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:49,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:30:49,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:49,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46142172] [2024-06-03 21:30:49,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46142172] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:49,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:49,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:30:49,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203735149] [2024-06-03 21:30:49,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:49,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:30:49,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:49,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:30:49,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:30:50,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:30:50,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 124 transitions, 971 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:50,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:50,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:30:50,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:50,698 INFO L124 PetriNetUnfolderBase]: 322/698 cut-off events. [2024-06-03 21:30:50,698 INFO L125 PetriNetUnfolderBase]: For 55677/55677 co-relation queries the response was YES. [2024-06-03 21:30:50,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4264 conditions, 698 events. 322/698 cut-off events. For 55677/55677 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3799 event pairs, 84 based on Foata normal form. 6/704 useless extension candidates. Maximal degree in co-relation 4177. Up to 558 conditions per place. [2024-06-03 21:30:50,704 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 101 selfloop transitions, 22 changer transitions 10/136 dead transitions. [2024-06-03 21:30:50,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 136 transitions, 1289 flow [2024-06-03 21:30:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:30:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:30:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-03 21:30:50,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36656891495601174 [2024-06-03 21:30:50,705 INFO L175 Difference]: Start difference. First operand has 207 places, 124 transitions, 971 flow. Second operand 11 states and 125 transitions. [2024-06-03 21:30:50,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 136 transitions, 1289 flow [2024-06-03 21:30:50,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 136 transitions, 1249 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-03 21:30:50,826 INFO L231 Difference]: Finished difference. Result has 204 places, 121 transitions, 961 flow [2024-06-03 21:30:50,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=961, PETRI_PLACES=204, PETRI_TRANSITIONS=121} [2024-06-03 21:30:50,826 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 174 predicate places. [2024-06-03 21:30:50,826 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 121 transitions, 961 flow [2024-06-03 21:30:50,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:50,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:50,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:50,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-03 21:30:50,827 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:30:50,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:50,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1159108450, now seen corresponding path program 12 times [2024-06-03 21:30:50,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:50,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345426550] [2024-06-03 21:30:50,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:50,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:30:55,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:55,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345426550] [2024-06-03 21:30:55,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345426550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:55,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:55,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:30:55,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186364154] [2024-06-03 21:30:55,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:55,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:30:55,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:55,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:30:55,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:30:55,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:30:55,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 121 transitions, 961 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:55,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:55,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:30:55,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:56,266 INFO L124 PetriNetUnfolderBase]: 337/732 cut-off events. [2024-06-03 21:30:56,266 INFO L125 PetriNetUnfolderBase]: For 66848/66848 co-relation queries the response was YES. [2024-06-03 21:30:56,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4884 conditions, 732 events. 337/732 cut-off events. For 66848/66848 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4016 event pairs, 123 based on Foata normal form. 6/738 useless extension candidates. Maximal degree in co-relation 4799. Up to 507 conditions per place. [2024-06-03 21:30:56,272 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 113 selfloop transitions, 15 changer transitions 9/140 dead transitions. [2024-06-03 21:30:56,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 140 transitions, 1461 flow [2024-06-03 21:30:56,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:30:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:30:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-03 21:30:56,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39002932551319647 [2024-06-03 21:30:56,273 INFO L175 Difference]: Start difference. First operand has 204 places, 121 transitions, 961 flow. Second operand 11 states and 133 transitions. [2024-06-03 21:30:56,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 140 transitions, 1461 flow [2024-06-03 21:30:56,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 140 transitions, 1405 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-03 21:30:56,411 INFO L231 Difference]: Finished difference. Result has 201 places, 118 transitions, 925 flow [2024-06-03 21:30:56,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=925, PETRI_PLACES=201, PETRI_TRANSITIONS=118} [2024-06-03 21:30:56,411 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 171 predicate places. [2024-06-03 21:30:56,411 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 118 transitions, 925 flow [2024-06-03 21:30:56,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:56,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:56,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:56,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-03 21:30:56,412 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:30:56,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:56,412 INFO L85 PathProgramCache]: Analyzing trace with hash -594502838, now seen corresponding path program 13 times [2024-06-03 21:30:56,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:56,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592109880] [2024-06-03 21:30:56,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:56,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:31:03,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:03,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592109880] [2024-06-03 21:31:03,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592109880] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:03,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:03,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:31:03,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166203359] [2024-06-03 21:31:03,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:03,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:31:03,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:03,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:31:03,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:31:03,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:31:03,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 118 transitions, 925 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:03,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:03,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:31:03,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:04,283 INFO L124 PetriNetUnfolderBase]: 310/677 cut-off events. [2024-06-03 21:31:04,284 INFO L125 PetriNetUnfolderBase]: For 61428/61428 co-relation queries the response was YES. [2024-06-03 21:31:04,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4008 conditions, 677 events. 310/677 cut-off events. For 61428/61428 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3649 event pairs, 118 based on Foata normal form. 14/691 useless extension candidates. Maximal degree in co-relation 3924. Up to 550 conditions per place. [2024-06-03 21:31:04,288 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 104 selfloop transitions, 11 changer transitions 14/132 dead transitions. [2024-06-03 21:31:04,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 132 transitions, 1255 flow [2024-06-03 21:31:04,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:31:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:31:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-03 21:31:04,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36950146627565983 [2024-06-03 21:31:04,289 INFO L175 Difference]: Start difference. First operand has 201 places, 118 transitions, 925 flow. Second operand 11 states and 126 transitions. [2024-06-03 21:31:04,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 132 transitions, 1255 flow [2024-06-03 21:31:04,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 132 transitions, 1207 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-03 21:31:04,382 INFO L231 Difference]: Finished difference. Result has 197 places, 111 transitions, 852 flow [2024-06-03 21:31:04,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=852, PETRI_PLACES=197, PETRI_TRANSITIONS=111} [2024-06-03 21:31:04,382 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 167 predicate places. [2024-06-03 21:31:04,382 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 111 transitions, 852 flow [2024-06-03 21:31:04,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:04,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:04,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:04,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-03 21:31:04,383 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:31:04,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:04,384 INFO L85 PathProgramCache]: Analyzing trace with hash -586220258, now seen corresponding path program 14 times [2024-06-03 21:31:04,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:04,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799120317] [2024-06-03 21:31:04,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:04,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:09,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:31:09,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:09,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799120317] [2024-06-03 21:31:09,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799120317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:09,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:09,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:31:09,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472083048] [2024-06-03 21:31:09,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:09,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:31:09,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:09,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:31:09,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:31:09,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:31:09,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 111 transitions, 852 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:09,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:09,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:31:09,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:09,809 INFO L124 PetriNetUnfolderBase]: 270/593 cut-off events. [2024-06-03 21:31:09,809 INFO L125 PetriNetUnfolderBase]: For 36861/36861 co-relation queries the response was YES. [2024-06-03 21:31:09,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3234 conditions, 593 events. 270/593 cut-off events. For 36861/36861 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3081 event pairs, 95 based on Foata normal form. 6/599 useless extension candidates. Maximal degree in co-relation 3153. Up to 507 conditions per place. [2024-06-03 21:31:09,813 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 100 selfloop transitions, 8 changer transitions 14/125 dead transitions. [2024-06-03 21:31:09,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 125 transitions, 1152 flow [2024-06-03 21:31:09,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:31:09,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:31:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-03 21:31:09,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-03 21:31:09,814 INFO L175 Difference]: Start difference. First operand has 197 places, 111 transitions, 852 flow. Second operand 11 states and 121 transitions. [2024-06-03 21:31:09,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 125 transitions, 1152 flow [2024-06-03 21:31:09,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 125 transitions, 1116 flow, removed 7 selfloop flow, removed 12 redundant places. [2024-06-03 21:31:09,884 INFO L231 Difference]: Finished difference. Result has 188 places, 106 transitions, 809 flow [2024-06-03 21:31:09,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=809, PETRI_PLACES=188, PETRI_TRANSITIONS=106} [2024-06-03 21:31:09,884 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 158 predicate places. [2024-06-03 21:31:09,884 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 106 transitions, 809 flow [2024-06-03 21:31:09,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:09,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:09,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:09,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-03 21:31:09,885 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:31:09,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:09,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1627928286, now seen corresponding path program 15 times [2024-06-03 21:31:09,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:09,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75429976] [2024-06-03 21:31:09,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:09,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:15,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-03 21:31:15,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:15,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75429976] [2024-06-03 21:31:15,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75429976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:15,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:15,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:31:15,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901976636] [2024-06-03 21:31:15,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:15,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:31:15,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:15,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:31:15,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:31:15,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:31:15,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 106 transitions, 809 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:15,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:15,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:31:15,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:15,670 INFO L124 PetriNetUnfolderBase]: 265/578 cut-off events. [2024-06-03 21:31:15,670 INFO L125 PetriNetUnfolderBase]: For 34151/34151 co-relation queries the response was YES. [2024-06-03 21:31:15,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3112 conditions, 578 events. 265/578 cut-off events. For 34151/34151 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2981 event pairs, 69 based on Foata normal form. 8/586 useless extension candidates. Maximal degree in co-relation 3035. Up to 386 conditions per place. [2024-06-03 21:31:15,674 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 69 selfloop transitions, 34 changer transitions 14/120 dead transitions. [2024-06-03 21:31:15,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 120 transitions, 1111 flow [2024-06-03 21:31:15,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:31:15,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:31:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-03 21:31:15,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39296187683284456 [2024-06-03 21:31:15,676 INFO L175 Difference]: Start difference. First operand has 188 places, 106 transitions, 809 flow. Second operand 11 states and 134 transitions. [2024-06-03 21:31:15,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 120 transitions, 1111 flow [2024-06-03 21:31:15,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 120 transitions, 1074 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-03 21:31:15,744 INFO L231 Difference]: Finished difference. Result has 179 places, 100 transitions, 807 flow [2024-06-03 21:31:15,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=807, PETRI_PLACES=179, PETRI_TRANSITIONS=100} [2024-06-03 21:31:15,744 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2024-06-03 21:31:15,744 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 100 transitions, 807 flow [2024-06-03 21:31:15,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:15,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:15,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:15,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-03 21:31:15,745 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:31:15,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:15,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1634184396, now seen corresponding path program 16 times [2024-06-03 21:31:15,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:15,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768008771] [2024-06-03 21:31:15,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:15,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:23,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-03 21:31:23,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768008771] [2024-06-03 21:31:23,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768008771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:23,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:23,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:31:23,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663245995] [2024-06-03 21:31:23,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:23,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:31:23,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:23,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:31:23,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:31:23,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:31:23,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 100 transitions, 807 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:23,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:23,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:31:23,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:24,251 INFO L124 PetriNetUnfolderBase]: 253/562 cut-off events. [2024-06-03 21:31:24,251 INFO L125 PetriNetUnfolderBase]: For 30381/30381 co-relation queries the response was YES. [2024-06-03 21:31:24,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2985 conditions, 562 events. 253/562 cut-off events. For 30381/30381 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2885 event pairs, 71 based on Foata normal form. 8/570 useless extension candidates. Maximal degree in co-relation 2912. Up to 376 conditions per place. [2024-06-03 21:31:24,255 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 71 selfloop transitions, 32 changer transitions 8/114 dead transitions. [2024-06-03 21:31:24,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 114 transitions, 1093 flow [2024-06-03 21:31:24,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:31:24,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:31:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-03 21:31:24,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 21:31:24,256 INFO L175 Difference]: Start difference. First operand has 179 places, 100 transitions, 807 flow. Second operand 11 states and 132 transitions. [2024-06-03 21:31:24,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 114 transitions, 1093 flow [2024-06-03 21:31:24,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 114 transitions, 990 flow, removed 6 selfloop flow, removed 15 redundant places. [2024-06-03 21:31:24,312 INFO L231 Difference]: Finished difference. Result has 171 places, 97 transitions, 762 flow [2024-06-03 21:31:24,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=762, PETRI_PLACES=171, PETRI_TRANSITIONS=97} [2024-06-03 21:31:24,312 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 141 predicate places. [2024-06-03 21:31:24,313 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 97 transitions, 762 flow [2024-06-03 21:31:24,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:24,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:24,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:24,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-06-03 21:31:24,313 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:31:24,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:24,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1634423406, now seen corresponding path program 17 times [2024-06-03 21:31:24,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:24,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432386215] [2024-06-03 21:31:24,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:24,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:29,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:31:29,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:29,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432386215] [2024-06-03 21:31:29,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432386215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:29,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:29,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:31:29,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440772364] [2024-06-03 21:31:29,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:29,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:31:29,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:29,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:31:29,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:31:30,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:31:30,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 97 transitions, 762 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:30,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:30,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:31:30,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:30,435 INFO L124 PetriNetUnfolderBase]: 237/533 cut-off events. [2024-06-03 21:31:30,435 INFO L125 PetriNetUnfolderBase]: For 24751/24751 co-relation queries the response was YES. [2024-06-03 21:31:30,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 533 events. 237/533 cut-off events. For 24751/24751 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2689 event pairs, 67 based on Foata normal form. 6/539 useless extension candidates. Maximal degree in co-relation 2603. Up to 348 conditions per place. [2024-06-03 21:31:30,438 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 65 selfloop transitions, 30 changer transitions 10/108 dead transitions. [2024-06-03 21:31:30,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 108 transitions, 994 flow [2024-06-03 21:31:30,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:31:30,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:31:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-03 21:31:30,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-03 21:31:30,439 INFO L175 Difference]: Start difference. First operand has 171 places, 97 transitions, 762 flow. Second operand 11 states and 124 transitions. [2024-06-03 21:31:30,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 108 transitions, 994 flow [2024-06-03 21:31:30,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 108 transitions, 918 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-03 21:31:30,483 INFO L231 Difference]: Finished difference. Result has 169 places, 93 transitions, 713 flow [2024-06-03 21:31:30,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=713, PETRI_PLACES=169, PETRI_TRANSITIONS=93} [2024-06-03 21:31:30,483 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 139 predicate places. [2024-06-03 21:31:30,484 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 93 transitions, 713 flow [2024-06-03 21:31:30,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:30,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:30,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:30,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-06-03 21:31:30,484 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:31:30,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:30,484 INFO L85 PathProgramCache]: Analyzing trace with hash -495555720, now seen corresponding path program 1 times [2024-06-03 21:31:30,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:30,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323629002] [2024-06-03 21:31:30,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:30,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:31:37,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:37,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323629002] [2024-06-03 21:31:37,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323629002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:37,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:37,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:31:37,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547402896] [2024-06-03 21:31:37,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:37,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:31:37,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:37,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:31:37,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:31:38,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:31:38,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 93 transitions, 713 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:38,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:38,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:31:38,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:38,641 INFO L124 PetriNetUnfolderBase]: 230/517 cut-off events. [2024-06-03 21:31:38,641 INFO L125 PetriNetUnfolderBase]: For 24265/24265 co-relation queries the response was YES. [2024-06-03 21:31:38,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2550 conditions, 517 events. 230/517 cut-off events. For 24265/24265 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2590 event pairs, 61 based on Foata normal form. 6/523 useless extension candidates. Maximal degree in co-relation 2479. Up to 418 conditions per place. [2024-06-03 21:31:38,644 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 82 selfloop transitions, 15 changer transitions 11/111 dead transitions. [2024-06-03 21:31:38,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 111 transitions, 977 flow [2024-06-03 21:31:38,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:31:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:31:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2024-06-03 21:31:38,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3682795698924731 [2024-06-03 21:31:38,645 INFO L175 Difference]: Start difference. First operand has 169 places, 93 transitions, 713 flow. Second operand 12 states and 137 transitions. [2024-06-03 21:31:38,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 111 transitions, 977 flow [2024-06-03 21:31:38,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 111 transitions, 878 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-03 21:31:38,684 INFO L231 Difference]: Finished difference. Result has 165 places, 90 transitions, 626 flow [2024-06-03 21:31:38,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=626, PETRI_PLACES=165, PETRI_TRANSITIONS=90} [2024-06-03 21:31:38,684 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places. [2024-06-03 21:31:38,685 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 90 transitions, 626 flow [2024-06-03 21:31:38,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:38,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:38,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:38,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2024-06-03 21:31:38,685 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:31:38,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:38,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1364641024, now seen corresponding path program 2 times [2024-06-03 21:31:38,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:38,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688291609] [2024-06-03 21:31:38,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:38,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:31:44,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:44,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688291609] [2024-06-03 21:31:44,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688291609] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:44,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:44,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:31:44,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324294852] [2024-06-03 21:31:44,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:44,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:31:44,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:44,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:31:44,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:31:44,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:31:44,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 90 transitions, 626 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:44,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:44,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:31:44,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:45,057 INFO L124 PetriNetUnfolderBase]: 223/504 cut-off events. [2024-06-03 21:31:45,058 INFO L125 PetriNetUnfolderBase]: For 23099/23099 co-relation queries the response was YES. [2024-06-03 21:31:45,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2366 conditions, 504 events. 223/504 cut-off events. For 23099/23099 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2493 event pairs, 57 based on Foata normal form. 6/510 useless extension candidates. Maximal degree in co-relation 2298. Up to 396 conditions per place. [2024-06-03 21:31:45,061 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 79 selfloop transitions, 10 changer transitions 16/108 dead transitions. [2024-06-03 21:31:45,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 108 transitions, 880 flow [2024-06-03 21:31:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:31:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:31:45,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 133 transitions. [2024-06-03 21:31:45,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3575268817204301 [2024-06-03 21:31:45,061 INFO L175 Difference]: Start difference. First operand has 165 places, 90 transitions, 626 flow. Second operand 12 states and 133 transitions. [2024-06-03 21:31:45,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 108 transitions, 880 flow [2024-06-03 21:31:45,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 108 transitions, 844 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 21:31:45,099 INFO L231 Difference]: Finished difference. Result has 163 places, 85 transitions, 566 flow [2024-06-03 21:31:45,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=566, PETRI_PLACES=163, PETRI_TRANSITIONS=85} [2024-06-03 21:31:45,100 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 133 predicate places. [2024-06-03 21:31:45,100 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 85 transitions, 566 flow [2024-06-03 21:31:45,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:45,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:45,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:45,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-06-03 21:31:45,100 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:31:45,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:45,100 INFO L85 PathProgramCache]: Analyzing trace with hash -364258070, now seen corresponding path program 3 times [2024-06-03 21:31:45,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:45,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348444655] [2024-06-03 21:31:45,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:45,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:31:53,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:53,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348444655] [2024-06-03 21:31:53,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348444655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:53,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:53,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:31:53,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048748635] [2024-06-03 21:31:53,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:53,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:31:53,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:53,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:31:53,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:31:53,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:31:53,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 85 transitions, 566 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:53,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:53,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:31:53,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:54,329 INFO L124 PetriNetUnfolderBase]: 208/473 cut-off events. [2024-06-03 21:31:54,329 INFO L125 PetriNetUnfolderBase]: For 23053/23053 co-relation queries the response was YES. [2024-06-03 21:31:54,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2227 conditions, 473 events. 208/473 cut-off events. For 23053/23053 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2293 event pairs, 53 based on Foata normal form. 6/479 useless extension candidates. Maximal degree in co-relation 2159. Up to 368 conditions per place. [2024-06-03 21:31:54,332 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 77 selfloop transitions, 13 changer transitions 11/104 dead transitions. [2024-06-03 21:31:54,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 104 transitions, 816 flow [2024-06-03 21:31:54,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:31:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:31:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 136 transitions. [2024-06-03 21:31:54,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-03 21:31:54,333 INFO L175 Difference]: Start difference. First operand has 163 places, 85 transitions, 566 flow. Second operand 12 states and 136 transitions. [2024-06-03 21:31:54,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 104 transitions, 816 flow [2024-06-03 21:31:54,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 104 transitions, 782 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-03 21:31:54,369 INFO L231 Difference]: Finished difference. Result has 156 places, 81 transitions, 527 flow [2024-06-03 21:31:54,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=527, PETRI_PLACES=156, PETRI_TRANSITIONS=81} [2024-06-03 21:31:54,370 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2024-06-03 21:31:54,370 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 81 transitions, 527 flow [2024-06-03 21:31:54,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:54,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:54,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:54,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2024-06-03 21:31:54,370 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:31:54,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:54,370 INFO L85 PathProgramCache]: Analyzing trace with hash -164812130, now seen corresponding path program 4 times [2024-06-03 21:31:54,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:54,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341633755] [2024-06-03 21:31:54,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:54,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:32:01,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:32:01,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:32:01,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341633755] [2024-06-03 21:32:01,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341633755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:32:01,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:32:01,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:32:01,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465623941] [2024-06-03 21:32:01,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:32:01,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:32:01,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:32:01,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:32:01,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:32:01,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:32:01,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 81 transitions, 527 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:01,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:32:01,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:32:01,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:32:02,077 INFO L124 PetriNetUnfolderBase]: 182/417 cut-off events. [2024-06-03 21:32:02,077 INFO L125 PetriNetUnfolderBase]: For 16509/16509 co-relation queries the response was YES. [2024-06-03 21:32:02,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 417 events. 182/417 cut-off events. For 16509/16509 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1940 event pairs, 42 based on Foata normal form. 6/423 useless extension candidates. Maximal degree in co-relation 1718. Up to 331 conditions per place. [2024-06-03 21:32:02,079 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 68 selfloop transitions, 6 changer transitions 22/99 dead transitions. [2024-06-03 21:32:02,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 99 transitions, 765 flow [2024-06-03 21:32:02,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:32:02,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:32:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 133 transitions. [2024-06-03 21:32:02,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3575268817204301 [2024-06-03 21:32:02,080 INFO L175 Difference]: Start difference. First operand has 156 places, 81 transitions, 527 flow. Second operand 12 states and 133 transitions. [2024-06-03 21:32:02,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 99 transitions, 765 flow [2024-06-03 21:32:02,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 99 transitions, 727 flow, removed 6 selfloop flow, removed 12 redundant places. [2024-06-03 21:32:02,103 INFO L231 Difference]: Finished difference. Result has 151 places, 73 transitions, 444 flow [2024-06-03 21:32:02,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=444, PETRI_PLACES=151, PETRI_TRANSITIONS=73} [2024-06-03 21:32:02,103 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2024-06-03 21:32:02,103 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 73 transitions, 444 flow [2024-06-03 21:32:02,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:02,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:32:02,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:32:02,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2024-06-03 21:32:02,104 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:32:02,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:32:02,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1471331308, now seen corresponding path program 5 times [2024-06-03 21:32:02,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:32:02,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303460853] [2024-06-03 21:32:02,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:32:02,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:32:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:32:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:32:08,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:32:08,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303460853] [2024-06-03 21:32:08,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303460853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:32:08,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:32:08,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:32:08,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610718569] [2024-06-03 21:32:08,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:32:08,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:32:08,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:32:08,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:32:08,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:32:08,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:32:08,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 73 transitions, 444 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:08,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:32:08,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:32:08,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:32:09,206 INFO L124 PetriNetUnfolderBase]: 170/381 cut-off events. [2024-06-03 21:32:09,206 INFO L125 PetriNetUnfolderBase]: For 15661/15661 co-relation queries the response was YES. [2024-06-03 21:32:09,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1614 conditions, 381 events. 170/381 cut-off events. For 15661/15661 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1717 event pairs, 38 based on Foata normal form. 6/387 useless extension candidates. Maximal degree in co-relation 1551. Up to 294 conditions per place. [2024-06-03 21:32:09,208 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 62 selfloop transitions, 5 changer transitions 17/87 dead transitions. [2024-06-03 21:32:09,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 87 transitions, 648 flow [2024-06-03 21:32:09,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:32:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:32:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-03 21:32:09,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36129032258064514 [2024-06-03 21:32:09,208 INFO L175 Difference]: Start difference. First operand has 151 places, 73 transitions, 444 flow. Second operand 10 states and 112 transitions. [2024-06-03 21:32:09,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 87 transitions, 648 flow [2024-06-03 21:32:09,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 87 transitions, 610 flow, removed 8 selfloop flow, removed 12 redundant places. [2024-06-03 21:32:09,230 INFO L231 Difference]: Finished difference. Result has 135 places, 67 transitions, 390 flow [2024-06-03 21:32:09,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=390, PETRI_PLACES=135, PETRI_TRANSITIONS=67} [2024-06-03 21:32:09,230 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 105 predicate places. [2024-06-03 21:32:09,230 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 67 transitions, 390 flow [2024-06-03 21:32:09,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:09,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:32:09,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:32:09,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2024-06-03 21:32:09,230 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:32:09,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:32:09,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1451249428, now seen corresponding path program 6 times [2024-06-03 21:32:09,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:32:09,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712664896] [2024-06-03 21:32:09,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:32:09,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:32:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:32:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:32:15,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:32:15,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712664896] [2024-06-03 21:32:15,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712664896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:32:15,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:32:15,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:32:15,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569168261] [2024-06-03 21:32:15,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:32:15,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:32:15,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:32:15,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:32:15,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:32:15,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:32:15,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 67 transitions, 390 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:15,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:32:15,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:32:15,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:32:16,259 INFO L124 PetriNetUnfolderBase]: 153/344 cut-off events. [2024-06-03 21:32:16,260 INFO L125 PetriNetUnfolderBase]: For 15629/15629 co-relation queries the response was YES. [2024-06-03 21:32:16,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 344 events. 153/344 cut-off events. For 15629/15629 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1516 event pairs, 38 based on Foata normal form. 6/350 useless extension candidates. Maximal degree in co-relation 1420. Up to 257 conditions per place. [2024-06-03 21:32:16,262 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 54 selfloop transitions, 13 changer transitions 10/80 dead transitions. [2024-06-03 21:32:16,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 80 transitions, 576 flow [2024-06-03 21:32:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:32:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:32:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-03 21:32:16,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35777126099706746 [2024-06-03 21:32:16,263 INFO L175 Difference]: Start difference. First operand has 135 places, 67 transitions, 390 flow. Second operand 11 states and 122 transitions. [2024-06-03 21:32:16,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 80 transitions, 576 flow [2024-06-03 21:32:16,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 80 transitions, 554 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-03 21:32:16,279 INFO L231 Difference]: Finished difference. Result has 126 places, 64 transitions, 383 flow [2024-06-03 21:32:16,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=383, PETRI_PLACES=126, PETRI_TRANSITIONS=64} [2024-06-03 21:32:16,280 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 96 predicate places. [2024-06-03 21:32:16,280 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 64 transitions, 383 flow [2024-06-03 21:32:16,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:16,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:32:16,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:32:16,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2024-06-03 21:32:16,281 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:32:16,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:32:16,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1207122476, now seen corresponding path program 7 times [2024-06-03 21:32:16,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:32:16,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706694118] [2024-06-03 21:32:16,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:32:16,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:32:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:32:22,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:32:22,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:32:22,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706694118] [2024-06-03 21:32:22,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706694118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:32:22,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:32:22,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 21:32:22,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111409948] [2024-06-03 21:32:22,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:32:22,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 21:32:22,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:32:22,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 21:32:22,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 21:32:22,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 21:32:22,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 64 transitions, 383 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:22,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:32:22,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 21:32:22,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:32:23,219 INFO L124 PetriNetUnfolderBase]: 146/331 cut-off events. [2024-06-03 21:32:23,220 INFO L125 PetriNetUnfolderBase]: For 12188/12190 co-relation queries the response was YES. [2024-06-03 21:32:23,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 331 events. 146/331 cut-off events. For 12188/12190 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1437 event pairs, 34 based on Foata normal form. 8/339 useless extension candidates. Maximal degree in co-relation 1340. Up to 233 conditions per place. [2024-06-03 21:32:23,221 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 53 selfloop transitions, 12 changer transitions 10/78 dead transitions. [2024-06-03 21:32:23,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 78 transitions, 567 flow [2024-06-03 21:32:23,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:32:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:32:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-03 21:32:23,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36070381231671556 [2024-06-03 21:32:23,222 INFO L175 Difference]: Start difference. First operand has 126 places, 64 transitions, 383 flow. Second operand 11 states and 123 transitions. [2024-06-03 21:32:23,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 78 transitions, 567 flow [2024-06-03 21:32:23,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 78 transitions, 535 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 21:32:23,236 INFO L231 Difference]: Finished difference. Result has 122 places, 60 transitions, 358 flow [2024-06-03 21:32:23,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=358, PETRI_PLACES=122, PETRI_TRANSITIONS=60} [2024-06-03 21:32:23,236 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 92 predicate places. [2024-06-03 21:32:23,237 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 60 transitions, 358 flow [2024-06-03 21:32:23,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:32:23,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:32:23,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-03 21:32:23,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2024-06-03 21:32:23,237 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:32:23,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:32:23,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1041815120, now seen corresponding path program 8 times [2024-06-03 21:32:23,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:32:23,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740586311] [2024-06-03 21:32:23,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:32:23,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:32:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15