./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi003_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi003_tso.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 20:33:10,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 20:33:10,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 20:33:10,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 20:33:10,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 20:33:10,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 20:33:10,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 20:33:10,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 20:33:10,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 20:33:10,783 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 20:33:10,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 20:33:10,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 20:33:10,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 20:33:10,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 20:33:10,785 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 20:33:10,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 20:33:10,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 20:33:10,785 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 20:33:10,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 20:33:10,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 20:33:10,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 20:33:10,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 20:33:10,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 20:33:10,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 20:33:10,787 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 20:33:10,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 20:33:10,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 20:33:10,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 20:33:10,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 20:33:10,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 20:33:10,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 20:33:10,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 20:33:10,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:33:10,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 20:33:10,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 20:33:10,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 20:33:10,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 20:33:10,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 20:33:10,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 20:33:10,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 20:33:10,790 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 20:33:10,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 20:33:10,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 20:33:10,791 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 20:33:11,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 20:33:11,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 20:33:11,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 20:33:11,039 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 20:33:11,041 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 20:33:11,042 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/rfi003_tso.yml/witness.yml [2024-06-03 20:33:11,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 20:33:11,215 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 20:33:11,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.i [2024-06-03 20:33:12,195 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 20:33:12,453 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 20:33:12,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_tso.i [2024-06-03 20:33:12,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/438282f0f/111cb97db4df487e9561ed642334b749/FLAGf23ef4649 [2024-06-03 20:33:12,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/438282f0f/111cb97db4df487e9561ed642334b749 [2024-06-03 20:33:12,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 20:33:12,483 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 20:33:12,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 20:33:12,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 20:33:12,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 20:33:12,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:33:11" (1/2) ... [2024-06-03 20:33:12,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@601868d5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:33:12, skipping insertion in model container [2024-06-03 20:33:12,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:33:11" (1/2) ... [2024-06-03 20:33:12,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7487bbe2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:33:12, skipping insertion in model container [2024-06-03 20:33:12,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:33:12" (2/2) ... [2024-06-03 20:33:12,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@601868d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:33:12, skipping insertion in model container [2024-06-03 20:33:12,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:33:12" (2/2) ... [2024-06-03 20:33:12,493 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 20:33:12,550 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 20:33:12,552 INFO L97 edCorrectnessWitness]: Location invariant before [L838-L838] ((((((((((((((((! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x <= 1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 20:33:12,552 INFO L97 edCorrectnessWitness]: Location invariant before [L839-L839] ((((((((((((((((! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x <= 1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 20:33:12,581 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 20:33:12,581 INFO L106 edCorrectnessWitness]: ghost_update [L836-L836] multithreaded = 1; [2024-06-03 20:33:12,618 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 20:33:12,923 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:33:12,933 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 20:33:13,179 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:33:13,206 INFO L206 MainTranslator]: Completed translation [2024-06-03 20:33:13,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:33:13 WrapperNode [2024-06-03 20:33:13,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 20:33:13,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 20:33:13,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 20:33:13,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 20:33:13,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:33:13" (1/1) ... [2024-06-03 20:33:13,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:33:13" (1/1) ... [2024-06-03 20:33:13,298 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 177 [2024-06-03 20:33:13,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 20:33:13,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 20:33:13,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 20:33:13,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 20:33:13,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:33:13" (1/1) ... [2024-06-03 20:33:13,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:33:13" (1/1) ... [2024-06-03 20:33:13,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:33:13" (1/1) ... [2024-06-03 20:33:13,371 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 20:33:13,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:33:13" (1/1) ... [2024-06-03 20:33:13,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:33:13" (1/1) ... [2024-06-03 20:33:13,401 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:33:13" (1/1) ... [2024-06-03 20:33:13,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:33:13" (1/1) ... [2024-06-03 20:33:13,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:33:13" (1/1) ... [2024-06-03 20:33:13,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:33:13" (1/1) ... [2024-06-03 20:33:13,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 20:33:13,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 20:33:13,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 20:33:13,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 20:33:13,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:33:13" (1/1) ... [2024-06-03 20:33:13,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:33:13,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 20:33:13,462 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 20:33:13,472 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 20:33:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 20:33:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 20:33:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 20:33:13,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 20:33:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 20:33:13,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 20:33:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 20:33:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 20:33:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 20:33:13,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 20:33:13,497 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 20:33:13,619 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 20:33:13,621 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 20:33:14,275 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 20:33:14,275 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 20:33:14,475 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 20:33:14,475 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 20:33:14,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:33:14 BoogieIcfgContainer [2024-06-03 20:33:14,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 20:33:14,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 20:33:14,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 20:33:14,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 20:33:14,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:33:11" (1/4) ... [2024-06-03 20:33:14,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3229baff and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:33:14, skipping insertion in model container [2024-06-03 20:33:14,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 08:33:12" (2/4) ... [2024-06-03 20:33:14,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3229baff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:33:14, skipping insertion in model container [2024-06-03 20:33:14,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:33:13" (3/4) ... [2024-06-03 20:33:14,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3229baff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:33:14, skipping insertion in model container [2024-06-03 20:33:14,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:33:14" (4/4) ... [2024-06-03 20:33:14,488 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_tso.i [2024-06-03 20:33:14,501 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 20:33:14,501 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 20:33:14,501 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 20:33:14,564 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 20:33:14,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 74 flow [2024-06-03 20:33:14,621 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-06-03 20:33:14,622 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:33:14,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 20:33:14,623 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 33 transitions, 74 flow [2024-06-03 20:33:14,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 56 flow [2024-06-03 20:33:14,672 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 20:33:14,677 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;@77ead79c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 20:33:14,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 20:33:14,682 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 20:33:14,683 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 20:33:14,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:33:14,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:33:14,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 20:33:14,684 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 20:33:14,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:33:14,688 INFO L85 PathProgramCache]: Analyzing trace with hash -175134480, now seen corresponding path program 1 times [2024-06-03 20:33:14,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:33:14,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452674299] [2024-06-03 20:33:14,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:33:14,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:33:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:33:17,785 INFO 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 20:33:17,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:33:17,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452674299] [2024-06-03 20:33:17,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452674299] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:33:17,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:33:17,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 20:33:17,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198469050] [2024-06-03 20:33:17,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:33:17,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 20:33:17,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:33:17,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 20:33:17,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 20:33:17,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 20:33:17,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:17,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:33:17,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 20:33:17,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:33:18,093 INFO L124 PetriNetUnfolderBase]: 216/392 cut-off events. [2024-06-03 20:33:18,094 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-03 20:33:18,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 392 events. 216/392 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1458 event pairs, 133 based on Foata normal form. 1/387 useless extension candidates. Maximal degree in co-relation 781. Up to 378 conditions per place. [2024-06-03 20:33:18,099 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 25 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-06-03 20:33:18,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 127 flow [2024-06-03 20:33:18,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 20:33:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 20:33:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2024-06-03 20:33:18,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2024-06-03 20:33:18,110 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 3 states and 51 transitions. [2024-06-03 20:33:18,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 127 flow [2024-06-03 20:33:18,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 20:33:18,113 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 75 flow [2024-06-03 20:33:18,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-06-03 20:33:18,118 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-06-03 20:33:18,118 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 75 flow [2024-06-03 20:33:18,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:18,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:33:18,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:33:18,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 20:33:18,119 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 20:33:18,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:33:18,120 INFO L85 PathProgramCache]: Analyzing trace with hash -800495793, now seen corresponding path program 1 times [2024-06-03 20:33:18,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:33:18,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393143649] [2024-06-03 20:33:18,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:33:18,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:33:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:33:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:33:19,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:33:19,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393143649] [2024-06-03 20:33:19,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393143649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:33:19,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:33:19,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 20:33:19,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257238604] [2024-06-03 20:33:19,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:33:19,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 20:33:19,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:33:19,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 20:33:19,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 20:33:19,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 20:33:19,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:19,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:33:19,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 20:33:19,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:33:20,202 INFO L124 PetriNetUnfolderBase]: 207/377 cut-off events. [2024-06-03 20:33:20,202 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-06-03 20:33:20,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 377 events. 207/377 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1414 event pairs, 76 based on Foata normal form. 6/383 useless extension candidates. Maximal degree in co-relation 844. Up to 336 conditions per place. [2024-06-03 20:33:20,205 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 31 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2024-06-03 20:33:20,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 177 flow [2024-06-03 20:33:20,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 20:33:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 20:33:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2024-06-03 20:33:20,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-03 20:33:20,207 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 75 flow. Second operand 4 states and 66 transitions. [2024-06-03 20:33:20,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 177 flow [2024-06-03 20:33:20,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 20:33:20,209 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 99 flow [2024-06-03 20:33:20,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-06-03 20:33:20,210 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-06-03 20:33:20,210 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 99 flow [2024-06-03 20:33:20,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:20,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:33:20,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:33:20,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 20:33:20,211 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 20:33:20,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:33:20,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1926644317, now seen corresponding path program 1 times [2024-06-03 20:33:20,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:33:20,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328712154] [2024-06-03 20:33:20,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:33:20,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:33:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:33:24,322 INFO 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 20:33:24,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:33:24,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328712154] [2024-06-03 20:33:24,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328712154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:33:24,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:33:24,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:33:24,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655786993] [2024-06-03 20:33:24,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:33:24,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:33:24,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:33:24,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:33:24,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:33:24,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:33:24,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:24,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:33:24,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:33:24,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:33:24,758 INFO L124 PetriNetUnfolderBase]: 243/433 cut-off events. [2024-06-03 20:33:24,758 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2024-06-03 20:33:24,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 433 events. 243/433 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1576 event pairs, 144 based on Foata normal form. 1/434 useless extension candidates. Maximal degree in co-relation 1075. Up to 421 conditions per place. [2024-06-03 20:33:24,763 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 28 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2024-06-03 20:33:24,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 185 flow [2024-06-03 20:33:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:33:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:33:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2024-06-03 20:33:24,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2024-06-03 20:33:24,767 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 99 flow. Second operand 5 states and 58 transitions. [2024-06-03 20:33:24,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 185 flow [2024-06-03 20:33:24,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 176 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 20:33:24,770 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 117 flow [2024-06-03 20:33:24,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-03 20:33:24,771 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2024-06-03 20:33:24,771 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 117 flow [2024-06-03 20:33:24,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:24,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:33:24,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:33:24,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 20:33:24,774 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 20:33:24,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:33:24,775 INFO L85 PathProgramCache]: Analyzing trace with hash 881829901, now seen corresponding path program 1 times [2024-06-03 20:33:24,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:33:24,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194285051] [2024-06-03 20:33:24,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:33:24,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:33:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:33:27,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:33:27,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:33:27,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194285051] [2024-06-03 20:33:27,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194285051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:33:27,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:33:27,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:33:27,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076035656] [2024-06-03 20:33:27,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:33:27,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:33:27,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:33:27,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:33:27,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:33:28,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-03 20:33:28,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 117 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:28,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:33:28,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-03 20:33:28,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:33:28,325 INFO L124 PetriNetUnfolderBase]: 239/425 cut-off events. [2024-06-03 20:33:28,325 INFO L125 PetriNetUnfolderBase]: For 374/374 co-relation queries the response was YES. [2024-06-03 20:33:28,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 425 events. 239/425 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1475 event pairs, 41 based on Foata normal form. 4/429 useless extension candidates. Maximal degree in co-relation 1123. Up to 362 conditions per place. [2024-06-03 20:33:28,328 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2024-06-03 20:33:28,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 247 flow [2024-06-03 20:33:28,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:33:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:33:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2024-06-03 20:33:28,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-03 20:33:28,333 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 117 flow. Second operand 6 states and 82 transitions. [2024-06-03 20:33:28,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 247 flow [2024-06-03 20:33:28,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 236 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 20:33:28,336 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 131 flow [2024-06-03 20:33:28,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2024-06-03 20:33:28,337 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2024-06-03 20:33:28,337 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 131 flow [2024-06-03 20:33:28,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:28,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:33:28,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:33:28,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 20:33:28,338 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 20:33:28,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:33:28,339 INFO L85 PathProgramCache]: Analyzing trace with hash 427699862, now seen corresponding path program 1 times [2024-06-03 20:33:28,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:33:28,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006003536] [2024-06-03 20:33:28,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:33:28,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:33:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:33:31,401 INFO 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 20:33:31,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:33:31,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006003536] [2024-06-03 20:33:31,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006003536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:33:31,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:33:31,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:33:31,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661810164] [2024-06-03 20:33:31,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:33:31,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:33:31,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:33:31,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:33:31,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:33:31,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:33:31,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 131 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:31,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:33:31,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:33:31,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:33:31,830 INFO L124 PetriNetUnfolderBase]: 237/422 cut-off events. [2024-06-03 20:33:31,830 INFO L125 PetriNetUnfolderBase]: For 600/600 co-relation queries the response was YES. [2024-06-03 20:33:31,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 422 events. 237/422 cut-off events. For 600/600 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1485 event pairs, 103 based on Foata normal form. 1/423 useless extension candidates. Maximal degree in co-relation 1211. Up to 407 conditions per place. [2024-06-03 20:33:31,834 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 30 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2024-06-03 20:33:31,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 229 flow [2024-06-03 20:33:31,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:33:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:33:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2024-06-03 20:33:31,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3282828282828283 [2024-06-03 20:33:31,836 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 131 flow. Second operand 6 states and 65 transitions. [2024-06-03 20:33:31,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 229 flow [2024-06-03 20:33:31,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 213 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 20:33:31,841 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 148 flow [2024-06-03 20:33:31,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-06-03 20:33:31,844 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2024-06-03 20:33:31,846 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 148 flow [2024-06-03 20:33:31,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:31,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:33:31,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:33:31,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 20:33:31,853 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 20:33:31,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:33:31,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1889463618, now seen corresponding path program 1 times [2024-06-03 20:33:31,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:33:31,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144889548] [2024-06-03 20:33:31,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:33:31,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:33:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:33:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:33:35,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:33:35,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144889548] [2024-06-03 20:33:35,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144889548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:33:35,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:33:35,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:33:35,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070414683] [2024-06-03 20:33:35,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:33:35,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:33:35,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:33:35,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:33:35,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:33:35,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:33:35,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 148 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:35,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:33:35,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:33:35,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:33:36,148 INFO L124 PetriNetUnfolderBase]: 243/432 cut-off events. [2024-06-03 20:33:36,148 INFO L125 PetriNetUnfolderBase]: For 830/830 co-relation queries the response was YES. [2024-06-03 20:33:36,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 432 events. 243/432 cut-off events. For 830/830 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1534 event pairs, 82 based on Foata normal form. 2/434 useless extension candidates. Maximal degree in co-relation 1309. Up to 385 conditions per place. [2024-06-03 20:33:36,150 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 37 selfloop transitions, 11 changer transitions 0/50 dead transitions. [2024-06-03 20:33:36,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 298 flow [2024-06-03 20:33:36,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:33:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:33:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2024-06-03 20:33:36,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3686868686868687 [2024-06-03 20:33:36,153 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 148 flow. Second operand 6 states and 73 transitions. [2024-06-03 20:33:36,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 298 flow [2024-06-03 20:33:36,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 281 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 20:33:36,155 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 178 flow [2024-06-03 20:33:36,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-06-03 20:33:36,155 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2024-06-03 20:33:36,155 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 178 flow [2024-06-03 20:33:36,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:36,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:33:36,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:33:36,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 20:33:36,156 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 20:33:36,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:33:36,157 INFO L85 PathProgramCache]: Analyzing trace with hash 399386812, now seen corresponding path program 2 times [2024-06-03 20:33:36,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:33:36,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133764369] [2024-06-03 20:33:36,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:33:36,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:33:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:33:39,808 INFO 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 20:33:39,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:33:39,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133764369] [2024-06-03 20:33:39,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133764369] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:33:39,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:33:39,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:33:39,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264514677] [2024-06-03 20:33:39,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:33:39,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:33:39,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:33:39,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:33:39,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:33:39,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:33:39,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 178 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:39,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:33:39,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:33:39,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:33:40,164 INFO L124 PetriNetUnfolderBase]: 239/428 cut-off events. [2024-06-03 20:33:40,164 INFO L125 PetriNetUnfolderBase]: For 1132/1134 co-relation queries the response was YES. [2024-06-03 20:33:40,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 428 events. 239/428 cut-off events. For 1132/1134 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1518 event pairs, 88 based on Foata normal form. 4/432 useless extension candidates. Maximal degree in co-relation 1380. Up to 382 conditions per place. [2024-06-03 20:33:40,167 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 34 selfloop transitions, 11 changer transitions 0/47 dead transitions. [2024-06-03 20:33:40,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 47 transitions, 288 flow [2024-06-03 20:33:40,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:33:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:33:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-06-03 20:33:40,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35353535353535354 [2024-06-03 20:33:40,169 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 178 flow. Second operand 6 states and 70 transitions. [2024-06-03 20:33:40,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 47 transitions, 288 flow [2024-06-03 20:33:40,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 47 transitions, 274 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-03 20:33:40,171 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 191 flow [2024-06-03 20:33:40,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2024-06-03 20:33:40,172 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2024-06-03 20:33:40,172 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 191 flow [2024-06-03 20:33:40,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:40,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:33:40,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:33:40,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 20:33:40,173 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 20:33:40,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:33:40,174 INFO L85 PathProgramCache]: Analyzing trace with hash 373794700, now seen corresponding path program 1 times [2024-06-03 20:33:40,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:33:40,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043918467] [2024-06-03 20:33:40,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:33:40,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:33:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:33:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:33:43,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:33:43,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043918467] [2024-06-03 20:33:43,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043918467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:33:43,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:33:43,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:33:43,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373757300] [2024-06-03 20:33:43,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:33:43,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:33:43,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:33:43,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:33:43,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:33:43,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:33:43,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 191 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:43,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:33:43,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:33:43,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:33:43,889 INFO L124 PetriNetUnfolderBase]: 237/423 cut-off events. [2024-06-03 20:33:43,889 INFO L125 PetriNetUnfolderBase]: For 1357/1357 co-relation queries the response was YES. [2024-06-03 20:33:43,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 423 events. 237/423 cut-off events. For 1357/1357 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1495 event pairs, 99 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 1412. Up to 405 conditions per place. [2024-06-03 20:33:43,892 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 35 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2024-06-03 20:33:43,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 307 flow [2024-06-03 20:33:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:33:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:33:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2024-06-03 20:33:43,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31601731601731603 [2024-06-03 20:33:43,893 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 191 flow. Second operand 7 states and 73 transitions. [2024-06-03 20:33:43,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 307 flow [2024-06-03 20:33:43,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 47 transitions, 277 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-03 20:33:43,895 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 200 flow [2024-06-03 20:33:43,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=200, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2024-06-03 20:33:43,896 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2024-06-03 20:33:43,897 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 200 flow [2024-06-03 20:33:43,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:43,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:33:43,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:33:43,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 20:33:43,897 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 20:33:43,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:33:43,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1075995905, now seen corresponding path program 1 times [2024-06-03 20:33:43,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:33:43,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444572229] [2024-06-03 20:33:43,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:33:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:33:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:33:46,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:33:46,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:33:46,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444572229] [2024-06-03 20:33:46,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444572229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:33:46,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:33:46,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:33:46,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278331227] [2024-06-03 20:33:46,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:33:46,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:33:46,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:33:46,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:33:46,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:33:46,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:33:46,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 200 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:46,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:33:46,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:33:46,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:33:46,947 INFO L124 PetriNetUnfolderBase]: 243/434 cut-off events. [2024-06-03 20:33:46,948 INFO L125 PetriNetUnfolderBase]: For 1687/1689 co-relation queries the response was YES. [2024-06-03 20:33:46,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 434 events. 243/434 cut-off events. For 1687/1689 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1535 event pairs, 85 based on Foata normal form. 4/438 useless extension candidates. Maximal degree in co-relation 1493. Up to 383 conditions per place. [2024-06-03 20:33:46,950 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 39 selfloop transitions, 17 changer transitions 0/58 dead transitions. [2024-06-03 20:33:46,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 366 flow [2024-06-03 20:33:46,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:33:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:33:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-03 20:33:46,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3463203463203463 [2024-06-03 20:33:46,951 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 200 flow. Second operand 7 states and 80 transitions. [2024-06-03 20:33:46,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 366 flow [2024-06-03 20:33:46,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 343 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 20:33:46,955 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 262 flow [2024-06-03 20:33:46,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-06-03 20:33:46,956 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2024-06-03 20:33:46,956 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 262 flow [2024-06-03 20:33:46,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:46,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:33:46,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:33:46,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 20:33:46,957 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 20:33:46,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:33:46,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1960148395, now seen corresponding path program 2 times [2024-06-03 20:33:46,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:33:46,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738393819] [2024-06-03 20:33:46,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:33:46,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:33:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:33:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:33:50,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:33:50,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738393819] [2024-06-03 20:33:50,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738393819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:33:50,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:33:50,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:33:50,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724682124] [2024-06-03 20:33:50,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:33:50,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:33:50,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:33:50,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:33:50,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:33:50,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:33:50,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 262 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:50,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:33:50,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:33:50,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:33:50,517 INFO L124 PetriNetUnfolderBase]: 249/445 cut-off events. [2024-06-03 20:33:50,518 INFO L125 PetriNetUnfolderBase]: For 2179/2181 co-relation queries the response was YES. [2024-06-03 20:33:50,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1721 conditions, 445 events. 249/445 cut-off events. For 2179/2181 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1606 event pairs, 81 based on Foata normal form. 4/449 useless extension candidates. Maximal degree in co-relation 1693. Up to 371 conditions per place. [2024-06-03 20:33:50,521 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 39 selfloop transitions, 21 changer transitions 0/62 dead transitions. [2024-06-03 20:33:50,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 62 transitions, 459 flow [2024-06-03 20:33:50,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:33:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:33:50,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2024-06-03 20:33:50,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35064935064935066 [2024-06-03 20:33:50,522 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 262 flow. Second operand 7 states and 81 transitions. [2024-06-03 20:33:50,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 62 transitions, 459 flow [2024-06-03 20:33:50,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 62 transitions, 443 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-03 20:33:50,524 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 321 flow [2024-06-03 20:33:50,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=321, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-06-03 20:33:50,525 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2024-06-03 20:33:50,525 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 321 flow [2024-06-03 20:33:50,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:50,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:33:50,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:33:50,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 20:33:50,526 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 20:33:50,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:33:50,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1297542121, now seen corresponding path program 3 times [2024-06-03 20:33:50,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:33:50,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024398561] [2024-06-03 20:33:50,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:33:50,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:33:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:33:53,412 INFO 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 20:33:53,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:33:53,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024398561] [2024-06-03 20:33:53,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024398561] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:33:53,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:33:53,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:33:53,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94121198] [2024-06-03 20:33:53,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:33:53,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:33:53,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:33:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:33:53,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:33:53,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:33:53,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 321 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:53,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:33:53,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:33:53,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:33:53,817 INFO L124 PetriNetUnfolderBase]: 250/447 cut-off events. [2024-06-03 20:33:53,817 INFO L125 PetriNetUnfolderBase]: For 2696/2698 co-relation queries the response was YES. [2024-06-03 20:33:53,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1822 conditions, 447 events. 250/447 cut-off events. For 2696/2698 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1599 event pairs, 86 based on Foata normal form. 4/451 useless extension candidates. Maximal degree in co-relation 1792. Up to 395 conditions per place. [2024-06-03 20:33:53,820 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 43 selfloop transitions, 17 changer transitions 0/62 dead transitions. [2024-06-03 20:33:53,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 484 flow [2024-06-03 20:33:53,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:33:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:33:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-03 20:33:53,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33766233766233766 [2024-06-03 20:33:53,821 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 321 flow. Second operand 7 states and 78 transitions. [2024-06-03 20:33:53,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 484 flow [2024-06-03 20:33:53,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 455 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-03 20:33:53,824 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 361 flow [2024-06-03 20:33:53,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=361, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-06-03 20:33:53,825 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2024-06-03 20:33:53,825 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 361 flow [2024-06-03 20:33:53,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:53,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:33:53,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:33:53,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 20:33:53,826 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 20:33:53,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:33:53,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1282926175, now seen corresponding path program 1 times [2024-06-03 20:33:53,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:33:53,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31406336] [2024-06-03 20:33:53,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:33:53,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:33:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:33:58,617 INFO 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 20:33:58,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:33:58,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31406336] [2024-06-03 20:33:58,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31406336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:33:58,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:33:58,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:33:58,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375441491] [2024-06-03 20:33:58,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:33:58,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:33:58,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:33:58,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:33:58,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:33:58,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:33:58,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 361 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:58,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:33:58,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:33:58,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:33:59,157 INFO L124 PetriNetUnfolderBase]: 248/442 cut-off events. [2024-06-03 20:33:59,158 INFO L125 PetriNetUnfolderBase]: For 2983/2983 co-relation queries the response was YES. [2024-06-03 20:33:59,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1878 conditions, 442 events. 248/442 cut-off events. For 2983/2983 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1591 event pairs, 77 based on Foata normal form. 1/443 useless extension candidates. Maximal degree in co-relation 1845. Up to 421 conditions per place. [2024-06-03 20:33:59,161 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 50 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2024-06-03 20:33:59,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 64 transitions, 515 flow [2024-06-03 20:33:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:33:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:33:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-06-03 20:33:59,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2024-06-03 20:33:59,162 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 361 flow. Second operand 8 states and 81 transitions. [2024-06-03 20:33:59,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 64 transitions, 515 flow [2024-06-03 20:33:59,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 64 transitions, 492 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-03 20:33:59,166 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 383 flow [2024-06-03 20:33:59,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=383, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2024-06-03 20:33:59,167 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 39 predicate places. [2024-06-03 20:33:59,167 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 383 flow [2024-06-03 20:33:59,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:33:59,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:33:59,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:33:59,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 20:33:59,168 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 20:33:59,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:33:59,168 INFO L85 PathProgramCache]: Analyzing trace with hash 991887517, now seen corresponding path program 1 times [2024-06-03 20:33:59,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:33:59,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339726170] [2024-06-03 20:33:59,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:33:59,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:33:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:34:03,001 INFO 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 20:34:03,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:34:03,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339726170] [2024-06-03 20:34:03,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339726170] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:34:03,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:34:03,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:34:03,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416326628] [2024-06-03 20:34:03,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:34:03,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:34:03,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:34:03,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:34:03,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:34:03,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:34:03,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 383 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:03,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:34:03,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:34:03,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:34:03,524 INFO L124 PetriNetUnfolderBase]: 254/452 cut-off events. [2024-06-03 20:34:03,524 INFO L125 PetriNetUnfolderBase]: For 3484/3484 co-relation queries the response was YES. [2024-06-03 20:34:03,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1972 conditions, 452 events. 254/452 cut-off events. For 3484/3484 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1617 event pairs, 55 based on Foata normal form. 2/454 useless extension candidates. Maximal degree in co-relation 1938. Up to 399 conditions per place. [2024-06-03 20:34:03,527 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 60 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2024-06-03 20:34:03,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 73 transitions, 571 flow [2024-06-03 20:34:03,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:34:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:34:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2024-06-03 20:34:03,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.354978354978355 [2024-06-03 20:34:03,529 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 383 flow. Second operand 7 states and 82 transitions. [2024-06-03 20:34:03,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 73 transitions, 571 flow [2024-06-03 20:34:03,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 73 transitions, 542 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 20:34:03,533 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 395 flow [2024-06-03 20:34:03,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=395, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2024-06-03 20:34:03,534 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 40 predicate places. [2024-06-03 20:34:03,534 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 395 flow [2024-06-03 20:34:03,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:03,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:34:03,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:34:03,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 20:34:03,535 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 20:34:03,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:34:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash 992007673, now seen corresponding path program 1 times [2024-06-03 20:34:03,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:34:03,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17320333] [2024-06-03 20:34:03,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:34:03,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:34:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:34:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:34:07,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:34:07,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17320333] [2024-06-03 20:34:07,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17320333] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:34:07,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:34:07,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:34:07,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938541076] [2024-06-03 20:34:07,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:34:07,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:34:07,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:34:07,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:34:07,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:34:07,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:34:07,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 395 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:07,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:34:07,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:34:07,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:34:07,524 INFO L124 PetriNetUnfolderBase]: 257/457 cut-off events. [2024-06-03 20:34:07,525 INFO L125 PetriNetUnfolderBase]: For 3994/3994 co-relation queries the response was YES. [2024-06-03 20:34:07,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2080 conditions, 457 events. 257/457 cut-off events. For 3994/3994 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1656 event pairs, 75 based on Foata normal form. 1/458 useless extension candidates. Maximal degree in co-relation 2045. Up to 404 conditions per place. [2024-06-03 20:34:07,528 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 51 selfloop transitions, 18 changer transitions 0/71 dead transitions. [2024-06-03 20:34:07,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 71 transitions, 581 flow [2024-06-03 20:34:07,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:34:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:34:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2024-06-03 20:34:07,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35064935064935066 [2024-06-03 20:34:07,529 INFO L175 Difference]: Start difference. First operand has 72 places, 58 transitions, 395 flow. Second operand 7 states and 81 transitions. [2024-06-03 20:34:07,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 71 transitions, 581 flow [2024-06-03 20:34:07,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 556 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 20:34:07,533 INFO L231 Difference]: Finished difference. Result has 74 places, 60 transitions, 436 flow [2024-06-03 20:34:07,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=436, PETRI_PLACES=74, PETRI_TRANSITIONS=60} [2024-06-03 20:34:07,534 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2024-06-03 20:34:07,534 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 60 transitions, 436 flow [2024-06-03 20:34:07,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:07,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:34:07,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:34:07,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 20:34:07,535 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 20:34:07,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:34:07,535 INFO L85 PathProgramCache]: Analyzing trace with hash 992007487, now seen corresponding path program 2 times [2024-06-03 20:34:07,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:34:07,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480092211] [2024-06-03 20:34:07,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:34:07,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:34:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:34:11,267 INFO 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 20:34:11,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:34:11,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480092211] [2024-06-03 20:34:11,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480092211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:34:11,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:34:11,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:34:11,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569858048] [2024-06-03 20:34:11,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:34:11,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:34:11,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:34:11,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:34:11,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:34:11,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:34:11,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 60 transitions, 436 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:11,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:34:11,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:34:11,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:34:11,749 INFO L124 PetriNetUnfolderBase]: 263/467 cut-off events. [2024-06-03 20:34:11,749 INFO L125 PetriNetUnfolderBase]: For 4714/4714 co-relation queries the response was YES. [2024-06-03 20:34:11,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 467 events. 263/467 cut-off events. For 4714/4714 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1681 event pairs, 55 based on Foata normal form. 2/469 useless extension candidates. Maximal degree in co-relation 2142. Up to 382 conditions per place. [2024-06-03 20:34:11,752 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 56 selfloop transitions, 20 changer transitions 0/78 dead transitions. [2024-06-03 20:34:11,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 78 transitions, 676 flow [2024-06-03 20:34:11,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:34:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:34:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-03 20:34:11,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3722943722943723 [2024-06-03 20:34:11,753 INFO L175 Difference]: Start difference. First operand has 74 places, 60 transitions, 436 flow. Second operand 7 states and 86 transitions. [2024-06-03 20:34:11,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 78 transitions, 676 flow [2024-06-03 20:34:11,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 640 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 20:34:11,758 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 477 flow [2024-06-03 20:34:11,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=477, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2024-06-03 20:34:11,759 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2024-06-03 20:34:11,759 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 477 flow [2024-06-03 20:34:11,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:11,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:34:11,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:34:11,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 20:34:11,760 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 20:34:11,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:34:11,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1799378955, now seen corresponding path program 1 times [2024-06-03 20:34:11,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:34:11,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339858671] [2024-06-03 20:34:11,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:34:11,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:34:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:34:15,530 INFO 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 20:34:15,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:34:15,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339858671] [2024-06-03 20:34:15,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339858671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:34:15,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:34:15,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:34:15,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063309379] [2024-06-03 20:34:15,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:34:15,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:34:15,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:34:15,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:34:15,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:34:15,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:34:15,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 477 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:15,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:34:15,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:34:15,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:34:15,983 INFO L124 PetriNetUnfolderBase]: 269/478 cut-off events. [2024-06-03 20:34:15,984 INFO L125 PetriNetUnfolderBase]: For 5473/5475 co-relation queries the response was YES. [2024-06-03 20:34:15,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2297 conditions, 478 events. 269/478 cut-off events. For 5473/5475 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1757 event pairs, 80 based on Foata normal form. 4/482 useless extension candidates. Maximal degree in co-relation 2260. Up to 419 conditions per place. [2024-06-03 20:34:15,987 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 57 selfloop transitions, 20 changer transitions 0/79 dead transitions. [2024-06-03 20:34:15,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 681 flow [2024-06-03 20:34:15,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:34:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:34:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-03 20:34:15,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3371212121212121 [2024-06-03 20:34:15,988 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 477 flow. Second operand 8 states and 89 transitions. [2024-06-03 20:34:15,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 79 transitions, 681 flow [2024-06-03 20:34:15,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 657 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-03 20:34:15,993 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 514 flow [2024-06-03 20:34:15,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=514, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2024-06-03 20:34:15,993 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2024-06-03 20:34:15,994 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 514 flow [2024-06-03 20:34:15,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:15,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:34:15,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:34:15,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 20:34:15,994 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 20:34:15,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:34:15,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1004551139, now seen corresponding path program 2 times [2024-06-03 20:34:15,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:34:15,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997604934] [2024-06-03 20:34:15,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:34:15,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:34:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:34:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:34:19,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:34:19,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997604934] [2024-06-03 20:34:19,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997604934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:34:19,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:34:19,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:34:19,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718659330] [2024-06-03 20:34:19,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:34:19,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:34:19,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:34:19,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:34:19,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:34:19,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:34:19,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 514 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:19,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:34:19,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:34:19,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:34:20,060 INFO L124 PetriNetUnfolderBase]: 275/489 cut-off events. [2024-06-03 20:34:20,060 INFO L125 PetriNetUnfolderBase]: For 6156/6158 co-relation queries the response was YES. [2024-06-03 20:34:20,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2446 conditions, 489 events. 275/489 cut-off events. For 6156/6158 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1791 event pairs, 83 based on Foata normal form. 4/493 useless extension candidates. Maximal degree in co-relation 2407. Up to 429 conditions per place. [2024-06-03 20:34:20,063 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 57 selfloop transitions, 19 changer transitions 0/78 dead transitions. [2024-06-03 20:34:20,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 78 transitions, 712 flow [2024-06-03 20:34:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:34:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:34:20,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-03 20:34:20,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32954545454545453 [2024-06-03 20:34:20,064 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 514 flow. Second operand 8 states and 87 transitions. [2024-06-03 20:34:20,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 78 transitions, 712 flow [2024-06-03 20:34:20,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 78 transitions, 667 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 20:34:20,069 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 532 flow [2024-06-03 20:34:20,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=532, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2024-06-03 20:34:20,070 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 51 predicate places. [2024-06-03 20:34:20,070 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 532 flow [2024-06-03 20:34:20,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:20,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:34:20,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:34:20,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 20:34:20,071 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 20:34:20,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:34:20,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1560528341, now seen corresponding path program 3 times [2024-06-03 20:34:20,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:34:20,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647910724] [2024-06-03 20:34:20,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:34:20,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:34:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:34:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:34:23,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:34:23,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647910724] [2024-06-03 20:34:23,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647910724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:34:23,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:34:23,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:34:23,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375165290] [2024-06-03 20:34:23,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:34:23,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:34:23,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:34:23,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:34:23,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:34:23,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:34:23,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 532 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:23,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:34:23,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:34:23,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:34:23,865 INFO L124 PetriNetUnfolderBase]: 281/497 cut-off events. [2024-06-03 20:34:23,865 INFO L125 PetriNetUnfolderBase]: For 6826/6826 co-relation queries the response was YES. [2024-06-03 20:34:23,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2558 conditions, 497 events. 281/497 cut-off events. For 6826/6826 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1825 event pairs, 77 based on Foata normal form. 2/499 useless extension candidates. Maximal degree in co-relation 2518. Up to 473 conditions per place. [2024-06-03 20:34:23,868 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 65 selfloop transitions, 12 changer transitions 0/79 dead transitions. [2024-06-03 20:34:23,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 79 transitions, 730 flow [2024-06-03 20:34:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:34:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:34:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-03 20:34:23,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3106060606060606 [2024-06-03 20:34:23,870 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 532 flow. Second operand 8 states and 82 transitions. [2024-06-03 20:34:23,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 79 transitions, 730 flow [2024-06-03 20:34:23,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 79 transitions, 683 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 20:34:23,875 INFO L231 Difference]: Finished difference. Result has 85 places, 70 transitions, 538 flow [2024-06-03 20:34:23,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=538, PETRI_PLACES=85, PETRI_TRANSITIONS=70} [2024-06-03 20:34:23,875 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 53 predicate places. [2024-06-03 20:34:23,875 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 70 transitions, 538 flow [2024-06-03 20:34:23,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:23,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:34:23,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:34:23,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 20:34:23,876 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 20:34:23,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:34:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1115699107, now seen corresponding path program 4 times [2024-06-03 20:34:23,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:34:23,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767379953] [2024-06-03 20:34:23,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:34:23,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:34:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:34:27,505 INFO 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 20:34:27,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:34:27,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767379953] [2024-06-03 20:34:27,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767379953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:34:27,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:34:27,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:34:27,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165860529] [2024-06-03 20:34:27,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:34:27,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:34:27,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:34:27,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:34:27,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:34:27,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:34:27,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 70 transitions, 538 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:27,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:34:27,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:34:27,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:34:27,937 INFO L124 PetriNetUnfolderBase]: 282/501 cut-off events. [2024-06-03 20:34:27,937 INFO L125 PetriNetUnfolderBase]: For 7563/7565 co-relation queries the response was YES. [2024-06-03 20:34:27,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2614 conditions, 501 events. 282/501 cut-off events. For 7563/7565 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1858 event pairs, 81 based on Foata normal form. 4/505 useless extension candidates. Maximal degree in co-relation 2573. Up to 387 conditions per place. [2024-06-03 20:34:27,941 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 52 selfloop transitions, 32 changer transitions 0/86 dead transitions. [2024-06-03 20:34:27,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 828 flow [2024-06-03 20:34:27,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:34:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:34:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-03 20:34:27,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2024-06-03 20:34:27,944 INFO L175 Difference]: Start difference. First operand has 85 places, 70 transitions, 538 flow. Second operand 8 states and 92 transitions. [2024-06-03 20:34:27,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 86 transitions, 828 flow [2024-06-03 20:34:27,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 86 transitions, 791 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 20:34:27,953 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 622 flow [2024-06-03 20:34:27,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=622, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2024-06-03 20:34:27,954 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 55 predicate places. [2024-06-03 20:34:27,954 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 622 flow [2024-06-03 20:34:27,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:27,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:34:27,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:34:27,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 20:34:27,955 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 20:34:27,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:34:27,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1107418139, now seen corresponding path program 2 times [2024-06-03 20:34:27,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:34:27,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488420420] [2024-06-03 20:34:27,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:34:27,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:34:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:34:31,116 INFO 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 20:34:31,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:34:31,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488420420] [2024-06-03 20:34:31,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488420420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:34:31,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:34:31,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:34:31,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491503715] [2024-06-03 20:34:31,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:34:31,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:34:31,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:34:31,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:34:31,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:34:31,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:34:31,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 622 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:31,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:34:31,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:34:31,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:34:31,565 INFO L124 PetriNetUnfolderBase]: 280/498 cut-off events. [2024-06-03 20:34:31,565 INFO L125 PetriNetUnfolderBase]: For 8079/8081 co-relation queries the response was YES. [2024-06-03 20:34:31,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2682 conditions, 498 events. 280/498 cut-off events. For 8079/8081 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1844 event pairs, 85 based on Foata normal form. 3/501 useless extension candidates. Maximal degree in co-relation 2640. Up to 443 conditions per place. [2024-06-03 20:34:31,569 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 62 selfloop transitions, 18 changer transitions 0/82 dead transitions. [2024-06-03 20:34:31,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 82 transitions, 804 flow [2024-06-03 20:34:31,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:34:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:34:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-03 20:34:31,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.341991341991342 [2024-06-03 20:34:31,570 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 622 flow. Second operand 7 states and 79 transitions. [2024-06-03 20:34:31,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 82 transitions, 804 flow [2024-06-03 20:34:31,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 82 transitions, 759 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-03 20:34:31,578 INFO L231 Difference]: Finished difference. Result has 90 places, 74 transitions, 621 flow [2024-06-03 20:34:31,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=621, PETRI_PLACES=90, PETRI_TRANSITIONS=74} [2024-06-03 20:34:31,579 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 58 predicate places. [2024-06-03 20:34:31,579 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 74 transitions, 621 flow [2024-06-03 20:34:31,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:31,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:34:31,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:34:31,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 20:34:31,580 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 20:34:31,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:34:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1107417953, now seen corresponding path program 3 times [2024-06-03 20:34:31,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:34:31,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013267123] [2024-06-03 20:34:31,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:34:31,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:34:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:34:35,354 INFO 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 20:34:35,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:34:35,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013267123] [2024-06-03 20:34:35,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013267123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:34:35,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:34:35,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:34:35,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541140920] [2024-06-03 20:34:35,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:34:35,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:34:35,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:34:35,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:34:35,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:34:35,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:34:35,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 74 transitions, 621 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:35,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:34:35,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:34:35,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:34:35,826 INFO L124 PetriNetUnfolderBase]: 276/492 cut-off events. [2024-06-03 20:34:35,826 INFO L125 PetriNetUnfolderBase]: For 8592/8594 co-relation queries the response was YES. [2024-06-03 20:34:35,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 492 events. 276/492 cut-off events. For 8592/8594 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1823 event pairs, 74 based on Foata normal form. 2/494 useless extension candidates. Maximal degree in co-relation 2623. Up to 408 conditions per place. [2024-06-03 20:34:35,829 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 62 selfloop transitions, 20 changer transitions 0/84 dead transitions. [2024-06-03 20:34:35,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 84 transitions, 807 flow [2024-06-03 20:34:35,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:34:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:34:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-03 20:34:35,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3593073593073593 [2024-06-03 20:34:35,831 INFO L175 Difference]: Start difference. First operand has 90 places, 74 transitions, 621 flow. Second operand 7 states and 83 transitions. [2024-06-03 20:34:35,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 84 transitions, 807 flow [2024-06-03 20:34:35,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 84 transitions, 744 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-03 20:34:35,838 INFO L231 Difference]: Finished difference. Result has 91 places, 74 transitions, 603 flow [2024-06-03 20:34:35,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=603, PETRI_PLACES=91, PETRI_TRANSITIONS=74} [2024-06-03 20:34:35,838 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 59 predicate places. [2024-06-03 20:34:35,838 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 74 transitions, 603 flow [2024-06-03 20:34:35,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:35,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:34:35,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:34:35,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 20:34:35,839 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 20:34:35,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:34:35,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1116006689, now seen corresponding path program 1 times [2024-06-03 20:34:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:34:35,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433983058] [2024-06-03 20:34:35,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:34:35,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:34:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:34:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:34:41,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:34:41,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433983058] [2024-06-03 20:34:41,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433983058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:34:41,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:34:41,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:34:41,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155281932] [2024-06-03 20:34:41,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:34:41,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:34:41,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:34:41,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:34:41,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:34:41,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:34:41,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 74 transitions, 603 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:41,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:34:41,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:34:41,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:34:41,829 INFO L124 PetriNetUnfolderBase]: 274/487 cut-off events. [2024-06-03 20:34:41,829 INFO L125 PetriNetUnfolderBase]: For 8099/8099 co-relation queries the response was YES. [2024-06-03 20:34:41,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 487 events. 274/487 cut-off events. For 8099/8099 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1803 event pairs, 77 based on Foata normal form. 1/488 useless extension candidates. Maximal degree in co-relation 2580. Up to 463 conditions per place. [2024-06-03 20:34:41,833 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 69 selfloop transitions, 14 changer transitions 0/85 dead transitions. [2024-06-03 20:34:41,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 85 transitions, 803 flow [2024-06-03 20:34:41,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:34:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:34:41,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2024-06-03 20:34:41,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2996632996632997 [2024-06-03 20:34:41,834 INFO L175 Difference]: Start difference. First operand has 91 places, 74 transitions, 603 flow. Second operand 9 states and 89 transitions. [2024-06-03 20:34:41,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 85 transitions, 803 flow [2024-06-03 20:34:41,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 85 transitions, 752 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 20:34:41,841 INFO L231 Difference]: Finished difference. Result has 94 places, 76 transitions, 603 flow [2024-06-03 20:34:41,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=603, PETRI_PLACES=94, PETRI_TRANSITIONS=76} [2024-06-03 20:34:41,842 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 62 predicate places. [2024-06-03 20:34:41,842 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 76 transitions, 603 flow [2024-06-03 20:34:41,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:41,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:34:41,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:34:41,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 20:34:41,842 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 20:34:41,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:34:41,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1202850814, now seen corresponding path program 1 times [2024-06-03 20:34:41,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:34:41,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949944674] [2024-06-03 20:34:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:34:41,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:34:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:34:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:34:45,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:34:45,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949944674] [2024-06-03 20:34:45,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949944674] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:34:45,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:34:45,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:34:45,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669036627] [2024-06-03 20:34:45,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:34:45,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:34:45,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:34:45,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:34:45,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:34:45,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:34:45,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 76 transitions, 603 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:45,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:34:45,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:34:45,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:34:45,626 INFO L124 PetriNetUnfolderBase]: 302/539 cut-off events. [2024-06-03 20:34:45,626 INFO L125 PetriNetUnfolderBase]: For 8926/8926 co-relation queries the response was YES. [2024-06-03 20:34:45,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2854 conditions, 539 events. 302/539 cut-off events. For 8926/8926 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2066 event pairs, 61 based on Foata normal form. 2/541 useless extension candidates. Maximal degree in co-relation 2808. Up to 459 conditions per place. [2024-06-03 20:34:45,630 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 83 selfloop transitions, 20 changer transitions 0/105 dead transitions. [2024-06-03 20:34:45,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 105 transitions, 952 flow [2024-06-03 20:34:45,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:34:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:34:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-03 20:34:45,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3400673400673401 [2024-06-03 20:34:45,631 INFO L175 Difference]: Start difference. First operand has 94 places, 76 transitions, 603 flow. Second operand 9 states and 101 transitions. [2024-06-03 20:34:45,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 105 transitions, 952 flow [2024-06-03 20:34:45,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 105 transitions, 915 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 20:34:45,639 INFO L231 Difference]: Finished difference. Result has 100 places, 89 transitions, 734 flow [2024-06-03 20:34:45,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=734, PETRI_PLACES=100, PETRI_TRANSITIONS=89} [2024-06-03 20:34:45,641 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 68 predicate places. [2024-06-03 20:34:45,641 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 89 transitions, 734 flow [2024-06-03 20:34:45,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:45,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:34:45,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:34:45,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 20:34:45,641 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 20:34:45,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:34:45,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2072080182, now seen corresponding path program 2 times [2024-06-03 20:34:45,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:34:45,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717769055] [2024-06-03 20:34:45,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:34:45,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:34:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:34:48,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 20:34:48,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:34:48,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717769055] [2024-06-03 20:34:48,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717769055] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:34:48,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:34:48,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:34:48,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865711152] [2024-06-03 20:34:48,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:34:48,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:34:48,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:34:48,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:34:48,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:34:49,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:34:49,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 89 transitions, 734 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:49,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:34:49,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:34:49,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:34:49,470 INFO L124 PetriNetUnfolderBase]: 325/578 cut-off events. [2024-06-03 20:34:49,470 INFO L125 PetriNetUnfolderBase]: For 9871/9873 co-relation queries the response was YES. [2024-06-03 20:34:49,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3209 conditions, 578 events. 325/578 cut-off events. For 9871/9873 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2288 event pairs, 60 based on Foata normal form. 4/582 useless extension candidates. Maximal degree in co-relation 3158. Up to 479 conditions per place. [2024-06-03 20:34:49,474 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 86 selfloop transitions, 30 changer transitions 0/118 dead transitions. [2024-06-03 20:34:49,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 118 transitions, 1101 flow [2024-06-03 20:34:49,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:34:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:34:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-03 20:34:49,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 20:34:49,485 INFO L175 Difference]: Start difference. First operand has 100 places, 89 transitions, 734 flow. Second operand 10 states and 110 transitions. [2024-06-03 20:34:49,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 118 transitions, 1101 flow [2024-06-03 20:34:49,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 118 transitions, 1071 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-03 20:34:49,495 INFO L231 Difference]: Finished difference. Result has 111 places, 100 transitions, 884 flow [2024-06-03 20:34:49,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=884, PETRI_PLACES=111, PETRI_TRANSITIONS=100} [2024-06-03 20:34:49,496 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 79 predicate places. [2024-06-03 20:34:49,496 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 100 transitions, 884 flow [2024-06-03 20:34:49,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:49,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:34:49,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:34:49,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 20:34:49,497 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 20:34:49,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:34:49,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1623255512, now seen corresponding path program 3 times [2024-06-03 20:34:49,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:34:49,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735380679] [2024-06-03 20:34:49,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:34:49,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:34:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:34:53,024 INFO 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 20:34:53,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:34:53,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735380679] [2024-06-03 20:34:53,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735380679] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:34:53,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:34:53,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:34:53,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659455819] [2024-06-03 20:34:53,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:34:53,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:34:53,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:34:53,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:34:53,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:34:53,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:34:53,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 100 transitions, 884 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:53,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:34:53,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:34:53,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:34:53,489 INFO L124 PetriNetUnfolderBase]: 331/588 cut-off events. [2024-06-03 20:34:53,490 INFO L125 PetriNetUnfolderBase]: For 11211/11211 co-relation queries the response was YES. [2024-06-03 20:34:53,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3487 conditions, 588 events. 331/588 cut-off events. For 11211/11211 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2347 event pairs, 58 based on Foata normal form. 2/590 useless extension candidates. Maximal degree in co-relation 3431. Up to 501 conditions per place. [2024-06-03 20:34:53,494 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 95 selfloop transitions, 24 changer transitions 0/121 dead transitions. [2024-06-03 20:34:53,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 1238 flow [2024-06-03 20:34:53,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:34:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:34:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-03 20:34:53,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3468013468013468 [2024-06-03 20:34:53,512 INFO L175 Difference]: Start difference. First operand has 111 places, 100 transitions, 884 flow. Second operand 9 states and 103 transitions. [2024-06-03 20:34:53,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 1238 flow [2024-06-03 20:34:53,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 121 transitions, 1191 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-03 20:34:53,532 INFO L231 Difference]: Finished difference. Result has 118 places, 104 transitions, 959 flow [2024-06-03 20:34:53,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=959, PETRI_PLACES=118, PETRI_TRANSITIONS=104} [2024-06-03 20:34:53,532 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 86 predicate places. [2024-06-03 20:34:53,532 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 104 transitions, 959 flow [2024-06-03 20:34:53,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:34:53,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:34:53,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:34:53,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 20:34:53,534 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 20:34:53,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:34:53,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1619530645, now seen corresponding path program 1 times [2024-06-03 20:34:53,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:34:53,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088171928] [2024-06-03 20:34:53,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:34:53,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:34:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:34:58,094 INFO 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 20:34:58,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:34:58,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088171928] [2024-06-03 20:34:58,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088171928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:34:58,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:34:58,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:34:58,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280910680] [2024-06-03 20:34:58,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:34:58,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:34:58,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:34:58,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:34:58,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:34:58,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-03 20:34:58,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 104 transitions, 959 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 20:34:58,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:34:58,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-03 20:34:58,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:34:58,577 INFO L124 PetriNetUnfolderBase]: 334/593 cut-off events. [2024-06-03 20:34:58,577 INFO L125 PetriNetUnfolderBase]: For 11983/11983 co-relation queries the response was YES. [2024-06-03 20:34:58,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3644 conditions, 593 events. 334/593 cut-off events. For 11983/11983 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2382 event pairs, 88 based on Foata normal form. 1/594 useless extension candidates. Maximal degree in co-relation 3584. Up to 514 conditions per place. [2024-06-03 20:34:58,585 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 88 selfloop transitions, 27 changer transitions 0/117 dead transitions. [2024-06-03 20:34:58,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 117 transitions, 1249 flow [2024-06-03 20:34:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:34:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:34:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-03 20:34:58,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3712121212121212 [2024-06-03 20:34:58,587 INFO L175 Difference]: Start difference. First operand has 118 places, 104 transitions, 959 flow. Second operand 8 states and 98 transitions. [2024-06-03 20:34:58,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 117 transitions, 1249 flow [2024-06-03 20:34:58,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 117 transitions, 1191 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-03 20:34:58,601 INFO L231 Difference]: Finished difference. Result has 122 places, 106 transitions, 993 flow [2024-06-03 20:34:58,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=993, PETRI_PLACES=122, PETRI_TRANSITIONS=106} [2024-06-03 20:34:58,602 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 90 predicate places. [2024-06-03 20:34:58,602 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 106 transitions, 993 flow [2024-06-03 20:34:58,602 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 20:34:58,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:34:58,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:34:58,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 20:34:58,602 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 20:34:58,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:34:58,603 INFO L85 PathProgramCache]: Analyzing trace with hash -871478852, now seen corresponding path program 4 times [2024-06-03 20:34:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:34:58,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283427307] [2024-06-03 20:34:58,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:34:58,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:34:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:35:02,106 INFO 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 20:35:02,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:35:02,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283427307] [2024-06-03 20:35:02,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283427307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:35:02,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:35:02,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:35:02,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906308496] [2024-06-03 20:35:02,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:35:02,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:35:02,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:35:02,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:35:02,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:35:02,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:35:02,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 106 transitions, 993 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:02,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:35:02,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:35:02,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:35:02,639 INFO L124 PetriNetUnfolderBase]: 374/659 cut-off events. [2024-06-03 20:35:02,639 INFO L125 PetriNetUnfolderBase]: For 14229/14229 co-relation queries the response was YES. [2024-06-03 20:35:02,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4084 conditions, 659 events. 374/659 cut-off events. For 14229/14229 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2745 event pairs, 60 based on Foata normal form. 2/661 useless extension candidates. Maximal degree in co-relation 4023. Up to 471 conditions per place. [2024-06-03 20:35:02,645 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 89 selfloop transitions, 50 changer transitions 0/141 dead transitions. [2024-06-03 20:35:02,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 141 transitions, 1579 flow [2024-06-03 20:35:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:35:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:35:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-03 20:35:02,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.367003367003367 [2024-06-03 20:35:02,647 INFO L175 Difference]: Start difference. First operand has 122 places, 106 transitions, 993 flow. Second operand 9 states and 109 transitions. [2024-06-03 20:35:02,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 141 transitions, 1579 flow [2024-06-03 20:35:02,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 141 transitions, 1505 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 20:35:02,668 INFO L231 Difference]: Finished difference. Result has 126 places, 120 transitions, 1212 flow [2024-06-03 20:35:02,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1212, PETRI_PLACES=126, PETRI_TRANSITIONS=120} [2024-06-03 20:35:02,668 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 94 predicate places. [2024-06-03 20:35:02,669 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 120 transitions, 1212 flow [2024-06-03 20:35:02,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:02,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:35:02,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:35:02,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 20:35:02,669 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 20:35:02,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:35:02,670 INFO L85 PathProgramCache]: Analyzing trace with hash -871484432, now seen corresponding path program 5 times [2024-06-03 20:35:02,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:35:02,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851362959] [2024-06-03 20:35:02,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:35:02,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:35:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:35:06,457 INFO 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 20:35:06,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:35:06,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851362959] [2024-06-03 20:35:06,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851362959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:35:06,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:35:06,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:35:06,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392223979] [2024-06-03 20:35:06,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:35:06,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:35:06,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:35:06,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:35:06,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:35:06,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:35:06,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 120 transitions, 1212 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:06,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:35:06,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:35:06,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:35:06,965 INFO L124 PetriNetUnfolderBase]: 375/661 cut-off events. [2024-06-03 20:35:06,966 INFO L125 PetriNetUnfolderBase]: For 15326/15326 co-relation queries the response was YES. [2024-06-03 20:35:06,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4255 conditions, 661 events. 375/661 cut-off events. For 15326/15326 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2745 event pairs, 62 based on Foata normal form. 2/663 useless extension candidates. Maximal degree in co-relation 4192. Up to 511 conditions per place. [2024-06-03 20:35:06,970 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 97 selfloop transitions, 41 changer transitions 0/140 dead transitions. [2024-06-03 20:35:06,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 140 transitions, 1605 flow [2024-06-03 20:35:06,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:35:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:35:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-03 20:35:06,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3569023569023569 [2024-06-03 20:35:06,971 INFO L175 Difference]: Start difference. First operand has 126 places, 120 transitions, 1212 flow. Second operand 9 states and 106 transitions. [2024-06-03 20:35:06,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 140 transitions, 1605 flow [2024-06-03 20:35:06,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 140 transitions, 1562 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-03 20:35:06,989 INFO L231 Difference]: Finished difference. Result has 133 places, 123 transitions, 1320 flow [2024-06-03 20:35:06,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1320, PETRI_PLACES=133, PETRI_TRANSITIONS=123} [2024-06-03 20:35:06,991 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 101 predicate places. [2024-06-03 20:35:06,991 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 123 transitions, 1320 flow [2024-06-03 20:35:06,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:06,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:35:06,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:35:06,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 20:35:06,992 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 20:35:06,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:35:06,992 INFO L85 PathProgramCache]: Analyzing trace with hash 771282366, now seen corresponding path program 1 times [2024-06-03 20:35:06,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:35:06,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590074927] [2024-06-03 20:35:06,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:35:06,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:35:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:35:11,981 INFO 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 20:35:11,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:35:11,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590074927] [2024-06-03 20:35:11,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590074927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:35:11,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:35:11,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:35:11,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607092576] [2024-06-03 20:35:11,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:35:11,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:35:11,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:35:11,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:35:11,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:35:12,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-03 20:35:12,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 123 transitions, 1320 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 20:35:12,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:35:12,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-03 20:35:12,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:35:12,514 INFO L124 PetriNetUnfolderBase]: 391/688 cut-off events. [2024-06-03 20:35:12,514 INFO L125 PetriNetUnfolderBase]: For 17665/17665 co-relation queries the response was YES. [2024-06-03 20:35:12,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4549 conditions, 688 events. 391/688 cut-off events. For 17665/17665 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2898 event pairs, 92 based on Foata normal form. 2/690 useless extension candidates. Maximal degree in co-relation 4483. Up to 581 conditions per place. [2024-06-03 20:35:12,518 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 107 selfloop transitions, 33 changer transitions 0/142 dead transitions. [2024-06-03 20:35:12,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 142 transitions, 1753 flow [2024-06-03 20:35:12,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:35:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:35:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-03 20:35:12,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.367003367003367 [2024-06-03 20:35:12,520 INFO L175 Difference]: Start difference. First operand has 133 places, 123 transitions, 1320 flow. Second operand 9 states and 109 transitions. [2024-06-03 20:35:12,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 142 transitions, 1753 flow [2024-06-03 20:35:12,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 142 transitions, 1648 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 20:35:12,540 INFO L231 Difference]: Finished difference. Result has 137 places, 127 transitions, 1341 flow [2024-06-03 20:35:12,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1341, PETRI_PLACES=137, PETRI_TRANSITIONS=127} [2024-06-03 20:35:12,541 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 105 predicate places. [2024-06-03 20:35:12,541 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 127 transitions, 1341 flow [2024-06-03 20:35:12,542 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 20:35:12,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:35:12,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:35:12,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 20:35:12,542 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 20:35:12,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:35:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1890173610, now seen corresponding path program 6 times [2024-06-03 20:35:12,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:35:12,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583607243] [2024-06-03 20:35:12,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:35:12,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:35:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:35:15,825 INFO 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 20:35:15,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:35:15,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583607243] [2024-06-03 20:35:15,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583607243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:35:15,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:35:15,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:35:15,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044522901] [2024-06-03 20:35:15,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:35:15,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:35:15,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:35:15,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:35:15,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:35:15,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:35:15,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 127 transitions, 1341 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:15,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:35:15,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:35:15,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:35:16,297 INFO L124 PetriNetUnfolderBase]: 407/713 cut-off events. [2024-06-03 20:35:16,297 INFO L125 PetriNetUnfolderBase]: For 19467/19467 co-relation queries the response was YES. [2024-06-03 20:35:16,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4841 conditions, 713 events. 407/713 cut-off events. For 19467/19467 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3017 event pairs, 66 based on Foata normal form. 2/715 useless extension candidates. Maximal degree in co-relation 4773. Up to 488 conditions per place. [2024-06-03 20:35:16,302 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 81 selfloop transitions, 63 changer transitions 0/146 dead transitions. [2024-06-03 20:35:16,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 146 transitions, 1811 flow [2024-06-03 20:35:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:35:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:35:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-03 20:35:16,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36742424242424243 [2024-06-03 20:35:16,303 INFO L175 Difference]: Start difference. First operand has 137 places, 127 transitions, 1341 flow. Second operand 8 states and 97 transitions. [2024-06-03 20:35:16,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 146 transitions, 1811 flow [2024-06-03 20:35:16,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 146 transitions, 1753 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-03 20:35:16,325 INFO L231 Difference]: Finished difference. Result has 140 places, 131 transitions, 1487 flow [2024-06-03 20:35:16,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1487, PETRI_PLACES=140, PETRI_TRANSITIONS=131} [2024-06-03 20:35:16,325 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 108 predicate places. [2024-06-03 20:35:16,325 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 131 transitions, 1487 flow [2024-06-03 20:35:16,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:16,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:35:16,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:35:16,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 20:35:16,326 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 20:35:16,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:35:16,326 INFO L85 PathProgramCache]: Analyzing trace with hash 804764776, now seen corresponding path program 7 times [2024-06-03 20:35:16,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:35:16,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861684128] [2024-06-03 20:35:16,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:35:16,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:35:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:35:19,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:35:19,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:35:19,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861684128] [2024-06-03 20:35:19,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861684128] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:35:19,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:35:19,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:35:19,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133067167] [2024-06-03 20:35:19,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:35:19,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:35:19,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:35:19,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:35:19,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:35:19,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:35:19,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 131 transitions, 1487 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:19,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:35:19,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:35:19,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:35:19,925 INFO L124 PetriNetUnfolderBase]: 408/715 cut-off events. [2024-06-03 20:35:19,926 INFO L125 PetriNetUnfolderBase]: For 20715/20715 co-relation queries the response was YES. [2024-06-03 20:35:19,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5037 conditions, 715 events. 408/715 cut-off events. For 20715/20715 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3014 event pairs, 73 based on Foata normal form. 2/717 useless extension candidates. Maximal degree in co-relation 4967. Up to 557 conditions per place. [2024-06-03 20:35:19,931 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 98 selfloop transitions, 45 changer transitions 0/145 dead transitions. [2024-06-03 20:35:19,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 145 transitions, 1855 flow [2024-06-03 20:35:19,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:35:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:35:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-03 20:35:19,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3560606060606061 [2024-06-03 20:35:19,933 INFO L175 Difference]: Start difference. First operand has 140 places, 131 transitions, 1487 flow. Second operand 8 states and 94 transitions. [2024-06-03 20:35:19,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 145 transitions, 1855 flow [2024-06-03 20:35:19,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 145 transitions, 1767 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-03 20:35:19,964 INFO L231 Difference]: Finished difference. Result has 143 places, 133 transitions, 1537 flow [2024-06-03 20:35:19,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1537, PETRI_PLACES=143, PETRI_TRANSITIONS=133} [2024-06-03 20:35:19,964 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-06-03 20:35:19,965 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 133 transitions, 1537 flow [2024-06-03 20:35:19,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:19,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:35:19,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:35:19,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 20:35:19,965 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 20:35:19,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:35:19,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1332807708, now seen corresponding path program 8 times [2024-06-03 20:35:19,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:35:19,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401017656] [2024-06-03 20:35:19,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:35:19,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:35:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:35:23,276 INFO 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 20:35:23,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:35:23,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401017656] [2024-06-03 20:35:23,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401017656] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:35:23,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:35:23,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:35:23,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874375076] [2024-06-03 20:35:23,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:35:23,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:35:23,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:35:23,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:35:23,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:35:23,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:35:23,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 133 transitions, 1537 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:23,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:35:23,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:35:23,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:35:23,766 INFO L124 PetriNetUnfolderBase]: 414/725 cut-off events. [2024-06-03 20:35:23,766 INFO L125 PetriNetUnfolderBase]: For 20471/20471 co-relation queries the response was YES. [2024-06-03 20:35:23,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5132 conditions, 725 events. 414/725 cut-off events. For 20471/20471 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3074 event pairs, 68 based on Foata normal form. 2/727 useless extension candidates. Maximal degree in co-relation 5061. Up to 462 conditions per place. [2024-06-03 20:35:23,771 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 79 selfloop transitions, 72 changer transitions 0/153 dead transitions. [2024-06-03 20:35:23,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 153 transitions, 2038 flow [2024-06-03 20:35:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:35:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:35:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-03 20:35:23,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3569023569023569 [2024-06-03 20:35:23,785 INFO L175 Difference]: Start difference. First operand has 143 places, 133 transitions, 1537 flow. Second operand 9 states and 106 transitions. [2024-06-03 20:35:23,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 153 transitions, 2038 flow [2024-06-03 20:35:23,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 153 transitions, 1932 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-03 20:35:23,810 INFO L231 Difference]: Finished difference. Result has 146 places, 137 transitions, 1648 flow [2024-06-03 20:35:23,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1431, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1648, PETRI_PLACES=146, PETRI_TRANSITIONS=137} [2024-06-03 20:35:23,810 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 114 predicate places. [2024-06-03 20:35:23,811 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 137 transitions, 1648 flow [2024-06-03 20:35:23,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:23,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:35:23,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:35:23,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 20:35:23,811 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 20:35:23,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:35:23,812 INFO L85 PathProgramCache]: Analyzing trace with hash -29775410, now seen corresponding path program 9 times [2024-06-03 20:35:23,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:35:23,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676672522] [2024-06-03 20:35:23,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:35:23,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:35:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:35:26,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 20:35:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:35:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676672522] [2024-06-03 20:35:26,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676672522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:35:26,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:35:26,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:35:26,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503569606] [2024-06-03 20:35:26,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:35:26,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:35:26,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:35:26,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:35:26,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:35:27,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:35:27,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 137 transitions, 1648 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:27,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:35:27,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:35:27,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:35:27,439 INFO L124 PetriNetUnfolderBase]: 420/735 cut-off events. [2024-06-03 20:35:27,439 INFO L125 PetriNetUnfolderBase]: For 21979/21979 co-relation queries the response was YES. [2024-06-03 20:35:27,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5330 conditions, 735 events. 420/735 cut-off events. For 21979/21979 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3146 event pairs, 76 based on Foata normal form. 2/737 useless extension candidates. Maximal degree in co-relation 5258. Up to 565 conditions per place. [2024-06-03 20:35:27,445 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 104 selfloop transitions, 49 changer transitions 0/155 dead transitions. [2024-06-03 20:35:27,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 155 transitions, 2129 flow [2024-06-03 20:35:27,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:35:27,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:35:27,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-03 20:35:27,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3602693602693603 [2024-06-03 20:35:27,458 INFO L175 Difference]: Start difference. First operand has 146 places, 137 transitions, 1648 flow. Second operand 9 states and 107 transitions. [2024-06-03 20:35:27,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 155 transitions, 2129 flow [2024-06-03 20:35:27,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 155 transitions, 2038 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-03 20:35:27,487 INFO L231 Difference]: Finished difference. Result has 150 places, 139 transitions, 1697 flow [2024-06-03 20:35:27,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1697, PETRI_PLACES=150, PETRI_TRANSITIONS=139} [2024-06-03 20:35:27,487 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 118 predicate places. [2024-06-03 20:35:27,487 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 139 transitions, 1697 flow [2024-06-03 20:35:27,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:27,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:35:27,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:35:27,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 20:35:27,488 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 20:35:27,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:35:27,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1891205620, now seen corresponding path program 2 times [2024-06-03 20:35:27,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:35:27,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531423727] [2024-06-03 20:35:27,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:35:27,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:35:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:35:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:35:31,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:35:31,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531423727] [2024-06-03 20:35:31,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531423727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:35:31,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:35:31,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:35:31,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387324537] [2024-06-03 20:35:31,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:35:31,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:35:31,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:35:31,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:35:31,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:35:31,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:35:31,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 139 transitions, 1697 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:31,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:35:31,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:35:31,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:35:32,181 INFO L124 PetriNetUnfolderBase]: 442/771 cut-off events. [2024-06-03 20:35:32,181 INFO L125 PetriNetUnfolderBase]: For 25179/25179 co-relation queries the response was YES. [2024-06-03 20:35:32,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5637 conditions, 771 events. 442/771 cut-off events. For 25179/25179 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3339 event pairs, 162 based on Foata normal form. 4/775 useless extension candidates. Maximal degree in co-relation 5563. Up to 720 conditions per place. [2024-06-03 20:35:32,188 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 134 selfloop transitions, 20 changer transitions 0/156 dead transitions. [2024-06-03 20:35:32,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 156 transitions, 2155 flow [2024-06-03 20:35:32,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:35:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:35:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-03 20:35:32,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3090909090909091 [2024-06-03 20:35:32,189 INFO L175 Difference]: Start difference. First operand has 150 places, 139 transitions, 1697 flow. Second operand 10 states and 102 transitions. [2024-06-03 20:35:32,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 156 transitions, 2155 flow [2024-06-03 20:35:32,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 156 transitions, 1956 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-03 20:35:32,224 INFO L231 Difference]: Finished difference. Result has 152 places, 144 transitions, 1605 flow [2024-06-03 20:35:32,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1605, PETRI_PLACES=152, PETRI_TRANSITIONS=144} [2024-06-03 20:35:32,224 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 120 predicate places. [2024-06-03 20:35:32,224 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 144 transitions, 1605 flow [2024-06-03 20:35:32,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:32,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:35:32,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:35:32,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 20:35:32,225 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 20:35:32,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:35:32,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1131737418, now seen corresponding path program 3 times [2024-06-03 20:35:32,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:35:32,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651958316] [2024-06-03 20:35:32,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:35:32,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:35:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:35:36,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 20:35:36,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:35:36,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651958316] [2024-06-03 20:35:36,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651958316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:35:36,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:35:36,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:35:36,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954970981] [2024-06-03 20:35:36,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:35:36,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:35:36,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:35:36,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:35:36,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:35:36,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:35:36,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 144 transitions, 1605 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:36,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:35:36,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:35:36,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:35:36,801 INFO L124 PetriNetUnfolderBase]: 448/783 cut-off events. [2024-06-03 20:35:36,802 INFO L125 PetriNetUnfolderBase]: For 25389/25389 co-relation queries the response was YES. [2024-06-03 20:35:36,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5539 conditions, 783 events. 448/783 cut-off events. For 25389/25389 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3387 event pairs, 92 based on Foata normal form. 2/785 useless extension candidates. Maximal degree in co-relation 5465. Up to 543 conditions per place. [2024-06-03 20:35:36,807 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 102 selfloop transitions, 58 changer transitions 0/162 dead transitions. [2024-06-03 20:35:36,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 162 transitions, 2097 flow [2024-06-03 20:35:36,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:35:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:35:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-03 20:35:36,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3501683501683502 [2024-06-03 20:35:36,813 INFO L175 Difference]: Start difference. First operand has 152 places, 144 transitions, 1605 flow. Second operand 9 states and 104 transitions. [2024-06-03 20:35:36,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 162 transitions, 2097 flow [2024-06-03 20:35:36,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 162 transitions, 2045 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-03 20:35:36,847 INFO L231 Difference]: Finished difference. Result has 156 places, 148 transitions, 1762 flow [2024-06-03 20:35:36,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1762, PETRI_PLACES=156, PETRI_TRANSITIONS=148} [2024-06-03 20:35:36,847 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 124 predicate places. [2024-06-03 20:35:36,847 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 148 transitions, 1762 flow [2024-06-03 20:35:36,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:36,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:35:36,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:35:36,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 20:35:36,848 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 20:35:36,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:35:36,849 INFO L85 PathProgramCache]: Analyzing trace with hash 226934846, now seen corresponding path program 4 times [2024-06-03 20:35:36,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:35:36,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212757009] [2024-06-03 20:35:36,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:35:36,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:35:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:35:41,812 INFO 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 20:35:41,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:35:41,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212757009] [2024-06-03 20:35:41,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212757009] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:35:41,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:35:41,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:35:41,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354521079] [2024-06-03 20:35:41,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:35:41,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:35:41,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:35:41,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:35:41,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:35:41,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:35:41,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 148 transitions, 1762 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:41,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:35:41,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:35:41,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:35:42,341 INFO L124 PetriNetUnfolderBase]: 454/791 cut-off events. [2024-06-03 20:35:42,341 INFO L125 PetriNetUnfolderBase]: For 27106/27106 co-relation queries the response was YES. [2024-06-03 20:35:42,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5815 conditions, 791 events. 454/791 cut-off events. For 27106/27106 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3437 event pairs, 99 based on Foata normal form. 2/793 useless extension candidates. Maximal degree in co-relation 5738. Up to 676 conditions per place. [2024-06-03 20:35:42,347 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 120 selfloop transitions, 40 changer transitions 0/162 dead transitions. [2024-06-03 20:35:42,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 162 transitions, 2157 flow [2024-06-03 20:35:42,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:35:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:35:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-03 20:35:42,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32996632996632996 [2024-06-03 20:35:42,348 INFO L175 Difference]: Start difference. First operand has 156 places, 148 transitions, 1762 flow. Second operand 9 states and 98 transitions. [2024-06-03 20:35:42,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 162 transitions, 2157 flow [2024-06-03 20:35:42,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 162 transitions, 2063 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-03 20:35:42,386 INFO L231 Difference]: Finished difference. Result has 160 places, 150 transitions, 1790 flow [2024-06-03 20:35:42,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1790, PETRI_PLACES=160, PETRI_TRANSITIONS=150} [2024-06-03 20:35:42,387 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 128 predicate places. [2024-06-03 20:35:42,387 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 150 transitions, 1790 flow [2024-06-03 20:35:42,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:42,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:35:42,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:35:42,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 20:35:42,388 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 20:35:42,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:35:42,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1397650024, now seen corresponding path program 10 times [2024-06-03 20:35:42,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:35:42,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755499798] [2024-06-03 20:35:42,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:35:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:35:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:35:45,665 INFO 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 20:35:45,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:35:45,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755499798] [2024-06-03 20:35:45,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755499798] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:35:45,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:35:45,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:35:45,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172914599] [2024-06-03 20:35:45,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:35:45,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:35:45,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:35:45,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:35:45,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:35:45,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:35:45,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 150 transitions, 1790 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:45,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:35:45,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:35:45,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:35:46,180 INFO L124 PetriNetUnfolderBase]: 450/785 cut-off events. [2024-06-03 20:35:46,180 INFO L125 PetriNetUnfolderBase]: For 27027/27027 co-relation queries the response was YES. [2024-06-03 20:35:46,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5780 conditions, 785 events. 450/785 cut-off events. For 27027/27027 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3405 event pairs, 91 based on Foata normal form. 2/787 useless extension candidates. Maximal degree in co-relation 5701. Up to 635 conditions per place. [2024-06-03 20:35:46,185 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 118 selfloop transitions, 41 changer transitions 0/161 dead transitions. [2024-06-03 20:35:46,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 161 transitions, 2156 flow [2024-06-03 20:35:46,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:35:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:35:46,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-03 20:35:46,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2024-06-03 20:35:46,186 INFO L175 Difference]: Start difference. First operand has 160 places, 150 transitions, 1790 flow. Second operand 8 states and 92 transitions. [2024-06-03 20:35:46,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 161 transitions, 2156 flow [2024-06-03 20:35:46,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 161 transitions, 2037 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-03 20:35:46,227 INFO L231 Difference]: Finished difference. Result has 161 places, 150 transitions, 1758 flow [2024-06-03 20:35:46,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=153, 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=8, PETRI_FLOW=1758, PETRI_PLACES=161, PETRI_TRANSITIONS=150} [2024-06-03 20:35:46,227 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 129 predicate places. [2024-06-03 20:35:46,227 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 150 transitions, 1758 flow [2024-06-03 20:35:46,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:46,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:35:46,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:35:46,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 20:35:46,228 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 20:35:46,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:35:46,228 INFO L85 PathProgramCache]: Analyzing trace with hash -29775193, now seen corresponding path program 2 times [2024-06-03 20:35:46,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:35:46,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575271349] [2024-06-03 20:35:46,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:35:46,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:35:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:35:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:35:50,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:35:50,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575271349] [2024-06-03 20:35:50,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575271349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:35:50,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:35:50,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:35:50,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982512] [2024-06-03 20:35:50,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:35:50,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:35:50,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:35:50,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:35:50,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:35:50,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:35:50,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 150 transitions, 1758 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:50,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:35:50,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:35:50,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:35:50,571 INFO L124 PetriNetUnfolderBase]: 448/782 cut-off events. [2024-06-03 20:35:50,571 INFO L125 PetriNetUnfolderBase]: For 27228/27228 co-relation queries the response was YES. [2024-06-03 20:35:50,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5728 conditions, 782 events. 448/782 cut-off events. For 27228/27228 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3382 event pairs, 110 based on Foata normal form. 1/783 useless extension candidates. Maximal degree in co-relation 5648. Up to 699 conditions per place. [2024-06-03 20:35:50,577 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 128 selfloop transitions, 29 changer transitions 0/159 dead transitions. [2024-06-03 20:35:50,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 159 transitions, 2100 flow [2024-06-03 20:35:50,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:35:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:35:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-03 20:35:50,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 20:35:50,579 INFO L175 Difference]: Start difference. First operand has 161 places, 150 transitions, 1758 flow. Second operand 8 states and 88 transitions. [2024-06-03 20:35:50,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 159 transitions, 2100 flow [2024-06-03 20:35:50,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 2006 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 20:35:50,620 INFO L231 Difference]: Finished difference. Result has 162 places, 150 transitions, 1730 flow [2024-06-03 20:35:50,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1664, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1730, PETRI_PLACES=162, PETRI_TRANSITIONS=150} [2024-06-03 20:35:50,620 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 130 predicate places. [2024-06-03 20:35:50,620 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 150 transitions, 1730 flow [2024-06-03 20:35:50,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:50,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:35:50,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:35:50,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 20:35:50,621 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 20:35:50,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:35:50,621 INFO L85 PathProgramCache]: Analyzing trace with hash -792737108, now seen corresponding path program 5 times [2024-06-03 20:35:50,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:35:50,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640404764] [2024-06-03 20:35:50,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:35:50,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:35:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:35:55,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 20:35:55,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:35:55,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640404764] [2024-06-03 20:35:55,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640404764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:35:55,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:35:55,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:35:55,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015823738] [2024-06-03 20:35:55,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:35:55,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:35:55,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:35:55,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:35:55,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:35:55,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:35:55,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 150 transitions, 1730 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:55,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:35:55,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:35:55,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:35:55,791 INFO L124 PetriNetUnfolderBase]: 449/784 cut-off events. [2024-06-03 20:35:55,792 INFO L125 PetriNetUnfolderBase]: For 28419/28419 co-relation queries the response was YES. [2024-06-03 20:35:55,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5717 conditions, 784 events. 449/784 cut-off events. For 28419/28419 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3396 event pairs, 109 based on Foata normal form. 2/786 useless extension candidates. Maximal degree in co-relation 5636. Up to 699 conditions per place. [2024-06-03 20:35:55,797 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 133 selfloop transitions, 28 changer transitions 0/163 dead transitions. [2024-06-03 20:35:55,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 163 transitions, 2121 flow [2024-06-03 20:35:55,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:35:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:35:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-03 20:35:55,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32323232323232326 [2024-06-03 20:35:55,798 INFO L175 Difference]: Start difference. First operand has 162 places, 150 transitions, 1730 flow. Second operand 9 states and 96 transitions. [2024-06-03 20:35:55,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 163 transitions, 2121 flow [2024-06-03 20:35:55,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 163 transitions, 2033 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-03 20:35:55,839 INFO L231 Difference]: Finished difference. Result has 164 places, 152 transitions, 1740 flow [2024-06-03 20:35:55,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1740, PETRI_PLACES=164, PETRI_TRANSITIONS=152} [2024-06-03 20:35:55,839 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2024-06-03 20:35:55,839 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 152 transitions, 1740 flow [2024-06-03 20:35:55,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:35:55,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:35:55,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:35:55,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 20:35:55,840 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 20:35:55,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:35:55,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1131399084, now seen corresponding path program 1 times [2024-06-03 20:35:55,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:35:55,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142068356] [2024-06-03 20:35:55,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:35:55,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:35:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:36:01,063 INFO 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 20:36:01,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:36:01,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142068356] [2024-06-03 20:36:01,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142068356] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:36:01,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:36:01,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:36:01,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182241311] [2024-06-03 20:36:01,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:36:01,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:36:01,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:36:01,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:36:01,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:36:01,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:36:01,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 152 transitions, 1740 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:01,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:36:01,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:36:01,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:36:01,729 INFO L124 PetriNetUnfolderBase]: 446/779 cut-off events. [2024-06-03 20:36:01,729 INFO L125 PetriNetUnfolderBase]: For 28705/28705 co-relation queries the response was YES. [2024-06-03 20:36:01,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5668 conditions, 779 events. 446/779 cut-off events. For 28705/28705 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3357 event pairs, 168 based on Foata normal form. 2/781 useless extension candidates. Maximal degree in co-relation 5586. Up to 745 conditions per place. [2024-06-03 20:36:01,735 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 144 selfloop transitions, 16 changer transitions 0/162 dead transitions. [2024-06-03 20:36:01,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 162 transitions, 2082 flow [2024-06-03 20:36:01,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:36:01,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:36:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2024-06-03 20:36:01,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2909090909090909 [2024-06-03 20:36:01,736 INFO L175 Difference]: Start difference. First operand has 164 places, 152 transitions, 1740 flow. Second operand 10 states and 96 transitions. [2024-06-03 20:36:01,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 162 transitions, 2082 flow [2024-06-03 20:36:01,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 162 transitions, 2003 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-03 20:36:01,779 INFO L231 Difference]: Finished difference. Result has 167 places, 152 transitions, 1697 flow [2024-06-03 20:36:01,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1697, PETRI_PLACES=167, PETRI_TRANSITIONS=152} [2024-06-03 20:36:01,780 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 135 predicate places. [2024-06-03 20:36:01,780 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 152 transitions, 1697 flow [2024-06-03 20:36:01,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:01,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:36:01,781 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 20:36:01,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 20:36:01,781 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 20:36:01,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:36:01,781 INFO L85 PathProgramCache]: Analyzing trace with hash 160098906, now seen corresponding path program 1 times [2024-06-03 20:36:01,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:36:01,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813393267] [2024-06-03 20:36:01,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:36:01,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:36:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:36:05,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:36:05,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:36:05,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813393267] [2024-06-03 20:36:05,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813393267] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:36:05,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:36:05,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:36:05,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519960272] [2024-06-03 20:36:05,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:36:05,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:36:05,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:36:05,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:36:05,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:36:05,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:36:05,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 152 transitions, 1697 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:05,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:36:05,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:36:05,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:36:06,293 INFO L124 PetriNetUnfolderBase]: 450/787 cut-off events. [2024-06-03 20:36:06,293 INFO L125 PetriNetUnfolderBase]: For 29856/29856 co-relation queries the response was YES. [2024-06-03 20:36:06,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5681 conditions, 787 events. 450/787 cut-off events. For 29856/29856 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3411 event pairs, 81 based on Foata normal form. 2/789 useless extension candidates. Maximal degree in co-relation 5598. Up to 679 conditions per place. [2024-06-03 20:36:06,300 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 138 selfloop transitions, 28 changer transitions 0/168 dead transitions. [2024-06-03 20:36:06,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 168 transitions, 2095 flow [2024-06-03 20:36:06,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:36:06,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:36:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-03 20:36:06,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3560606060606061 [2024-06-03 20:36:06,301 INFO L175 Difference]: Start difference. First operand has 167 places, 152 transitions, 1697 flow. Second operand 8 states and 94 transitions. [2024-06-03 20:36:06,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 168 transitions, 2095 flow [2024-06-03 20:36:06,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 168 transitions, 2053 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-03 20:36:06,351 INFO L231 Difference]: Finished difference. Result has 167 places, 153 transitions, 1729 flow [2024-06-03 20:36:06,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1655, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1729, PETRI_PLACES=167, PETRI_TRANSITIONS=153} [2024-06-03 20:36:06,351 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 135 predicate places. [2024-06-03 20:36:06,352 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 153 transitions, 1729 flow [2024-06-03 20:36:06,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:06,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:36:06,352 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 20:36:06,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 20:36:06,352 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 20:36:06,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:36:06,353 INFO L85 PathProgramCache]: Analyzing trace with hash -504896664, now seen corresponding path program 2 times [2024-06-03 20:36:06,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:36:06,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157314210] [2024-06-03 20:36:06,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:36:06,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:36:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:36:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:36:10,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:36:10,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157314210] [2024-06-03 20:36:10,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157314210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:36:10,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:36:10,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:36:10,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277558226] [2024-06-03 20:36:10,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:36:10,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:36:10,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:36:10,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:36:10,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:36:10,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:36:10,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 153 transitions, 1729 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:10,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:36:10,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:36:10,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:36:11,336 INFO L124 PetriNetUnfolderBase]: 466/819 cut-off events. [2024-06-03 20:36:11,336 INFO L125 PetriNetUnfolderBase]: For 31561/31561 co-relation queries the response was YES. [2024-06-03 20:36:11,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5888 conditions, 819 events. 466/819 cut-off events. For 31561/31561 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3626 event pairs, 75 based on Foata normal form. 2/821 useless extension candidates. Maximal degree in co-relation 5804. Up to 711 conditions per place. [2024-06-03 20:36:11,342 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 150 selfloop transitions, 26 changer transitions 0/178 dead transitions. [2024-06-03 20:36:11,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 178 transitions, 2211 flow [2024-06-03 20:36:11,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:36:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:36:11,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-03 20:36:11,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2024-06-03 20:36:11,343 INFO L175 Difference]: Start difference. First operand has 167 places, 153 transitions, 1729 flow. Second operand 10 states and 112 transitions. [2024-06-03 20:36:11,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 178 transitions, 2211 flow [2024-06-03 20:36:11,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 178 transitions, 2139 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 20:36:11,397 INFO L231 Difference]: Finished difference. Result has 173 places, 158 transitions, 1790 flow [2024-06-03 20:36:11,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1669, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1790, PETRI_PLACES=173, PETRI_TRANSITIONS=158} [2024-06-03 20:36:11,397 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 141 predicate places. [2024-06-03 20:36:11,397 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 158 transitions, 1790 flow [2024-06-03 20:36:11,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:11,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:36:11,398 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 20:36:11,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 20:36:11,398 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 20:36:11,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:36:11,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1218687546, now seen corresponding path program 1 times [2024-06-03 20:36:11,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:36:11,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151604376] [2024-06-03 20:36:11,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:36:11,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:36:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:36:15,671 INFO 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 20:36:15,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:36:15,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151604376] [2024-06-03 20:36:15,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151604376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:36:15,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:36:15,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:36:15,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035549441] [2024-06-03 20:36:15,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:36:15,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:36:15,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:36:15,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:36:15,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:36:15,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:36:15,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 158 transitions, 1790 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:15,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:36:15,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:36:15,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:36:16,133 INFO L124 PetriNetUnfolderBase]: 472/829 cut-off events. [2024-06-03 20:36:16,133 INFO L125 PetriNetUnfolderBase]: For 32943/32943 co-relation queries the response was YES. [2024-06-03 20:36:16,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5995 conditions, 829 events. 472/829 cut-off events. For 32943/32943 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3684 event pairs, 69 based on Foata normal form. 2/831 useless extension candidates. Maximal degree in co-relation 5908. Up to 734 conditions per place. [2024-06-03 20:36:16,139 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 151 selfloop transitions, 26 changer transitions 0/179 dead transitions. [2024-06-03 20:36:16,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 179 transitions, 2253 flow [2024-06-03 20:36:16,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:36:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:36:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-03 20:36:16,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2024-06-03 20:36:16,140 INFO L175 Difference]: Start difference. First operand has 173 places, 158 transitions, 1790 flow. Second operand 10 states and 112 transitions. [2024-06-03 20:36:16,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 179 transitions, 2253 flow [2024-06-03 20:36:16,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 179 transitions, 2203 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 20:36:16,196 INFO L231 Difference]: Finished difference. Result has 177 places, 160 transitions, 1829 flow [2024-06-03 20:36:16,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1740, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1829, PETRI_PLACES=177, PETRI_TRANSITIONS=160} [2024-06-03 20:36:16,196 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 145 predicate places. [2024-06-03 20:36:16,196 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 160 transitions, 1829 flow [2024-06-03 20:36:16,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:16,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:36:16,197 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 20:36:16,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 20:36:16,197 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 20:36:16,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:36:16,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1218682710, now seen corresponding path program 1 times [2024-06-03 20:36:16,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:36:16,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515692784] [2024-06-03 20:36:16,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:36:16,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:36:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:36:19,853 INFO 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 20:36:19,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:36:19,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515692784] [2024-06-03 20:36:19,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515692784] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:36:19,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:36:19,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:36:19,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74437449] [2024-06-03 20:36:19,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:36:19,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:36:19,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:36:19,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:36:19,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:36:19,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:36:19,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 160 transitions, 1829 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:19,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:36:19,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:36:19,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:36:20,420 INFO L124 PetriNetUnfolderBase]: 475/834 cut-off events. [2024-06-03 20:36:20,420 INFO L125 PetriNetUnfolderBase]: For 33561/33561 co-relation queries the response was YES. [2024-06-03 20:36:20,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6107 conditions, 834 events. 475/834 cut-off events. For 33561/33561 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3709 event pairs, 68 based on Foata normal form. 1/835 useless extension candidates. Maximal degree in co-relation 6019. Up to 741 conditions per place. [2024-06-03 20:36:20,426 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 150 selfloop transitions, 27 changer transitions 0/179 dead transitions. [2024-06-03 20:36:20,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 179 transitions, 2294 flow [2024-06-03 20:36:20,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:36:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:36:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-03 20:36:20,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3468013468013468 [2024-06-03 20:36:20,428 INFO L175 Difference]: Start difference. First operand has 177 places, 160 transitions, 1829 flow. Second operand 9 states and 103 transitions. [2024-06-03 20:36:20,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 179 transitions, 2294 flow [2024-06-03 20:36:20,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 179 transitions, 2221 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-03 20:36:20,491 INFO L231 Difference]: Finished difference. Result has 178 places, 162 transitions, 1862 flow [2024-06-03 20:36:20,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1756, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1862, PETRI_PLACES=178, PETRI_TRANSITIONS=162} [2024-06-03 20:36:20,492 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 146 predicate places. [2024-06-03 20:36:20,492 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 162 transitions, 1862 flow [2024-06-03 20:36:20,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:20,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:36:20,492 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 20:36:20,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 20:36:20,493 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 20:36:20,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:36:20,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1246039770, now seen corresponding path program 2 times [2024-06-03 20:36:20,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:36:20,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454901467] [2024-06-03 20:36:20,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:36:20,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:36:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:36:24,333 INFO 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 20:36:24,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:36:24,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454901467] [2024-06-03 20:36:24,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454901467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:36:24,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:36:24,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:36:24,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849065308] [2024-06-03 20:36:24,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:36:24,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:36:24,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:36:24,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:36:24,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:36:24,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:36:24,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 162 transitions, 1862 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:24,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:36:24,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:36:24,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:36:24,884 INFO L124 PetriNetUnfolderBase]: 481/844 cut-off events. [2024-06-03 20:36:24,884 INFO L125 PetriNetUnfolderBase]: For 36460/36460 co-relation queries the response was YES. [2024-06-03 20:36:24,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6197 conditions, 844 events. 481/844 cut-off events. For 36460/36460 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3781 event pairs, 60 based on Foata normal form. 2/846 useless extension candidates. Maximal degree in co-relation 6108. Up to 645 conditions per place. [2024-06-03 20:36:24,890 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 126 selfloop transitions, 58 changer transitions 0/186 dead transitions. [2024-06-03 20:36:24,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 186 transitions, 2444 flow [2024-06-03 20:36:24,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:36:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:36:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-03 20:36:24,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3575757575757576 [2024-06-03 20:36:24,894 INFO L175 Difference]: Start difference. First operand has 178 places, 162 transitions, 1862 flow. Second operand 10 states and 118 transitions. [2024-06-03 20:36:24,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 186 transitions, 2444 flow [2024-06-03 20:36:24,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 186 transitions, 2374 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-03 20:36:24,958 INFO L231 Difference]: Finished difference. Result has 181 places, 164 transitions, 1949 flow [2024-06-03 20:36:24,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1949, PETRI_PLACES=181, PETRI_TRANSITIONS=164} [2024-06-03 20:36:24,958 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-03 20:36:24,959 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 164 transitions, 1949 flow [2024-06-03 20:36:24,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:24,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:36:24,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:36:24,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 20:36:24,959 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 20:36:24,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:36:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1246033012, now seen corresponding path program 1 times [2024-06-03 20:36:24,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:36:24,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985995213] [2024-06-03 20:36:24,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:36:24,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:36:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:36:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:36:31,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:36:31,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985995213] [2024-06-03 20:36:31,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985995213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:36:31,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:36:31,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:36:31,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032898486] [2024-06-03 20:36:31,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:36:31,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:36:31,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:36:31,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:36:31,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:36:31,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:36:31,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 164 transitions, 1949 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:31,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:36:31,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:36:31,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:36:31,836 INFO L124 PetriNetUnfolderBase]: 499/874 cut-off events. [2024-06-03 20:36:31,837 INFO L125 PetriNetUnfolderBase]: For 37823/37823 co-relation queries the response was YES. [2024-06-03 20:36:31,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6501 conditions, 874 events. 499/874 cut-off events. For 37823/37823 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3971 event pairs, 103 based on Foata normal form. 1/875 useless extension candidates. Maximal degree in co-relation 6411. Up to 780 conditions per place. [2024-06-03 20:36:31,843 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 154 selfloop transitions, 33 changer transitions 0/189 dead transitions. [2024-06-03 20:36:31,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 189 transitions, 2475 flow [2024-06-03 20:36:31,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:36:31,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:36:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-03 20:36:31,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303030303030303 [2024-06-03 20:36:31,845 INFO L175 Difference]: Start difference. First operand has 181 places, 164 transitions, 1949 flow. Second operand 10 states and 109 transitions. [2024-06-03 20:36:31,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 189 transitions, 2475 flow [2024-06-03 20:36:31,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 189 transitions, 2334 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-03 20:36:31,905 INFO L231 Difference]: Finished difference. Result has 184 places, 172 transitions, 1996 flow [2024-06-03 20:36:31,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1996, PETRI_PLACES=184, PETRI_TRANSITIONS=172} [2024-06-03 20:36:31,905 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 152 predicate places. [2024-06-03 20:36:31,905 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 172 transitions, 1996 flow [2024-06-03 20:36:31,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:31,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:36:31,906 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 20:36:31,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 20:36:31,906 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 20:36:31,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:36:31,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1246217710, now seen corresponding path program 3 times [2024-06-03 20:36:31,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:36:31,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292377214] [2024-06-03 20:36:31,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:36:31,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:36:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:36:35,867 INFO 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 20:36:35,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:36:35,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292377214] [2024-06-03 20:36:35,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292377214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:36:35,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:36:35,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:36:35,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980726046] [2024-06-03 20:36:35,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:36:35,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:36:35,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:36:35,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:36:35,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:36:35,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:36:35,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 172 transitions, 1996 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:35,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:36:35,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:36:35,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:36:36,444 INFO L124 PetriNetUnfolderBase]: 503/882 cut-off events. [2024-06-03 20:36:36,444 INFO L125 PetriNetUnfolderBase]: For 39887/39887 co-relation queries the response was YES. [2024-06-03 20:36:36,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6526 conditions, 882 events. 503/882 cut-off events. For 39887/39887 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4000 event pairs, 74 based on Foata normal form. 2/884 useless extension candidates. Maximal degree in co-relation 6434. Up to 733 conditions per place. [2024-06-03 20:36:36,462 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 146 selfloop transitions, 42 changer transitions 0/190 dead transitions. [2024-06-03 20:36:36,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 190 transitions, 2452 flow [2024-06-03 20:36:36,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:36:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:36:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-03 20:36:36,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35353535353535354 [2024-06-03 20:36:36,464 INFO L175 Difference]: Start difference. First operand has 184 places, 172 transitions, 1996 flow. Second operand 9 states and 105 transitions. [2024-06-03 20:36:36,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 190 transitions, 2452 flow [2024-06-03 20:36:36,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 190 transitions, 2364 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-03 20:36:36,547 INFO L231 Difference]: Finished difference. Result has 187 places, 173 transitions, 2012 flow [2024-06-03 20:36:36,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1908, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2012, PETRI_PLACES=187, PETRI_TRANSITIONS=173} [2024-06-03 20:36:36,556 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 155 predicate places. [2024-06-03 20:36:36,556 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 173 transitions, 2012 flow [2024-06-03 20:36:36,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:36,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:36:36,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:36:36,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 20:36:36,557 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 20:36:36,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:36:36,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1246033260, now seen corresponding path program 3 times [2024-06-03 20:36:36,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:36:36,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167139622] [2024-06-03 20:36:36,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:36:36,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:36:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:36:41,012 INFO 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 20:36:41,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:36:41,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167139622] [2024-06-03 20:36:41,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167139622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:36:41,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:36:41,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:36:41,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791031431] [2024-06-03 20:36:41,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:36:41,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:36:41,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:36:41,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:36:41,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:36:41,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:36:41,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 173 transitions, 2012 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:41,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:36:41,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:36:41,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:36:41,615 INFO L124 PetriNetUnfolderBase]: 519/908 cut-off events. [2024-06-03 20:36:41,615 INFO L125 PetriNetUnfolderBase]: For 44208/44208 co-relation queries the response was YES. [2024-06-03 20:36:41,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6828 conditions, 908 events. 519/908 cut-off events. For 44208/44208 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4158 event pairs, 65 based on Foata normal form. 2/910 useless extension candidates. Maximal degree in co-relation 6737. Up to 662 conditions per place. [2024-06-03 20:36:41,622 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 133 selfloop transitions, 66 changer transitions 0/201 dead transitions. [2024-06-03 20:36:41,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 201 transitions, 2768 flow [2024-06-03 20:36:41,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:36:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:36:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-03 20:36:41,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-03 20:36:41,624 INFO L175 Difference]: Start difference. First operand has 187 places, 173 transitions, 2012 flow. Second operand 10 states and 121 transitions. [2024-06-03 20:36:41,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 201 transitions, 2768 flow [2024-06-03 20:36:41,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 201 transitions, 2674 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-03 20:36:41,696 INFO L231 Difference]: Finished difference. Result has 190 places, 177 transitions, 2132 flow [2024-06-03 20:36:41,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1918, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2132, PETRI_PLACES=190, PETRI_TRANSITIONS=177} [2024-06-03 20:36:41,697 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 158 predicate places. [2024-06-03 20:36:41,697 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 177 transitions, 2132 flow [2024-06-03 20:36:41,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:41,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:36:41,698 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 20:36:41,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 20:36:41,698 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 20:36:41,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:36:41,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1333978716, now seen corresponding path program 4 times [2024-06-03 20:36:41,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:36:41,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423390059] [2024-06-03 20:36:41,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:36:41,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:36:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:36:45,477 INFO 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 20:36:45,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:36:45,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423390059] [2024-06-03 20:36:45,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423390059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:36:45,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:36:45,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:36:45,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209741110] [2024-06-03 20:36:45,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:36:45,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:36:45,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:36:45,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:36:45,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:36:45,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:36:45,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 177 transitions, 2132 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:45,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:36:45,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:36:45,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:36:46,062 INFO L124 PetriNetUnfolderBase]: 525/918 cut-off events. [2024-06-03 20:36:46,062 INFO L125 PetriNetUnfolderBase]: For 46327/46327 co-relation queries the response was YES. [2024-06-03 20:36:46,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7028 conditions, 918 events. 525/918 cut-off events. For 46327/46327 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4222 event pairs, 74 based on Foata normal form. 2/920 useless extension candidates. Maximal degree in co-relation 6936. Up to 759 conditions per place. [2024-06-03 20:36:46,069 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 151 selfloop transitions, 45 changer transitions 0/198 dead transitions. [2024-06-03 20:36:46,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 198 transitions, 2646 flow [2024-06-03 20:36:46,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:36:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:36:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-03 20:36:46,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2024-06-03 20:36:46,070 INFO L175 Difference]: Start difference. First operand has 190 places, 177 transitions, 2132 flow. Second operand 10 states and 115 transitions. [2024-06-03 20:36:46,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 198 transitions, 2646 flow [2024-06-03 20:36:46,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 198 transitions, 2535 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-03 20:36:46,154 INFO L231 Difference]: Finished difference. Result has 194 places, 179 transitions, 2160 flow [2024-06-03 20:36:46,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2025, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2160, PETRI_PLACES=194, PETRI_TRANSITIONS=179} [2024-06-03 20:36:46,155 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 162 predicate places. [2024-06-03 20:36:46,155 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 179 transitions, 2160 flow [2024-06-03 20:36:46,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:46,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:36:46,155 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 20:36:46,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 20:36:46,155 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 20:36:46,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:36:46,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1125197256, now seen corresponding path program 4 times [2024-06-03 20:36:46,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:36:46,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483331715] [2024-06-03 20:36:46,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:36:46,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:36:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:36:49,982 INFO 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 20:36:49,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:36:49,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483331715] [2024-06-03 20:36:49,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483331715] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:36:49,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:36:49,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:36:49,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083179557] [2024-06-03 20:36:49,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:36:49,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:36:49,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:36:49,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:36:49,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:36:50,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-03 20:36:50,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 179 transitions, 2160 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:50,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:36:50,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-03 20:36:50,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:36:50,495 INFO L124 PetriNetUnfolderBase]: 526/927 cut-off events. [2024-06-03 20:36:50,496 INFO L125 PetriNetUnfolderBase]: For 49638/49643 co-relation queries the response was YES. [2024-06-03 20:36:50,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7229 conditions, 927 events. 526/927 cut-off events. For 49638/49643 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4320 event pairs, 83 based on Foata normal form. 6/931 useless extension candidates. Maximal degree in co-relation 7135. Up to 724 conditions per place. [2024-06-03 20:36:50,503 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 138 selfloop transitions, 43 changer transitions 0/191 dead transitions. [2024-06-03 20:36:50,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 191 transitions, 2676 flow [2024-06-03 20:36:50,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:36:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:36:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-03 20:36:50,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3722943722943723 [2024-06-03 20:36:50,504 INFO L175 Difference]: Start difference. First operand has 194 places, 179 transitions, 2160 flow. Second operand 7 states and 86 transitions. [2024-06-03 20:36:50,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 191 transitions, 2676 flow [2024-06-03 20:36:50,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 191 transitions, 2561 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-03 20:36:50,590 INFO L231 Difference]: Finished difference. Result has 193 places, 181 transitions, 2171 flow [2024-06-03 20:36:50,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2045, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2171, PETRI_PLACES=193, PETRI_TRANSITIONS=181} [2024-06-03 20:36:50,591 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 161 predicate places. [2024-06-03 20:36:50,591 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 181 transitions, 2171 flow [2024-06-03 20:36:50,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:50,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:36:50,591 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 20:36:50,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 20:36:50,592 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 20:36:50,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:36:50,592 INFO L85 PathProgramCache]: Analyzing trace with hash -350334456, now seen corresponding path program 2 times [2024-06-03 20:36:50,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:36:50,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660388165] [2024-06-03 20:36:50,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:36:50,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:36:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:36:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:36:54,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:36:54,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660388165] [2024-06-03 20:36:54,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660388165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:36:54,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:36:54,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:36:54,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770252307] [2024-06-03 20:36:54,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:36:54,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:36:54,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:36:54,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:36:54,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:36:54,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:36:54,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 181 transitions, 2171 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:54,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:36:54,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:36:54,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:36:54,682 INFO L124 PetriNetUnfolderBase]: 534/936 cut-off events. [2024-06-03 20:36:54,683 INFO L125 PetriNetUnfolderBase]: For 50140/50140 co-relation queries the response was YES. [2024-06-03 20:36:54,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7245 conditions, 936 events. 534/936 cut-off events. For 50140/50140 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4349 event pairs, 85 based on Foata normal form. 1/937 useless extension candidates. Maximal degree in co-relation 7150. Up to 831 conditions per place. [2024-06-03 20:36:54,689 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 162 selfloop transitions, 34 changer transitions 0/198 dead transitions. [2024-06-03 20:36:54,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 198 transitions, 2623 flow [2024-06-03 20:36:54,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:36:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:36:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-03 20:36:54,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 20:36:54,691 INFO L175 Difference]: Start difference. First operand has 193 places, 181 transitions, 2171 flow. Second operand 10 states and 110 transitions. [2024-06-03 20:36:54,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 198 transitions, 2623 flow [2024-06-03 20:36:54,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 198 transitions, 2552 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-03 20:36:54,781 INFO L231 Difference]: Finished difference. Result has 200 places, 181 transitions, 2176 flow [2024-06-03 20:36:54,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2176, PETRI_PLACES=200, PETRI_TRANSITIONS=181} [2024-06-03 20:36:54,782 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 168 predicate places. [2024-06-03 20:36:54,782 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 181 transitions, 2176 flow [2024-06-03 20:36:54,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:36:54,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:36:54,782 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 20:36:54,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 20:36:54,782 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 20:36:54,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:36:54,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1989120936, now seen corresponding path program 5 times [2024-06-03 20:36:54,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:36:54,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352565768] [2024-06-03 20:36:54,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:36:54,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:36:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:36:59,332 INFO 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 20:36:59,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:36:59,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352565768] [2024-06-03 20:36:59,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352565768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:36:59,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:36:59,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:36:59,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693532053] [2024-06-03 20:36:59,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:36:59,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:36:59,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:36:59,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:36:59,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:36:59,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-03 20:36:59,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 181 transitions, 2176 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 20:36:59,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:36:59,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-03 20:36:59,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:36:59,938 INFO L124 PetriNetUnfolderBase]: 541/948 cut-off events. [2024-06-03 20:36:59,938 INFO L125 PetriNetUnfolderBase]: For 54218/54218 co-relation queries the response was YES. [2024-06-03 20:36:59,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7370 conditions, 948 events. 541/948 cut-off events. For 54218/54218 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4427 event pairs, 90 based on Foata normal form. 4/952 useless extension candidates. Maximal degree in co-relation 7273. Up to 809 conditions per place. [2024-06-03 20:36:59,946 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 158 selfloop transitions, 40 changer transitions 0/200 dead transitions. [2024-06-03 20:36:59,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 200 transitions, 2706 flow [2024-06-03 20:36:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:36:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:36:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-03 20:36:59,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.367003367003367 [2024-06-03 20:36:59,948 INFO L175 Difference]: Start difference. First operand has 200 places, 181 transitions, 2176 flow. Second operand 9 states and 109 transitions. [2024-06-03 20:36:59,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 200 transitions, 2706 flow [2024-06-03 20:37:00,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 200 transitions, 2588 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-03 20:37:00,046 INFO L231 Difference]: Finished difference. Result has 199 places, 185 transitions, 2237 flow [2024-06-03 20:37:00,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2058, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2237, PETRI_PLACES=199, PETRI_TRANSITIONS=185} [2024-06-03 20:37:00,046 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 167 predicate places. [2024-06-03 20:37:00,046 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 185 transitions, 2237 flow [2024-06-03 20:37:00,047 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 20:37:00,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:37:00,047 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 20:37:00,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 20:37:00,047 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 20:37:00,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:37:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1860049502, now seen corresponding path program 1 times [2024-06-03 20:37:00,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:37:00,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562568371] [2024-06-03 20:37:00,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:37:00,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:37:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:37:05,190 INFO 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 20:37:05,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:37:05,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562568371] [2024-06-03 20:37:05,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562568371] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:37:05,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:37:05,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:37:05,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212704278] [2024-06-03 20:37:05,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:37:05,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:37:05,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:37:05,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:37:05,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:37:05,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:37:05,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 185 transitions, 2237 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:05,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:37:05,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:37:05,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:37:05,934 INFO L124 PetriNetUnfolderBase]: 547/959 cut-off events. [2024-06-03 20:37:05,935 INFO L125 PetriNetUnfolderBase]: For 54099/54099 co-relation queries the response was YES. [2024-06-03 20:37:05,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7493 conditions, 959 events. 547/959 cut-off events. For 54099/54099 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4502 event pairs, 126 based on Foata normal form. 2/961 useless extension candidates. Maximal degree in co-relation 7396. Up to 865 conditions per place. [2024-06-03 20:37:05,942 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 172 selfloop transitions, 33 changer transitions 0/207 dead transitions. [2024-06-03 20:37:05,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 207 transitions, 2754 flow [2024-06-03 20:37:05,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:37:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:37:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-03 20:37:05,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31955922865013775 [2024-06-03 20:37:05,943 INFO L175 Difference]: Start difference. First operand has 199 places, 185 transitions, 2237 flow. Second operand 11 states and 116 transitions. [2024-06-03 20:37:05,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 207 transitions, 2754 flow [2024-06-03 20:37:06,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 207 transitions, 2612 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-03 20:37:06,039 INFO L231 Difference]: Finished difference. Result has 203 places, 190 transitions, 2232 flow [2024-06-03 20:37:06,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2095, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2232, PETRI_PLACES=203, PETRI_TRANSITIONS=190} [2024-06-03 20:37:06,039 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 171 predicate places. [2024-06-03 20:37:06,040 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 190 transitions, 2232 flow [2024-06-03 20:37:06,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:06,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:37:06,040 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 20:37:06,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 20:37:06,040 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 20:37:06,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:37:06,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1074637990, now seen corresponding path program 5 times [2024-06-03 20:37:06,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:37:06,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168767408] [2024-06-03 20:37:06,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:37:06,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:37:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:37:10,565 INFO 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 20:37:10,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:37:10,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168767408] [2024-06-03 20:37:10,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168767408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:37:10,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:37:10,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:37:10,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566108150] [2024-06-03 20:37:10,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:37:10,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:37:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:37:10,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:37:10,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:37:10,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:37:10,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 190 transitions, 2232 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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 20:37:10,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:37:10,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:37:10,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:37:11,052 INFO L124 PetriNetUnfolderBase]: 544/953 cut-off events. [2024-06-03 20:37:11,053 INFO L125 PetriNetUnfolderBase]: For 47878/47878 co-relation queries the response was YES. [2024-06-03 20:37:11,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7225 conditions, 953 events. 544/953 cut-off events. For 47878/47878 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4426 event pairs, 108 based on Foata normal form. 2/955 useless extension candidates. Maximal degree in co-relation 7127. Up to 829 conditions per place. [2024-06-03 20:37:11,060 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 167 selfloop transitions, 34 changer transitions 0/203 dead transitions. [2024-06-03 20:37:11,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 203 transitions, 2672 flow [2024-06-03 20:37:11,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:37:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:37:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-03 20:37:11,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2024-06-03 20:37:11,061 INFO L175 Difference]: Start difference. First operand has 203 places, 190 transitions, 2232 flow. Second operand 8 states and 90 transitions. [2024-06-03 20:37:11,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 203 transitions, 2672 flow [2024-06-03 20:37:11,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 203 transitions, 2607 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-03 20:37:11,147 INFO L231 Difference]: Finished difference. Result has 208 places, 190 transitions, 2246 flow [2024-06-03 20:37:11,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2167, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2246, PETRI_PLACES=208, PETRI_TRANSITIONS=190} [2024-06-03 20:37:11,148 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2024-06-03 20:37:11,148 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 190 transitions, 2246 flow [2024-06-03 20:37:11,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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 20:37:11,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:37:11,148 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 20:37:11,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 20:37:11,149 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 20:37:11,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:37:11,149 INFO L85 PathProgramCache]: Analyzing trace with hash -937390860, now seen corresponding path program 3 times [2024-06-03 20:37:11,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:37:11,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659581437] [2024-06-03 20:37:11,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:37:11,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:37:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:37:15,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:37:15,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:37:15,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659581437] [2024-06-03 20:37:15,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659581437] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:37:15,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:37:15,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:37:15,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761664126] [2024-06-03 20:37:15,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:37:15,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:37:15,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:37:15,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:37:15,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:37:15,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:37:15,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 190 transitions, 2246 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:15,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:37:15,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:37:15,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:37:15,603 INFO L124 PetriNetUnfolderBase]: 542/950 cut-off events. [2024-06-03 20:37:15,603 INFO L125 PetriNetUnfolderBase]: For 47521/47521 co-relation queries the response was YES. [2024-06-03 20:37:15,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7199 conditions, 950 events. 542/950 cut-off events. For 47521/47521 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4401 event pairs, 105 based on Foata normal form. 1/951 useless extension candidates. Maximal degree in co-relation 7100. Up to 817 conditions per place. [2024-06-03 20:37:15,610 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 158 selfloop transitions, 43 changer transitions 0/203 dead transitions. [2024-06-03 20:37:15,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 203 transitions, 2692 flow [2024-06-03 20:37:15,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:37:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:37:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-03 20:37:15,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3446969696969697 [2024-06-03 20:37:15,612 INFO L175 Difference]: Start difference. First operand has 208 places, 190 transitions, 2246 flow. Second operand 8 states and 91 transitions. [2024-06-03 20:37:15,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 203 transitions, 2692 flow [2024-06-03 20:37:15,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 203 transitions, 2612 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 20:37:15,726 INFO L231 Difference]: Finished difference. Result has 209 places, 190 transitions, 2272 flow [2024-06-03 20:37:15,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2272, PETRI_PLACES=209, PETRI_TRANSITIONS=190} [2024-06-03 20:37:15,727 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 177 predicate places. [2024-06-03 20:37:15,727 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 190 transitions, 2272 flow [2024-06-03 20:37:15,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:15,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:37:15,727 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 20:37:15,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 20:37:15,727 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 20:37:15,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:37:15,727 INFO L85 PathProgramCache]: Analyzing trace with hash -164117560, now seen corresponding path program 6 times [2024-06-03 20:37:15,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:37:15,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413362981] [2024-06-03 20:37:15,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:37:15,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:37:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:37:19,953 INFO 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 20:37:19,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:37:19,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413362981] [2024-06-03 20:37:19,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413362981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:37:19,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:37:19,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:37:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485150727] [2024-06-03 20:37:19,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:37:19,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:37:19,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:37:19,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:37:19,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:37:20,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:37:20,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 190 transitions, 2272 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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 20:37:20,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:37:20,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:37:20,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:37:20,516 INFO L124 PetriNetUnfolderBase]: 546/958 cut-off events. [2024-06-03 20:37:20,516 INFO L125 PetriNetUnfolderBase]: For 50641/50641 co-relation queries the response was YES. [2024-06-03 20:37:20,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7315 conditions, 958 events. 546/958 cut-off events. For 50641/50641 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4463 event pairs, 78 based on Foata normal form. 2/960 useless extension candidates. Maximal degree in co-relation 7215. Up to 803 conditions per place. [2024-06-03 20:37:20,526 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 156 selfloop transitions, 45 changer transitions 0/203 dead transitions. [2024-06-03 20:37:20,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 203 transitions, 2732 flow [2024-06-03 20:37:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:37:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:37:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-03 20:37:20,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-03 20:37:20,527 INFO L175 Difference]: Start difference. First operand has 209 places, 190 transitions, 2272 flow. Second operand 8 states and 93 transitions. [2024-06-03 20:37:20,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 203 transitions, 2732 flow [2024-06-03 20:37:20,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 203 transitions, 2604 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-03 20:37:20,654 INFO L231 Difference]: Finished difference. Result has 208 places, 191 transitions, 2260 flow [2024-06-03 20:37:20,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2260, PETRI_PLACES=208, PETRI_TRANSITIONS=191} [2024-06-03 20:37:20,655 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2024-06-03 20:37:20,655 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 191 transitions, 2260 flow [2024-06-03 20:37:20,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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 20:37:20,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:37:20,655 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 20:37:20,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 20:37:20,655 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 20:37:20,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:37:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash -163517954, now seen corresponding path program 6 times [2024-06-03 20:37:20,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:37:20,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682612956] [2024-06-03 20:37:20,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:37:20,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:37:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:37:24,735 INFO 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 20:37:24,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:37:24,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682612956] [2024-06-03 20:37:24,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682612956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:37:24,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:37:24,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:37:24,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730491996] [2024-06-03 20:37:24,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:37:24,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:37:24,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:37:24,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:37:24,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:37:24,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:37:24,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 191 transitions, 2260 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:24,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:37:24,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:37:24,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:37:25,382 INFO L124 PetriNetUnfolderBase]: 552/968 cut-off events. [2024-06-03 20:37:25,383 INFO L125 PetriNetUnfolderBase]: For 49007/49007 co-relation queries the response was YES. [2024-06-03 20:37:25,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7332 conditions, 968 events. 552/968 cut-off events. For 49007/49007 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4515 event pairs, 78 based on Foata normal form. 2/970 useless extension candidates. Maximal degree in co-relation 7233. Up to 793 conditions per place. [2024-06-03 20:37:25,389 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 154 selfloop transitions, 51 changer transitions 0/207 dead transitions. [2024-06-03 20:37:25,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 207 transitions, 2766 flow [2024-06-03 20:37:25,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:37:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:37:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-03 20:37:25,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3468013468013468 [2024-06-03 20:37:25,390 INFO L175 Difference]: Start difference. First operand has 208 places, 191 transitions, 2260 flow. Second operand 9 states and 103 transitions. [2024-06-03 20:37:25,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 207 transitions, 2766 flow [2024-06-03 20:37:25,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 207 transitions, 2662 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-03 20:37:25,478 INFO L231 Difference]: Finished difference. Result has 211 places, 193 transitions, 2310 flow [2024-06-03 20:37:25,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2310, PETRI_PLACES=211, PETRI_TRANSITIONS=193} [2024-06-03 20:37:25,479 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 179 predicate places. [2024-06-03 20:37:25,479 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 193 transitions, 2310 flow [2024-06-03 20:37:25,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:25,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:37:25,480 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 20:37:25,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 20:37:25,480 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 20:37:25,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:37:25,480 INFO L85 PathProgramCache]: Analyzing trace with hash -163338216, now seen corresponding path program 2 times [2024-06-03 20:37:25,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:37:25,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253250948] [2024-06-03 20:37:25,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:37:25,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:37:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:37:30,780 INFO 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 20:37:30,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:37:30,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253250948] [2024-06-03 20:37:30,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253250948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:37:30,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:37:30,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:37:30,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840878293] [2024-06-03 20:37:30,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:37:30,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:37:30,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:37:30,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:37:30,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:37:30,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:37:30,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 193 transitions, 2310 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:30,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:37:30,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:37:30,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:37:31,496 INFO L124 PetriNetUnfolderBase]: 555/973 cut-off events. [2024-06-03 20:37:31,496 INFO L125 PetriNetUnfolderBase]: For 48100/48100 co-relation queries the response was YES. [2024-06-03 20:37:31,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7406 conditions, 973 events. 555/973 cut-off events. For 48100/48100 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4563 event pairs, 133 based on Foata normal form. 1/974 useless extension candidates. Maximal degree in co-relation 7306. Up to 848 conditions per place. [2024-06-03 20:37:31,504 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 160 selfloop transitions, 46 changer transitions 0/208 dead transitions. [2024-06-03 20:37:31,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 208 transitions, 2805 flow [2024-06-03 20:37:31,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:37:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:37:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-03 20:37:31,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 20:37:31,505 INFO L175 Difference]: Start difference. First operand has 211 places, 193 transitions, 2310 flow. Second operand 9 states and 99 transitions. [2024-06-03 20:37:31,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 208 transitions, 2805 flow [2024-06-03 20:37:31,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 208 transitions, 2677 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-03 20:37:31,598 INFO L231 Difference]: Finished difference. Result has 213 places, 195 transitions, 2333 flow [2024-06-03 20:37:31,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2333, PETRI_PLACES=213, PETRI_TRANSITIONS=195} [2024-06-03 20:37:31,598 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 181 predicate places. [2024-06-03 20:37:31,599 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 195 transitions, 2333 flow [2024-06-03 20:37:31,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:31,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:37:31,599 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 20:37:31,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 20:37:31,599 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 20:37:31,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:37:31,600 INFO L85 PathProgramCache]: Analyzing trace with hash -163338464, now seen corresponding path program 7 times [2024-06-03 20:37:31,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:37:31,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956815616] [2024-06-03 20:37:31,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:37:31,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:37:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:37:35,572 INFO 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 20:37:35,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:37:35,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956815616] [2024-06-03 20:37:35,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956815616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:37:35,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:37:35,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:37:35,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196042060] [2024-06-03 20:37:35,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:37:35,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:37:35,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:37:35,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:37:35,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:37:35,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:37:35,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 195 transitions, 2333 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:35,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:37:35,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:37:35,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:37:36,230 INFO L124 PetriNetUnfolderBase]: 571/999 cut-off events. [2024-06-03 20:37:36,230 INFO L125 PetriNetUnfolderBase]: For 53551/53551 co-relation queries the response was YES. [2024-06-03 20:37:36,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7735 conditions, 999 events. 571/999 cut-off events. For 53551/53551 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4707 event pairs, 63 based on Foata normal form. 2/1001 useless extension candidates. Maximal degree in co-relation 7634. Up to 668 conditions per place. [2024-06-03 20:37:36,240 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 122 selfloop transitions, 93 changer transitions 0/217 dead transitions. [2024-06-03 20:37:36,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 217 transitions, 3031 flow [2024-06-03 20:37:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:37:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:37:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-03 20:37:36,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-03 20:37:36,242 INFO L175 Difference]: Start difference. First operand has 213 places, 195 transitions, 2333 flow. Second operand 9 states and 108 transitions. [2024-06-03 20:37:36,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 217 transitions, 3031 flow [2024-06-03 20:37:36,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 217 transitions, 2911 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-03 20:37:36,356 INFO L231 Difference]: Finished difference. Result has 215 places, 199 transitions, 2505 flow [2024-06-03 20:37:36,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2217, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2505, PETRI_PLACES=215, PETRI_TRANSITIONS=199} [2024-06-03 20:37:36,356 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 183 predicate places. [2024-06-03 20:37:36,357 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 199 transitions, 2505 flow [2024-06-03 20:37:36,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:36,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:37:36,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:37:36,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 20:37:36,357 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 20:37:36,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:37:36,358 INFO L85 PathProgramCache]: Analyzing trace with hash -163344974, now seen corresponding path program 8 times [2024-06-03 20:37:36,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:37:36,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196246248] [2024-06-03 20:37:36,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:37:36,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:37:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:37:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:37:40,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:37:40,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196246248] [2024-06-03 20:37:40,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196246248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:37:40,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:37:40,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:37:40,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179705911] [2024-06-03 20:37:40,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:37:40,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:37:40,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:37:40,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:37:40,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:37:40,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:37:40,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 199 transitions, 2505 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:40,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:37:40,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:37:40,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:37:41,360 INFO L124 PetriNetUnfolderBase]: 572/1001 cut-off events. [2024-06-03 20:37:41,360 INFO L125 PetriNetUnfolderBase]: For 51415/51415 co-relation queries the response was YES. [2024-06-03 20:37:41,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7818 conditions, 1001 events. 572/1001 cut-off events. For 51415/51415 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4733 event pairs, 63 based on Foata normal form. 2/1003 useless extension candidates. Maximal degree in co-relation 7716. Up to 759 conditions per place. [2024-06-03 20:37:41,367 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 142 selfloop transitions, 73 changer transitions 0/217 dead transitions. [2024-06-03 20:37:41,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 217 transitions, 3053 flow [2024-06-03 20:37:41,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:37:41,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:37:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-03 20:37:41,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35353535353535354 [2024-06-03 20:37:41,369 INFO L175 Difference]: Start difference. First operand has 215 places, 199 transitions, 2505 flow. Second operand 9 states and 105 transitions. [2024-06-03 20:37:41,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 217 transitions, 3053 flow [2024-06-03 20:37:41,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 217 transitions, 2911 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-03 20:37:41,469 INFO L231 Difference]: Finished difference. Result has 218 places, 201 transitions, 2569 flow [2024-06-03 20:37:41,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2367, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2569, PETRI_PLACES=218, PETRI_TRANSITIONS=201} [2024-06-03 20:37:41,470 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 186 predicate places. [2024-06-03 20:37:41,470 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 201 transitions, 2569 flow [2024-06-03 20:37:41,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:41,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:37:41,470 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 20:37:41,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 20:37:41,471 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 20:37:41,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:37:41,471 INFO L85 PathProgramCache]: Analyzing trace with hash 8796348, now seen corresponding path program 2 times [2024-06-03 20:37:41,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:37:41,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932550863] [2024-06-03 20:37:41,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:37:41,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:37:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:37:46,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 20:37:46,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:37:46,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932550863] [2024-06-03 20:37:46,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932550863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:37:46,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:37:46,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:37:46,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881889104] [2024-06-03 20:37:46,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:37:46,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:37:46,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:37:46,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:37:46,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:37:47,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:37:47,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 201 transitions, 2569 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:47,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:37:47,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:37:47,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:37:47,792 INFO L124 PetriNetUnfolderBase]: 568/996 cut-off events. [2024-06-03 20:37:47,792 INFO L125 PetriNetUnfolderBase]: For 49784/49784 co-relation queries the response was YES. [2024-06-03 20:37:47,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7732 conditions, 996 events. 568/996 cut-off events. For 49784/49784 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4761 event pairs, 120 based on Foata normal form. 2/998 useless extension candidates. Maximal degree in co-relation 7629. Up to 872 conditions per place. [2024-06-03 20:37:47,800 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 173 selfloop transitions, 41 changer transitions 0/216 dead transitions. [2024-06-03 20:37:47,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 216 transitions, 3047 flow [2024-06-03 20:37:47,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:37:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:37:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-03 20:37:47,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3242424242424242 [2024-06-03 20:37:47,802 INFO L175 Difference]: Start difference. First operand has 218 places, 201 transitions, 2569 flow. Second operand 10 states and 107 transitions. [2024-06-03 20:37:47,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 216 transitions, 3047 flow [2024-06-03 20:37:47,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 216 transitions, 2871 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-03 20:37:47,897 INFO L231 Difference]: Finished difference. Result has 221 places, 201 transitions, 2483 flow [2024-06-03 20:37:47,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2393, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2483, PETRI_PLACES=221, PETRI_TRANSITIONS=201} [2024-06-03 20:37:47,898 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 189 predicate places. [2024-06-03 20:37:47,898 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 201 transitions, 2483 flow [2024-06-03 20:37:47,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:47,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:37:47,898 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 20:37:47,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 20:37:47,898 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 20:37:47,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:37:47,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1000648414, now seen corresponding path program 7 times [2024-06-03 20:37:47,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:37:47,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570737068] [2024-06-03 20:37:47,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:37:47,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:37:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:37:52,500 INFO 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 20:37:52,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:37:52,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570737068] [2024-06-03 20:37:52,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570737068] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:37:52,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:37:52,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:37:52,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500853113] [2024-06-03 20:37:52,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:37:52,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:37:52,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:37:52,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:37:52,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:37:52,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:37:52,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 201 transitions, 2483 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:52,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:37:52,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:37:52,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:37:53,103 INFO L124 PetriNetUnfolderBase]: 565/990 cut-off events. [2024-06-03 20:37:53,104 INFO L125 PetriNetUnfolderBase]: For 47205/47205 co-relation queries the response was YES. [2024-06-03 20:37:53,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7522 conditions, 990 events. 565/990 cut-off events. For 47205/47205 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4668 event pairs, 89 based on Foata normal form. 2/992 useless extension candidates. Maximal degree in co-relation 7418. Up to 841 conditions per place. [2024-06-03 20:37:53,113 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 168 selfloop transitions, 42 changer transitions 0/212 dead transitions. [2024-06-03 20:37:53,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 212 transitions, 2945 flow [2024-06-03 20:37:53,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:37:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:37:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-03 20:37:53,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3446969696969697 [2024-06-03 20:37:53,114 INFO L175 Difference]: Start difference. First operand has 221 places, 201 transitions, 2483 flow. Second operand 8 states and 91 transitions. [2024-06-03 20:37:53,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 212 transitions, 2945 flow [2024-06-03 20:37:53,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 212 transitions, 2851 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 20:37:53,219 INFO L231 Difference]: Finished difference. Result has 220 places, 201 transitions, 2477 flow [2024-06-03 20:37:53,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2389, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2477, PETRI_PLACES=220, PETRI_TRANSITIONS=201} [2024-06-03 20:37:53,220 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 188 predicate places. [2024-06-03 20:37:53,220 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 201 transitions, 2477 flow [2024-06-03 20:37:53,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:53,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:37:53,220 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 20:37:53,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 20:37:53,221 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 20:37:53,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:37:53,221 INFO L85 PathProgramCache]: Analyzing trace with hash -923209824, now seen corresponding path program 9 times [2024-06-03 20:37:53,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:37:53,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542062825] [2024-06-03 20:37:53,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:37:53,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:37:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:37:57,203 INFO 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 20:37:57,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:37:57,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542062825] [2024-06-03 20:37:57,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542062825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:37:57,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:37:57,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:37:57,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417200781] [2024-06-03 20:37:57,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:37:57,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:37:57,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:37:57,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:37:57,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:37:57,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:37:57,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 201 transitions, 2477 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:57,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:37:57,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:37:57,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:37:57,800 INFO L124 PetriNetUnfolderBase]: 571/1000 cut-off events. [2024-06-03 20:37:57,800 INFO L125 PetriNetUnfolderBase]: For 47634/47634 co-relation queries the response was YES. [2024-06-03 20:37:57,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7601 conditions, 1000 events. 571/1000 cut-off events. For 47634/47634 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4710 event pairs, 90 based on Foata normal form. 2/1002 useless extension candidates. Maximal degree in co-relation 7496. Up to 841 conditions per place. [2024-06-03 20:37:57,809 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 169 selfloop transitions, 45 changer transitions 0/216 dead transitions. [2024-06-03 20:37:57,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 216 transitions, 3007 flow [2024-06-03 20:37:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:37:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:37:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-03 20:37:57,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3400673400673401 [2024-06-03 20:37:57,810 INFO L175 Difference]: Start difference. First operand has 220 places, 201 transitions, 2477 flow. Second operand 9 states and 101 transitions. [2024-06-03 20:37:57,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 216 transitions, 3007 flow [2024-06-03 20:37:57,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 216 transitions, 2853 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-03 20:37:57,921 INFO L231 Difference]: Finished difference. Result has 221 places, 203 transitions, 2466 flow [2024-06-03 20:37:57,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2323, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2466, PETRI_PLACES=221, PETRI_TRANSITIONS=203} [2024-06-03 20:37:57,922 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 189 predicate places. [2024-06-03 20:37:57,922 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 203 transitions, 2466 flow [2024-06-03 20:37:57,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:37:57,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:37:57,922 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 20:37:57,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 20:37:57,923 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 20:37:57,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:37:57,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1009460100, now seen corresponding path program 10 times [2024-06-03 20:37:57,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:37:57,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163309589] [2024-06-03 20:37:57,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:37:57,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:37:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:38:02,231 INFO 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 20:38:02,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:38:02,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163309589] [2024-06-03 20:38:02,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163309589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:38:02,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:38:02,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:38:02,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409890969] [2024-06-03 20:38:02,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:38:02,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:38:02,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:38:02,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:38:02,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:38:02,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:38:02,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 203 transitions, 2466 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:02,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:38:02,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:38:02,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:38:02,986 INFO L124 PetriNetUnfolderBase]: 597/1042 cut-off events. [2024-06-03 20:38:02,986 INFO L125 PetriNetUnfolderBase]: For 55631/55631 co-relation queries the response was YES. [2024-06-03 20:38:02,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8129 conditions, 1042 events. 597/1042 cut-off events. For 55631/55631 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4963 event pairs, 77 based on Foata normal form. 2/1044 useless extension candidates. Maximal degree in co-relation 8024. Up to 595 conditions per place. [2024-06-03 20:38:02,993 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 131 selfloop transitions, 98 changer transitions 0/231 dead transitions. [2024-06-03 20:38:02,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 231 transitions, 3518 flow [2024-06-03 20:38:02,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:38:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:38:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-03 20:38:02,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38047138047138046 [2024-06-03 20:38:02,994 INFO L175 Difference]: Start difference. First operand has 221 places, 203 transitions, 2466 flow. Second operand 9 states and 113 transitions. [2024-06-03 20:38:02,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 231 transitions, 3518 flow [2024-06-03 20:38:03,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 231 transitions, 3319 flow, removed 34 selfloop flow, removed 9 redundant places. [2024-06-03 20:38:03,100 INFO L231 Difference]: Finished difference. Result has 221 places, 211 transitions, 2676 flow [2024-06-03 20:38:03,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2287, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2676, PETRI_PLACES=221, PETRI_TRANSITIONS=211} [2024-06-03 20:38:03,100 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 189 predicate places. [2024-06-03 20:38:03,101 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 211 transitions, 2676 flow [2024-06-03 20:38:03,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:03,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:38:03,101 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 20:38:03,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 20:38:03,101 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 20:38:03,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:38:03,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1009466610, now seen corresponding path program 11 times [2024-06-03 20:38:03,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:38:03,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640412388] [2024-06-03 20:38:03,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:38:03,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:38:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:38:07,024 INFO 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 20:38:07,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:38:07,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640412388] [2024-06-03 20:38:07,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640412388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:38:07,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:38:07,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:38:07,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056572073] [2024-06-03 20:38:07,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:38:07,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:38:07,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:38:07,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:38:07,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:38:07,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:38:07,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 211 transitions, 2676 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:07,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:38:07,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:38:07,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:38:07,631 INFO L124 PetriNetUnfolderBase]: 593/1036 cut-off events. [2024-06-03 20:38:07,631 INFO L125 PetriNetUnfolderBase]: For 51224/51224 co-relation queries the response was YES. [2024-06-03 20:38:07,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7937 conditions, 1036 events. 593/1036 cut-off events. For 51224/51224 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4925 event pairs, 66 based on Foata normal form. 2/1038 useless extension candidates. Maximal degree in co-relation 7833. Up to 762 conditions per place. [2024-06-03 20:38:07,638 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 147 selfloop transitions, 77 changer transitions 0/226 dead transitions. [2024-06-03 20:38:07,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 226 transitions, 3194 flow [2024-06-03 20:38:07,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:38:07,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:38:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-03 20:38:07,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3501683501683502 [2024-06-03 20:38:07,639 INFO L175 Difference]: Start difference. First operand has 221 places, 211 transitions, 2676 flow. Second operand 9 states and 104 transitions. [2024-06-03 20:38:07,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 226 transitions, 3194 flow [2024-06-03 20:38:07,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 226 transitions, 3056 flow, removed 45 selfloop flow, removed 3 redundant places. [2024-06-03 20:38:07,751 INFO L231 Difference]: Finished difference. Result has 227 places, 211 transitions, 2697 flow [2024-06-03 20:38:07,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2538, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2697, PETRI_PLACES=227, PETRI_TRANSITIONS=211} [2024-06-03 20:38:07,752 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 195 predicate places. [2024-06-03 20:38:07,752 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 211 transitions, 2697 flow [2024-06-03 20:38:07,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:07,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:38:07,752 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 20:38:07,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 20:38:07,752 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 20:38:07,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:38:07,753 INFO L85 PathProgramCache]: Analyzing trace with hash -377303938, now seen corresponding path program 12 times [2024-06-03 20:38:07,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:38:07,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676616782] [2024-06-03 20:38:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:38:07,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:38:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:38:11,667 INFO 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 20:38:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:38:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676616782] [2024-06-03 20:38:11,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676616782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:38:11,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:38:11,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:38:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766208316] [2024-06-03 20:38:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:38:11,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:38:11,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:38:11,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:38:11,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:38:11,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:38:11,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 211 transitions, 2697 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:11,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:38:11,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:38:11,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:38:12,309 INFO L124 PetriNetUnfolderBase]: 599/1046 cut-off events. [2024-06-03 20:38:12,309 INFO L125 PetriNetUnfolderBase]: For 52731/52731 co-relation queries the response was YES. [2024-06-03 20:38:12,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8106 conditions, 1046 events. 599/1046 cut-off events. For 52731/52731 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4985 event pairs, 91 based on Foata normal form. 2/1048 useless extension candidates. Maximal degree in co-relation 8000. Up to 870 conditions per place. [2024-06-03 20:38:12,317 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 176 selfloop transitions, 50 changer transitions 0/228 dead transitions. [2024-06-03 20:38:12,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 228 transitions, 3271 flow [2024-06-03 20:38:12,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:38:12,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:38:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-03 20:38:12,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35353535353535354 [2024-06-03 20:38:12,318 INFO L175 Difference]: Start difference. First operand has 227 places, 211 transitions, 2697 flow. Second operand 9 states and 105 transitions. [2024-06-03 20:38:12,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 228 transitions, 3271 flow [2024-06-03 20:38:12,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 228 transitions, 3112 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-03 20:38:12,454 INFO L231 Difference]: Finished difference. Result has 228 places, 213 transitions, 2697 flow [2024-06-03 20:38:12,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2538, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2697, PETRI_PLACES=228, PETRI_TRANSITIONS=213} [2024-06-03 20:38:12,455 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 196 predicate places. [2024-06-03 20:38:12,455 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 213 transitions, 2697 flow [2024-06-03 20:38:12,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:12,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:38:12,456 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 20:38:12,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 20:38:12,456 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 20:38:12,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:38:12,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1009220532, now seen corresponding path program 3 times [2024-06-03 20:38:12,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:38:12,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864862238] [2024-06-03 20:38:12,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:38:12,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:38:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:38:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:38:17,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:38:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864862238] [2024-06-03 20:38:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864862238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:38:17,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:38:17,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:38:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554073940] [2024-06-03 20:38:17,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:38:17,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:38:17,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:38:17,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:38:17,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:38:17,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:38:17,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 213 transitions, 2697 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:17,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:38:17,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:38:17,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:38:18,519 INFO L124 PetriNetUnfolderBase]: 605/1056 cut-off events. [2024-06-03 20:38:18,520 INFO L125 PetriNetUnfolderBase]: For 55790/55790 co-relation queries the response was YES. [2024-06-03 20:38:18,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8141 conditions, 1056 events. 605/1056 cut-off events. For 55790/55790 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5096 event pairs, 117 based on Foata normal form. 2/1058 useless extension candidates. Maximal degree in co-relation 8034. Up to 933 conditions per place. [2024-06-03 20:38:18,529 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 185 selfloop transitions, 42 changer transitions 0/229 dead transitions. [2024-06-03 20:38:18,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 229 transitions, 3237 flow [2024-06-03 20:38:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:38:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:38:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-03 20:38:18,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3242424242424242 [2024-06-03 20:38:18,530 INFO L175 Difference]: Start difference. First operand has 228 places, 213 transitions, 2697 flow. Second operand 10 states and 107 transitions. [2024-06-03 20:38:18,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 229 transitions, 3237 flow [2024-06-03 20:38:18,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 229 transitions, 3098 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-03 20:38:18,669 INFO L231 Difference]: Finished difference. Result has 231 places, 215 transitions, 2687 flow [2024-06-03 20:38:18,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2558, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2687, PETRI_PLACES=231, PETRI_TRANSITIONS=215} [2024-06-03 20:38:18,671 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 199 predicate places. [2024-06-03 20:38:18,671 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 215 transitions, 2687 flow [2024-06-03 20:38:18,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:18,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:38:18,672 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 20:38:18,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 20:38:18,672 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 20:38:18,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:38:18,672 INFO L85 PathProgramCache]: Analyzing trace with hash -377297180, now seen corresponding path program 3 times [2024-06-03 20:38:18,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:38:18,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440093281] [2024-06-03 20:38:18,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:38:18,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:38:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:38:24,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:38:24,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:38:24,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440093281] [2024-06-03 20:38:24,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440093281] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:38:24,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:38:24,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:38:24,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954015492] [2024-06-03 20:38:24,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:38:24,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:38:24,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:38:24,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:38:24,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:38:24,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:38:24,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 215 transitions, 2687 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:24,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:38:24,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:38:24,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:38:25,097 INFO L124 PetriNetUnfolderBase]: 603/1053 cut-off events. [2024-06-03 20:38:25,097 INFO L125 PetriNetUnfolderBase]: For 54393/54393 co-relation queries the response was YES. [2024-06-03 20:38:25,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8029 conditions, 1053 events. 603/1053 cut-off events. For 54393/54393 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5074 event pairs, 135 based on Foata normal form. 1/1054 useless extension candidates. Maximal degree in co-relation 7921. Up to 959 conditions per place. [2024-06-03 20:38:25,107 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 193 selfloop transitions, 33 changer transitions 0/228 dead transitions. [2024-06-03 20:38:25,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 228 transitions, 3216 flow [2024-06-03 20:38:25,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:38:25,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:38:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-03 20:38:25,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3265993265993266 [2024-06-03 20:38:25,109 INFO L175 Difference]: Start difference. First operand has 231 places, 215 transitions, 2687 flow. Second operand 9 states and 97 transitions. [2024-06-03 20:38:25,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 228 transitions, 3216 flow [2024-06-03 20:38:25,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 228 transitions, 3109 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-03 20:38:25,249 INFO L231 Difference]: Finished difference. Result has 232 places, 217 transitions, 2699 flow [2024-06-03 20:38:25,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2699, PETRI_PLACES=232, PETRI_TRANSITIONS=217} [2024-06-03 20:38:25,250 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 200 predicate places. [2024-06-03 20:38:25,250 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 217 transitions, 2699 flow [2024-06-03 20:38:25,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:25,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:38:25,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:38:25,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 20:38:25,251 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 20:38:25,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:38:25,251 INFO L85 PathProgramCache]: Analyzing trace with hash -377297428, now seen corresponding path program 13 times [2024-06-03 20:38:25,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:38:25,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679952970] [2024-06-03 20:38:25,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:38:25,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:38:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:38:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:38:29,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:38:29,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679952970] [2024-06-03 20:38:29,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679952970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:38:29,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:38:29,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:38:29,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099241014] [2024-06-03 20:38:29,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:38:29,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:38:29,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:38:29,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:38:29,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:38:29,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:38:29,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 217 transitions, 2699 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:29,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:38:29,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:38:29,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:38:30,129 INFO L124 PetriNetUnfolderBase]: 599/1047 cut-off events. [2024-06-03 20:38:30,129 INFO L125 PetriNetUnfolderBase]: For 53351/53351 co-relation queries the response was YES. [2024-06-03 20:38:30,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7873 conditions, 1047 events. 599/1047 cut-off events. For 53351/53351 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5017 event pairs, 90 based on Foata normal form. 2/1049 useless extension candidates. Maximal degree in co-relation 7764. Up to 844 conditions per place. [2024-06-03 20:38:30,138 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 175 selfloop transitions, 56 changer transitions 0/233 dead transitions. [2024-06-03 20:38:30,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 233 transitions, 3239 flow [2024-06-03 20:38:30,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:38:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:38:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-03 20:38:30,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3602693602693603 [2024-06-03 20:38:30,139 INFO L175 Difference]: Start difference. First operand has 232 places, 217 transitions, 2699 flow. Second operand 9 states and 107 transitions. [2024-06-03 20:38:30,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 233 transitions, 3239 flow [2024-06-03 20:38:30,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 233 transitions, 3143 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-03 20:38:30,257 INFO L231 Difference]: Finished difference. Result has 234 places, 217 transitions, 2721 flow [2024-06-03 20:38:30,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2603, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2721, PETRI_PLACES=234, PETRI_TRANSITIONS=217} [2024-06-03 20:38:30,258 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 202 predicate places. [2024-06-03 20:38:30,258 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 217 transitions, 2721 flow [2024-06-03 20:38:30,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:30,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:38:30,258 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 20:38:30,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 20:38:30,258 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 20:38:30,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:38:30,259 INFO L85 PathProgramCache]: Analyzing trace with hash -370801750, now seen corresponding path program 4 times [2024-06-03 20:38:30,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:38:30,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605253302] [2024-06-03 20:38:30,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:38:30,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:38:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:38:35,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:38:35,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:38:35,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605253302] [2024-06-03 20:38:35,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605253302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:38:35,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:38:35,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:38:35,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140842657] [2024-06-03 20:38:35,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:38:35,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:38:35,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:38:35,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:38:35,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:38:35,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:38:35,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 217 transitions, 2721 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:35,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:38:35,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:38:35,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:38:36,494 INFO L124 PetriNetUnfolderBase]: 605/1057 cut-off events. [2024-06-03 20:38:36,494 INFO L125 PetriNetUnfolderBase]: For 54897/54897 co-relation queries the response was YES. [2024-06-03 20:38:36,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7988 conditions, 1057 events. 605/1057 cut-off events. For 54897/54897 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5109 event pairs, 134 based on Foata normal form. 2/1059 useless extension candidates. Maximal degree in co-relation 7878. Up to 964 conditions per place. [2024-06-03 20:38:36,504 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 199 selfloop transitions, 29 changer transitions 0/230 dead transitions. [2024-06-03 20:38:36,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 230 transitions, 3253 flow [2024-06-03 20:38:36,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:38:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:38:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-03 20:38:36,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3265993265993266 [2024-06-03 20:38:36,505 INFO L175 Difference]: Start difference. First operand has 234 places, 217 transitions, 2721 flow. Second operand 9 states and 97 transitions. [2024-06-03 20:38:36,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 230 transitions, 3253 flow [2024-06-03 20:38:36,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 230 transitions, 2980 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-03 20:38:36,660 INFO L231 Difference]: Finished difference. Result has 234 places, 219 transitions, 2556 flow [2024-06-03 20:38:36,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2448, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2556, PETRI_PLACES=234, PETRI_TRANSITIONS=219} [2024-06-03 20:38:36,661 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 202 predicate places. [2024-06-03 20:38:36,661 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 219 transitions, 2556 flow [2024-06-03 20:38:36,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:36,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:38:36,662 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 20:38:36,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 20:38:36,662 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 20:38:36,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:38:36,662 INFO L85 PathProgramCache]: Analyzing trace with hash -724129590, now seen corresponding path program 14 times [2024-06-03 20:38:36,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:38:36,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718225242] [2024-06-03 20:38:36,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:38:36,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:38:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:38:40,625 INFO 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 20:38:40,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:38:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718225242] [2024-06-03 20:38:40,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718225242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:38:40,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:38:40,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:38:40,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650623824] [2024-06-03 20:38:40,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:38:40,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:38:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:38:40,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:38:40,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:38:40,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:38:40,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 219 transitions, 2556 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:40,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:38:40,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:38:40,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:38:41,188 INFO L124 PetriNetUnfolderBase]: 601/1051 cut-off events. [2024-06-03 20:38:41,188 INFO L125 PetriNetUnfolderBase]: For 51741/51741 co-relation queries the response was YES. [2024-06-03 20:38:41,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7553 conditions, 1051 events. 601/1051 cut-off events. For 51741/51741 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5072 event pairs, 204 based on Foata normal form. 2/1053 useless extension candidates. Maximal degree in co-relation 7443. Up to 1017 conditions per place. [2024-06-03 20:38:41,198 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 212 selfloop transitions, 15 changer transitions 0/229 dead transitions. [2024-06-03 20:38:41,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 229 transitions, 3042 flow [2024-06-03 20:38:41,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:38:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:38:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-03 20:38:41,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3063973063973064 [2024-06-03 20:38:41,199 INFO L175 Difference]: Start difference. First operand has 234 places, 219 transitions, 2556 flow. Second operand 9 states and 91 transitions. [2024-06-03 20:38:41,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 229 transitions, 3042 flow [2024-06-03 20:38:41,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 229 transitions, 2928 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-03 20:38:41,325 INFO L231 Difference]: Finished difference. Result has 236 places, 219 transitions, 2477 flow [2024-06-03 20:38:41,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2442, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2477, PETRI_PLACES=236, PETRI_TRANSITIONS=219} [2024-06-03 20:38:41,325 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 204 predicate places. [2024-06-03 20:38:41,325 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 219 transitions, 2477 flow [2024-06-03 20:38:41,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:41,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:38:41,326 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 20:38:41,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-03 20:38:41,326 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 20:38:41,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:38:41,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1269853568, now seen corresponding path program 5 times [2024-06-03 20:38:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:38:41,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614638517] [2024-06-03 20:38:41,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:38:41,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:38:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:38:46,742 INFO 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 20:38:46,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:38:46,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614638517] [2024-06-03 20:38:46,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614638517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:38:46,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:38:46,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:38:46,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352767352] [2024-06-03 20:38:46,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:38:46,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:38:46,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:38:46,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:38:46,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:38:46,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:38:46,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 219 transitions, 2477 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:46,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:38:46,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:38:46,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:38:47,512 INFO L124 PetriNetUnfolderBase]: 602/1053 cut-off events. [2024-06-03 20:38:47,512 INFO L125 PetriNetUnfolderBase]: For 51469/51469 co-relation queries the response was YES. [2024-06-03 20:38:47,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7461 conditions, 1053 events. 602/1053 cut-off events. For 51469/51469 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5079 event pairs, 201 based on Foata normal form. 2/1055 useless extension candidates. Maximal degree in co-relation 7350. Up to 980 conditions per place. [2024-06-03 20:38:47,521 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 209 selfloop transitions, 24 changer transitions 0/235 dead transitions. [2024-06-03 20:38:47,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 235 transitions, 3147 flow [2024-06-03 20:38:47,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:38:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:38:47,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-03 20:38:47,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3242424242424242 [2024-06-03 20:38:47,523 INFO L175 Difference]: Start difference. First operand has 236 places, 219 transitions, 2477 flow. Second operand 10 states and 107 transitions. [2024-06-03 20:38:47,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 235 transitions, 3147 flow [2024-06-03 20:38:47,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 235 transitions, 3106 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-03 20:38:47,645 INFO L231 Difference]: Finished difference. Result has 238 places, 221 transitions, 2537 flow [2024-06-03 20:38:47,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2436, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2537, PETRI_PLACES=238, PETRI_TRANSITIONS=221} [2024-06-03 20:38:47,645 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 206 predicate places. [2024-06-03 20:38:47,645 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 221 transitions, 2537 flow [2024-06-03 20:38:47,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:47,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:38:47,646 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 20:38:47,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-03 20:38:47,646 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 20:38:47,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:38:47,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1259734238, now seen corresponding path program 6 times [2024-06-03 20:38:47,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:38:47,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292108130] [2024-06-03 20:38:47,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:38:47,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:38:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:38:52,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 20:38:52,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:38:52,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292108130] [2024-06-03 20:38:52,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292108130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:38:52,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:38:52,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:38:52,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479139241] [2024-06-03 20:38:52,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:38:52,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:38:52,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:38:52,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:38:52,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:38:53,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:38:53,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 221 transitions, 2537 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:53,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:38:53,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:38:53,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:38:53,443 INFO L124 PetriNetUnfolderBase]: 598/1047 cut-off events. [2024-06-03 20:38:53,444 INFO L125 PetriNetUnfolderBase]: For 49839/49839 co-relation queries the response was YES. [2024-06-03 20:38:53,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7374 conditions, 1047 events. 598/1047 cut-off events. For 49839/49839 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5050 event pairs, 205 based on Foata normal form. 2/1049 useless extension candidates. Maximal degree in co-relation 7262. Up to 999 conditions per place. [2024-06-03 20:38:53,477 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 210 selfloop transitions, 20 changer transitions 0/232 dead transitions. [2024-06-03 20:38:53,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 232 transitions, 3029 flow [2024-06-03 20:38:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:38:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:38:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2024-06-03 20:38:53,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30606060606060603 [2024-06-03 20:38:53,478 INFO L175 Difference]: Start difference. First operand has 238 places, 221 transitions, 2537 flow. Second operand 10 states and 101 transitions. [2024-06-03 20:38:53,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 232 transitions, 3029 flow [2024-06-03 20:38:53,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 232 transitions, 2942 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-03 20:38:53,600 INFO L231 Difference]: Finished difference. Result has 240 places, 221 transitions, 2498 flow [2024-06-03 20:38:53,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2450, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2498, PETRI_PLACES=240, PETRI_TRANSITIONS=221} [2024-06-03 20:38:53,600 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 208 predicate places. [2024-06-03 20:38:53,601 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 221 transitions, 2498 flow [2024-06-03 20:38:53,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:38:53,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:38:53,601 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 20:38:53,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-03 20:38:53,601 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 20:38:53,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:38:53,602 INFO L85 PathProgramCache]: Analyzing trace with hash 115091121, now seen corresponding path program 1 times [2024-06-03 20:38:53,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:38:53,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468207454] [2024-06-03 20:38:53,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:38:53,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:38:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:38:57,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 20:38:57,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:38:57,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468207454] [2024-06-03 20:38:57,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468207454] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:38:57,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:38:57,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:38:57,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000875392] [2024-06-03 20:38:57,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:38:57,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:38:57,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:38:57,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:38:57,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:38:57,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-03 20:38:57,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 221 transitions, 2498 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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 20:38:57,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:38:57,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-03 20:38:57,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:38:57,698 INFO L124 PetriNetUnfolderBase]: 592/1043 cut-off events. [2024-06-03 20:38:57,698 INFO L125 PetriNetUnfolderBase]: For 51774/51779 co-relation queries the response was YES. [2024-06-03 20:38:57,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7319 conditions, 1043 events. 592/1043 cut-off events. For 51774/51779 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5082 event pairs, 83 based on Foata normal form. 6/1047 useless extension candidates. Maximal degree in co-relation 7206. Up to 831 conditions per place. [2024-06-03 20:38:57,707 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 179 selfloop transitions, 44 changer transitions 0/233 dead transitions. [2024-06-03 20:38:57,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 233 transitions, 2990 flow [2024-06-03 20:38:57,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:38:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:38:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-03 20:38:57,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3560606060606061 [2024-06-03 20:38:57,708 INFO L175 Difference]: Start difference. First operand has 240 places, 221 transitions, 2498 flow. Second operand 8 states and 94 transitions. [2024-06-03 20:38:57,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 233 transitions, 2990 flow [2024-06-03 20:38:57,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 233 transitions, 2950 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-03 20:38:57,841 INFO L231 Difference]: Finished difference. Result has 239 places, 222 transitions, 2569 flow [2024-06-03 20:38:57,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2458, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2569, PETRI_PLACES=239, PETRI_TRANSITIONS=222} [2024-06-03 20:38:57,842 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 207 predicate places. [2024-06-03 20:38:57,842 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 222 transitions, 2569 flow [2024-06-03 20:38:57,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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 20:38:57,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:38:57,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:38:57,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-03 20:38:57,843 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 20:38:57,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:38:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1169205169, now seen corresponding path program 2 times [2024-06-03 20:38:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:38:57,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000547774] [2024-06-03 20:38:57,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:38:57,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:38:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:39:02,157 INFO 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 20:39:02,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:39:02,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000547774] [2024-06-03 20:39:02,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000547774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:39:02,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:39:02,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:39:02,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393712467] [2024-06-03 20:39:02,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:39:02,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:39:02,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:39:02,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:39:02,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:39:02,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:39:02,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 222 transitions, 2569 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:02,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:39:02,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:39:02,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:39:02,720 INFO L124 PetriNetUnfolderBase]: 606/1063 cut-off events. [2024-06-03 20:39:02,721 INFO L125 PetriNetUnfolderBase]: For 53274/53274 co-relation queries the response was YES. [2024-06-03 20:39:02,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7550 conditions, 1063 events. 606/1063 cut-off events. For 53274/53274 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5156 event pairs, 117 based on Foata normal form. 2/1065 useless extension candidates. Maximal degree in co-relation 7436. Up to 944 conditions per place. [2024-06-03 20:39:02,730 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 203 selfloop transitions, 37 changer transitions 0/242 dead transitions. [2024-06-03 20:39:02,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 242 transitions, 3131 flow [2024-06-03 20:39:02,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:39:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:39:02,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-03 20:39:02,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325068870523416 [2024-06-03 20:39:02,731 INFO L175 Difference]: Start difference. First operand has 239 places, 222 transitions, 2569 flow. Second operand 11 states and 118 transitions. [2024-06-03 20:39:02,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 242 transitions, 3131 flow [2024-06-03 20:39:02,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 242 transitions, 3032 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 20:39:02,868 INFO L231 Difference]: Finished difference. Result has 244 places, 223 transitions, 2569 flow [2024-06-03 20:39:02,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2470, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2569, PETRI_PLACES=244, PETRI_TRANSITIONS=223} [2024-06-03 20:39:02,869 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 212 predicate places. [2024-06-03 20:39:02,869 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 223 transitions, 2569 flow [2024-06-03 20:39:02,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:02,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:39:02,870 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 20:39:02,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-03 20:39:02,870 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 20:39:02,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:39:02,870 INFO L85 PathProgramCache]: Analyzing trace with hash 254295417, now seen corresponding path program 3 times [2024-06-03 20:39:02,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:39:02,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317202917] [2024-06-03 20:39:02,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:39:02,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:39:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:39:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:39:06,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:39:06,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317202917] [2024-06-03 20:39:06,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317202917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:39:06,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:39:06,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:39:06,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108917671] [2024-06-03 20:39:06,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:39:06,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:39:06,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:39:06,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:39:06,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:39:06,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:39:06,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 223 transitions, 2569 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:06,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:39:06,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:39:06,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:39:07,354 INFO L124 PetriNetUnfolderBase]: 610/1071 cut-off events. [2024-06-03 20:39:07,355 INFO L125 PetriNetUnfolderBase]: For 55557/55557 co-relation queries the response was YES. [2024-06-03 20:39:07,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7597 conditions, 1071 events. 610/1071 cut-off events. For 55557/55557 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5235 event pairs, 117 based on Foata normal form. 2/1073 useless extension candidates. Maximal degree in co-relation 7482. Up to 955 conditions per place. [2024-06-03 20:39:07,364 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 207 selfloop transitions, 34 changer transitions 0/243 dead transitions. [2024-06-03 20:39:07,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 243 transitions, 3129 flow [2024-06-03 20:39:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:39:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:39:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-03 20:39:07,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32231404958677684 [2024-06-03 20:39:07,366 INFO L175 Difference]: Start difference. First operand has 244 places, 223 transitions, 2569 flow. Second operand 11 states and 117 transitions. [2024-06-03 20:39:07,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 243 transitions, 3129 flow [2024-06-03 20:39:07,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 243 transitions, 3037 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-03 20:39:07,509 INFO L231 Difference]: Finished difference. Result has 246 places, 224 transitions, 2571 flow [2024-06-03 20:39:07,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2477, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2571, PETRI_PLACES=246, PETRI_TRANSITIONS=224} [2024-06-03 20:39:07,510 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 214 predicate places. [2024-06-03 20:39:07,510 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 224 transitions, 2571 flow [2024-06-03 20:39:07,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:07,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:39:07,510 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 20:39:07,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-03 20:39:07,511 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 20:39:07,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:39:07,511 INFO L85 PathProgramCache]: Analyzing trace with hash 892093488, now seen corresponding path program 1 times [2024-06-03 20:39:07,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:39:07,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116317992] [2024-06-03 20:39:07,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:39:07,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:39:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:39:11,863 INFO 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 20:39:11,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:39:11,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116317992] [2024-06-03 20:39:11,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116317992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:39:11,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:39:11,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:39:11,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635297471] [2024-06-03 20:39:11,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:39:11,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:39:11,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:39:11,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:39:11,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:39:12,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:39:12,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 224 transitions, 2571 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:12,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:39:12,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:39:12,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:39:12,525 INFO L124 PetriNetUnfolderBase]: 613/1076 cut-off events. [2024-06-03 20:39:12,525 INFO L125 PetriNetUnfolderBase]: For 55331/55331 co-relation queries the response was YES. [2024-06-03 20:39:12,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7647 conditions, 1076 events. 613/1076 cut-off events. For 55331/55331 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5261 event pairs, 116 based on Foata normal form. 1/1077 useless extension candidates. Maximal degree in co-relation 7531. Up to 928 conditions per place. [2024-06-03 20:39:12,534 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 197 selfloop transitions, 46 changer transitions 0/245 dead transitions. [2024-06-03 20:39:12,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 245 transitions, 3171 flow [2024-06-03 20:39:12,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:39:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:39:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-03 20:39:12,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3278236914600551 [2024-06-03 20:39:12,536 INFO L175 Difference]: Start difference. First operand has 246 places, 224 transitions, 2571 flow. Second operand 11 states and 119 transitions. [2024-06-03 20:39:12,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 245 transitions, 3171 flow [2024-06-03 20:39:12,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 245 transitions, 3088 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-03 20:39:12,688 INFO L231 Difference]: Finished difference. Result has 249 places, 226 transitions, 2642 flow [2024-06-03 20:39:12,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2488, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2642, PETRI_PLACES=249, PETRI_TRANSITIONS=226} [2024-06-03 20:39:12,689 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 217 predicate places. [2024-06-03 20:39:12,689 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 226 transitions, 2642 flow [2024-06-03 20:39:12,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:12,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:39:12,689 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 20:39:12,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-03 20:39:12,689 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 20:39:12,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:39:12,690 INFO L85 PathProgramCache]: Analyzing trace with hash 896769745, now seen corresponding path program 1 times [2024-06-03 20:39:12,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:39:12,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963449978] [2024-06-03 20:39:12,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:39:12,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:39:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:39:17,995 INFO 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 20:39:17,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:39:17,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963449978] [2024-06-03 20:39:17,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963449978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:39:17,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:39:17,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:39:17,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772368946] [2024-06-03 20:39:17,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:39:17,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:39:17,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:39:17,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:39:17,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:39:18,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:39:18,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 226 transitions, 2642 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:18,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:39:18,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:39:18,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:39:18,782 INFO L124 PetriNetUnfolderBase]: 619/1086 cut-off events. [2024-06-03 20:39:18,782 INFO L125 PetriNetUnfolderBase]: For 58914/58914 co-relation queries the response was YES. [2024-06-03 20:39:18,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7775 conditions, 1086 events. 619/1086 cut-off events. For 58914/58914 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5320 event pairs, 115 based on Foata normal form. 2/1088 useless extension candidates. Maximal degree in co-relation 7658. Up to 971 conditions per place. [2024-06-03 20:39:18,793 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 212 selfloop transitions, 35 changer transitions 0/249 dead transitions. [2024-06-03 20:39:18,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 249 transitions, 3254 flow [2024-06-03 20:39:18,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 20:39:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 20:39:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-03 20:39:18,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32323232323232326 [2024-06-03 20:39:18,816 INFO L175 Difference]: Start difference. First operand has 249 places, 226 transitions, 2642 flow. Second operand 12 states and 128 transitions. [2024-06-03 20:39:18,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 249 transitions, 3254 flow [2024-06-03 20:39:19,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 249 transitions, 3146 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-03 20:39:19,004 INFO L231 Difference]: Finished difference. Result has 252 places, 228 transitions, 2651 flow [2024-06-03 20:39:19,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2534, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2651, PETRI_PLACES=252, PETRI_TRANSITIONS=228} [2024-06-03 20:39:19,005 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 220 predicate places. [2024-06-03 20:39:19,005 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 228 transitions, 2651 flow [2024-06-03 20:39:19,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:19,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:39:19,005 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 20:39:19,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-03 20:39:19,005 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 20:39:19,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:39:19,006 INFO L85 PathProgramCache]: Analyzing trace with hash -962232753, now seen corresponding path program 4 times [2024-06-03 20:39:19,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:39:19,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957744850] [2024-06-03 20:39:19,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:39:19,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:39:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:39:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:39:22,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:39:22,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957744850] [2024-06-03 20:39:22,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957744850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:39:22,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:39:22,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:39:22,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10561494] [2024-06-03 20:39:22,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:39:22,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:39:22,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:39:22,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:39:22,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:39:22,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:39:22,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 228 transitions, 2651 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:22,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:39:22,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:39:22,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:39:23,335 INFO L124 PetriNetUnfolderBase]: 623/1094 cut-off events. [2024-06-03 20:39:23,335 INFO L125 PetriNetUnfolderBase]: For 60514/60514 co-relation queries the response was YES. [2024-06-03 20:39:23,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7847 conditions, 1094 events. 623/1094 cut-off events. For 60514/60514 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5361 event pairs, 91 based on Foata normal form. 2/1096 useless extension candidates. Maximal degree in co-relation 7729. Up to 993 conditions per place. [2024-06-03 20:39:23,345 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 216 selfloop transitions, 29 changer transitions 0/247 dead transitions. [2024-06-03 20:39:23,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 247 transitions, 3231 flow [2024-06-03 20:39:23,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:39:23,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:39:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-03 20:39:23,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33636363636363636 [2024-06-03 20:39:23,347 INFO L175 Difference]: Start difference. First operand has 252 places, 228 transitions, 2651 flow. Second operand 10 states and 111 transitions. [2024-06-03 20:39:23,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 247 transitions, 3231 flow [2024-06-03 20:39:23,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 247 transitions, 3126 flow, removed 19 selfloop flow, removed 10 redundant places. [2024-06-03 20:39:23,524 INFO L231 Difference]: Finished difference. Result has 252 places, 229 transitions, 2633 flow [2024-06-03 20:39:23,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2546, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2633, PETRI_PLACES=252, PETRI_TRANSITIONS=229} [2024-06-03 20:39:23,525 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 220 predicate places. [2024-06-03 20:39:23,525 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 229 transitions, 2633 flow [2024-06-03 20:39:23,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:23,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:39:23,525 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 20:39:23,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-03 20:39:23,526 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 20:39:23,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:39:23,526 INFO L85 PathProgramCache]: Analyzing trace with hash -962236473, now seen corresponding path program 5 times [2024-06-03 20:39:23,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:39:23,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642264996] [2024-06-03 20:39:23,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:39:23,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:39:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:39:27,253 INFO 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 20:39:27,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:39:27,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642264996] [2024-06-03 20:39:27,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642264996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:39:27,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:39:27,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:39:27,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10115271] [2024-06-03 20:39:27,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:39:27,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:39:27,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:39:27,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:39:27,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:39:27,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:39:27,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 229 transitions, 2633 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:27,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:39:27,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:39:27,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:39:27,991 INFO L124 PetriNetUnfolderBase]: 627/1102 cut-off events. [2024-06-03 20:39:27,992 INFO L125 PetriNetUnfolderBase]: For 63292/63292 co-relation queries the response was YES. [2024-06-03 20:39:27,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7873 conditions, 1102 events. 627/1102 cut-off events. For 63292/63292 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5422 event pairs, 89 based on Foata normal form. 2/1104 useless extension candidates. Maximal degree in co-relation 7755. Up to 1004 conditions per place. [2024-06-03 20:39:28,000 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 220 selfloop transitions, 26 changer transitions 0/248 dead transitions. [2024-06-03 20:39:28,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 248 transitions, 3211 flow [2024-06-03 20:39:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:39:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:39:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-03 20:39:28,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 20:39:28,001 INFO L175 Difference]: Start difference. First operand has 252 places, 229 transitions, 2633 flow. Second operand 10 states and 110 transitions. [2024-06-03 20:39:28,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 248 transitions, 3211 flow [2024-06-03 20:39:28,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 248 transitions, 3136 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-03 20:39:28,176 INFO L231 Difference]: Finished difference. Result has 254 places, 230 transitions, 2640 flow [2024-06-03 20:39:28,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2558, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2640, PETRI_PLACES=254, PETRI_TRANSITIONS=230} [2024-06-03 20:39:28,177 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 222 predicate places. [2024-06-03 20:39:28,177 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 230 transitions, 2640 flow [2024-06-03 20:39:28,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:28,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:39:28,177 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 20:39:28,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-03 20:39:28,178 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 20:39:28,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:39:28,178 INFO L85 PathProgramCache]: Analyzing trace with hash -875390841, now seen corresponding path program 2 times [2024-06-03 20:39:28,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:39:28,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287387421] [2024-06-03 20:39:28,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:39:28,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:39:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:39:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:39:35,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:39:35,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287387421] [2024-06-03 20:39:35,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287387421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:39:35,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:39:35,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:39:35,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529323498] [2024-06-03 20:39:35,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:39:35,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:39:35,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:39:35,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:39:35,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:39:35,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:39:35,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 230 transitions, 2640 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:35,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:39:35,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:39:35,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:39:35,965 INFO L124 PetriNetUnfolderBase]: 633/1112 cut-off events. [2024-06-03 20:39:35,965 INFO L125 PetriNetUnfolderBase]: For 65148/65148 co-relation queries the response was YES. [2024-06-03 20:39:35,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7947 conditions, 1112 events. 633/1112 cut-off events. For 65148/65148 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5464 event pairs, 91 based on Foata normal form. 2/1114 useless extension candidates. Maximal degree in co-relation 7828. Up to 1009 conditions per place. [2024-06-03 20:39:35,975 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 221 selfloop transitions, 29 changer transitions 0/252 dead transitions. [2024-06-03 20:39:35,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 252 transitions, 3266 flow [2024-06-03 20:39:35,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:39:35,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:39:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-03 20:39:35,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 20:39:35,976 INFO L175 Difference]: Start difference. First operand has 254 places, 230 transitions, 2640 flow. Second operand 11 states and 121 transitions. [2024-06-03 20:39:35,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 252 transitions, 3266 flow [2024-06-03 20:39:36,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 252 transitions, 3191 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-03 20:39:36,151 INFO L231 Difference]: Finished difference. Result has 257 places, 232 transitions, 2674 flow [2024-06-03 20:39:36,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2565, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2674, PETRI_PLACES=257, PETRI_TRANSITIONS=232} [2024-06-03 20:39:36,151 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 225 predicate places. [2024-06-03 20:39:36,152 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 232 transitions, 2674 flow [2024-06-03 20:39:36,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:36,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:39:36,152 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 20:39:36,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-03 20:39:36,152 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 20:39:36,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:39:36,153 INFO L85 PathProgramCache]: Analyzing trace with hash -875540788, now seen corresponding path program 2 times [2024-06-03 20:39:36,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:39:36,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072447047] [2024-06-03 20:39:36,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:39:36,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:39:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:39:40,697 INFO 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 20:39:40,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:39:40,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072447047] [2024-06-03 20:39:40,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072447047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:39:40,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:39:40,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:39:40,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362476649] [2024-06-03 20:39:40,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:39:40,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:39:40,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:39:40,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:39:40,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:39:40,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:39:40,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 232 transitions, 2674 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:40,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:39:40,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:39:40,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:39:41,380 INFO L124 PetriNetUnfolderBase]: 631/1109 cut-off events. [2024-06-03 20:39:41,380 INFO L125 PetriNetUnfolderBase]: For 62516/62516 co-relation queries the response was YES. [2024-06-03 20:39:41,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7874 conditions, 1109 events. 631/1109 cut-off events. For 62516/62516 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5471 event pairs, 91 based on Foata normal form. 1/1110 useless extension candidates. Maximal degree in co-relation 7754. Up to 1005 conditions per place. [2024-06-03 20:39:41,391 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 216 selfloop transitions, 32 changer transitions 0/250 dead transitions. [2024-06-03 20:39:41,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 250 transitions, 3244 flow [2024-06-03 20:39:41,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:39:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:39:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-03 20:39:41,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2024-06-03 20:39:41,392 INFO L175 Difference]: Start difference. First operand has 257 places, 232 transitions, 2674 flow. Second operand 10 states and 112 transitions. [2024-06-03 20:39:41,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 250 transitions, 3244 flow [2024-06-03 20:39:41,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 250 transitions, 3135 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-03 20:39:41,595 INFO L231 Difference]: Finished difference. Result has 258 places, 232 transitions, 2637 flow [2024-06-03 20:39:41,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2565, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2637, PETRI_PLACES=258, PETRI_TRANSITIONS=232} [2024-06-03 20:39:41,601 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 226 predicate places. [2024-06-03 20:39:41,602 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 232 transitions, 2637 flow [2024-06-03 20:39:41,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:41,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:39:41,602 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 20:39:41,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-03 20:39:41,602 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 20:39:41,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:39:41,603 INFO L85 PathProgramCache]: Analyzing trace with hash 27675501, now seen corresponding path program 3 times [2024-06-03 20:39:41,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:39:41,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064824813] [2024-06-03 20:39:41,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:39:41,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:39:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:39:47,208 INFO 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 20:39:47,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:39:47,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064824813] [2024-06-03 20:39:47,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064824813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:39:47,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:39:47,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:39:47,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18602129] [2024-06-03 20:39:47,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:39:47,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:39:47,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:39:47,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:39:47,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:39:47,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:39:47,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 232 transitions, 2637 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:47,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:39:47,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:39:47,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:39:47,919 INFO L124 PetriNetUnfolderBase]: 657/1151 cut-off events. [2024-06-03 20:39:47,919 INFO L125 PetriNetUnfolderBase]: For 76240/76240 co-relation queries the response was YES. [2024-06-03 20:39:47,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8463 conditions, 1151 events. 657/1151 cut-off events. For 76240/76240 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5689 event pairs, 77 based on Foata normal form. 2/1153 useless extension candidates. Maximal degree in co-relation 8342. Up to 839 conditions per place. [2024-06-03 20:39:47,927 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 181 selfloop transitions, 79 changer transitions 0/262 dead transitions. [2024-06-03 20:39:47,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 262 transitions, 3671 flow [2024-06-03 20:39:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:39:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:39:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-03 20:39:47,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-03 20:39:47,929 INFO L175 Difference]: Start difference. First operand has 258 places, 232 transitions, 2637 flow. Second operand 11 states and 132 transitions. [2024-06-03 20:39:47,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 262 transitions, 3671 flow [2024-06-03 20:39:48,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 262 transitions, 3601 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-03 20:39:48,169 INFO L231 Difference]: Finished difference. Result has 261 places, 238 transitions, 2872 flow [2024-06-03 20:39:48,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2567, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2872, PETRI_PLACES=261, PETRI_TRANSITIONS=238} [2024-06-03 20:39:48,170 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 229 predicate places. [2024-06-03 20:39:48,170 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 238 transitions, 2872 flow [2024-06-03 20:39:48,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:48,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:39:48,171 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 20:39:48,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-03 20:39:48,171 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 20:39:48,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:39:48,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1590759958, now seen corresponding path program 1 times [2024-06-03 20:39:48,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:39:48,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607988006] [2024-06-03 20:39:48,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:39:48,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:39:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:39:54,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 20:39:54,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:39:54,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607988006] [2024-06-03 20:39:54,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607988006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:39:54,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:39:54,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:39:54,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57925763] [2024-06-03 20:39:54,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:39:54,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:39:54,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:39:54,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:39:54,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:39:54,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-03 20:39:54,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 238 transitions, 2872 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:54,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:39:54,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-03 20:39:54,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:39:55,220 INFO L124 PetriNetUnfolderBase]: 660/1156 cut-off events. [2024-06-03 20:39:55,220 INFO L125 PetriNetUnfolderBase]: For 76695/76695 co-relation queries the response was YES. [2024-06-03 20:39:55,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8701 conditions, 1156 events. 660/1156 cut-off events. For 76695/76695 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5748 event pairs, 155 based on Foata normal form. 1/1157 useless extension candidates. Maximal degree in co-relation 8579. Up to 1010 conditions per place. [2024-06-03 20:39:55,230 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 201 selfloop transitions, 52 changer transitions 0/255 dead transitions. [2024-06-03 20:39:55,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 255 transitions, 3476 flow [2024-06-03 20:39:55,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:39:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:39:55,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-03 20:39:55,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3575757575757576 [2024-06-03 20:39:55,231 INFO L175 Difference]: Start difference. First operand has 261 places, 238 transitions, 2872 flow. Second operand 10 states and 118 transitions. [2024-06-03 20:39:55,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 255 transitions, 3476 flow [2024-06-03 20:39:55,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 255 transitions, 3352 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-03 20:39:55,460 INFO L231 Difference]: Finished difference. Result has 264 places, 240 transitions, 2916 flow [2024-06-03 20:39:55,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2748, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2916, PETRI_PLACES=264, PETRI_TRANSITIONS=240} [2024-06-03 20:39:55,461 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 232 predicate places. [2024-06-03 20:39:55,461 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 240 transitions, 2916 flow [2024-06-03 20:39:55,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:55,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:39:55,461 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 20:39:55,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-03 20:39:55,462 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 20:39:55,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:39:55,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1590975439, now seen corresponding path program 6 times [2024-06-03 20:39:55,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:39:55,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34339051] [2024-06-03 20:39:55,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:39:55,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:39:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:39:59,468 INFO 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 20:39:59,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:39:59,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34339051] [2024-06-03 20:39:59,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34339051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:39:59,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:39:59,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:39:59,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611832664] [2024-06-03 20:39:59,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:39:59,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:39:59,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:39:59,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:39:59,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:39:59,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:39:59,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 240 transitions, 2916 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:39:59,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:39:59,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:39:59,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:40:00,136 INFO L124 PetriNetUnfolderBase]: 664/1164 cut-off events. [2024-06-03 20:40:00,136 INFO L125 PetriNetUnfolderBase]: For 78881/78881 co-relation queries the response was YES. [2024-06-03 20:40:00,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8794 conditions, 1164 events. 664/1164 cut-off events. For 78881/78881 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5783 event pairs, 78 based on Foata normal form. 2/1166 useless extension candidates. Maximal degree in co-relation 8671. Up to 968 conditions per place. [2024-06-03 20:40:00,175 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 200 selfloop transitions, 58 changer transitions 0/260 dead transitions. [2024-06-03 20:40:00,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 260 transitions, 3536 flow [2024-06-03 20:40:00,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:40:00,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:40:00,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-03 20:40:00,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2024-06-03 20:40:00,178 INFO L175 Difference]: Start difference. First operand has 264 places, 240 transitions, 2916 flow. Second operand 10 states and 116 transitions. [2024-06-03 20:40:00,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 260 transitions, 3536 flow [2024-06-03 20:40:00,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 260 transitions, 3400 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-03 20:40:00,406 INFO L231 Difference]: Finished difference. Result has 265 places, 241 transitions, 2928 flow [2024-06-03 20:40:00,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2780, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2928, PETRI_PLACES=265, PETRI_TRANSITIONS=241} [2024-06-03 20:40:00,407 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 233 predicate places. [2024-06-03 20:40:00,407 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 241 transitions, 2928 flow [2024-06-03 20:40:00,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:00,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:40:00,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 20:40:00,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-03 20:40:00,408 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 20:40:00,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:40:00,409 INFO L85 PathProgramCache]: Analyzing trace with hash 21961209, now seen corresponding path program 7 times [2024-06-03 20:40:00,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:40:00,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984704378] [2024-06-03 20:40:00,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:40:00,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:40:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:40: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 20:40:04,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:40:04,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984704378] [2024-06-03 20:40:04,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984704378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:40:04,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:40:04,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:40:04,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71973317] [2024-06-03 20:40:04,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:40:04,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:40:04,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:40:04,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:40:04,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:40:04,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:40:04,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 241 transitions, 2928 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:04,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:40:04,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:40:04,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:40:05,294 INFO L124 PetriNetUnfolderBase]: 668/1172 cut-off events. [2024-06-03 20:40:05,294 INFO L125 PetriNetUnfolderBase]: For 79425/79425 co-relation queries the response was YES. [2024-06-03 20:40:05,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8861 conditions, 1172 events. 668/1172 cut-off events. For 79425/79425 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5846 event pairs, 88 based on Foata normal form. 2/1174 useless extension candidates. Maximal degree in co-relation 8738. Up to 1015 conditions per place. [2024-06-03 20:40:05,306 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 212 selfloop transitions, 45 changer transitions 0/259 dead transitions. [2024-06-03 20:40:05,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 259 transitions, 3534 flow [2024-06-03 20:40:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:40:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:40:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-03 20:40:05,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2024-06-03 20:40:05,308 INFO L175 Difference]: Start difference. First operand has 265 places, 241 transitions, 2928 flow. Second operand 10 states and 114 transitions. [2024-06-03 20:40:05,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 259 transitions, 3534 flow [2024-06-03 20:40:05,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 259 transitions, 3396 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-03 20:40:05,568 INFO L231 Difference]: Finished difference. Result has 267 places, 242 transitions, 2914 flow [2024-06-03 20:40:05,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2790, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2914, PETRI_PLACES=267, PETRI_TRANSITIONS=242} [2024-06-03 20:40:05,568 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 235 predicate places. [2024-06-03 20:40:05,568 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 242 transitions, 2914 flow [2024-06-03 20:40:05,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:05,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:40:05,569 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 20:40:05,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-03 20:40:05,569 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 20:40:05,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:40:05,569 INFO L85 PathProgramCache]: Analyzing trace with hash 27473691, now seen corresponding path program 4 times [2024-06-03 20:40:05,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:40:05,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879952052] [2024-06-03 20:40:05,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:40:05,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:40:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:40:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:40:11,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:40:11,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879952052] [2024-06-03 20:40:11,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879952052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:40:11,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:40:11,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:40:11,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142593362] [2024-06-03 20:40:11,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:40:11,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:40:11,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:40:11,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:40:11,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:40:11,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:40:11,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 242 transitions, 2914 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:11,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:40:11,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:40:11,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:40:12,426 INFO L124 PetriNetUnfolderBase]: 674/1182 cut-off events. [2024-06-03 20:40:12,426 INFO L125 PetriNetUnfolderBase]: For 81475/81475 co-relation queries the response was YES. [2024-06-03 20:40:12,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8910 conditions, 1182 events. 674/1182 cut-off events. For 81475/81475 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5903 event pairs, 80 based on Foata normal form. 2/1184 useless extension candidates. Maximal degree in co-relation 8786. Up to 976 conditions per place. [2024-06-03 20:40:12,437 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 202 selfloop transitions, 61 changer transitions 0/265 dead transitions. [2024-06-03 20:40:12,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 265 transitions, 3582 flow [2024-06-03 20:40:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:40:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:40:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-03 20:40:12,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34710743801652894 [2024-06-03 20:40:12,439 INFO L175 Difference]: Start difference. First operand has 267 places, 242 transitions, 2914 flow. Second operand 11 states and 126 transitions. [2024-06-03 20:40:12,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 265 transitions, 3582 flow [2024-06-03 20:40:12,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 265 transitions, 3468 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-03 20:40:12,656 INFO L231 Difference]: Finished difference. Result has 270 places, 244 transitions, 2979 flow [2024-06-03 20:40:12,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2800, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2979, PETRI_PLACES=270, PETRI_TRANSITIONS=244} [2024-06-03 20:40:12,657 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 238 predicate places. [2024-06-03 20:40:12,657 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 244 transitions, 2979 flow [2024-06-03 20:40:12,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:12,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:40:12,657 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 20:40:12,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-03 20:40:12,657 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 20:40:12,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:40:12,658 INFO L85 PathProgramCache]: Analyzing trace with hash 27682941, now seen corresponding path program 5 times [2024-06-03 20:40:12,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:40:12,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48357767] [2024-06-03 20:40:12,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:40:12,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:40:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:40:17,980 INFO 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 20:40:17,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:40:17,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48357767] [2024-06-03 20:40:17,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48357767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:40:17,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:40:17,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:40:17,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712810427] [2024-06-03 20:40:17,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:40:17,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:40:17,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:40:17,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:40:17,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:40:18,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:40:18,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 244 transitions, 2979 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:18,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:40:18,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:40:18,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:40:18,807 INFO L124 PetriNetUnfolderBase]: 670/1176 cut-off events. [2024-06-03 20:40:18,807 INFO L125 PetriNetUnfolderBase]: For 78591/78591 co-relation queries the response was YES. [2024-06-03 20:40:18,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8760 conditions, 1176 events. 670/1176 cut-off events. For 78591/78591 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5873 event pairs, 77 based on Foata normal form. 2/1178 useless extension candidates. Maximal degree in co-relation 8635. Up to 863 conditions per place. [2024-06-03 20:40:18,819 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 179 selfloop transitions, 87 changer transitions 0/268 dead transitions. [2024-06-03 20:40:18,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 268 transitions, 3761 flow [2024-06-03 20:40:18,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:40:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:40:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-03 20:40:18,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3608815426997245 [2024-06-03 20:40:18,820 INFO L175 Difference]: Start difference. First operand has 270 places, 244 transitions, 2979 flow. Second operand 11 states and 131 transitions. [2024-06-03 20:40:18,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 268 transitions, 3761 flow [2024-06-03 20:40:19,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 268 transitions, 3564 flow, removed 39 selfloop flow, removed 9 redundant places. [2024-06-03 20:40:19,065 INFO L231 Difference]: Finished difference. Result has 272 places, 244 transitions, 2962 flow [2024-06-03 20:40:19,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2782, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2962, PETRI_PLACES=272, PETRI_TRANSITIONS=244} [2024-06-03 20:40:19,066 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 240 predicate places. [2024-06-03 20:40:19,066 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 244 transitions, 2962 flow [2024-06-03 20:40:19,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:19,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:40:19,066 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 20:40:19,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-03 20:40:19,066 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 20:40:19,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:40:19,067 INFO L85 PathProgramCache]: Analyzing trace with hash 21957489, now seen corresponding path program 8 times [2024-06-03 20:40:19,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:40:19,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151244738] [2024-06-03 20:40:19,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:40:19,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:40:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:40:23,212 INFO 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 20:40:23,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:40:23,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151244738] [2024-06-03 20:40:23,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151244738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:40:23,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:40:23,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:40:23,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245153117] [2024-06-03 20:40:23,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:40:23,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:40:23,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:40:23,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:40:23,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:40:23,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:40:23,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 244 transitions, 2962 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:23,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:40:23,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:40:23,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:40:23,887 INFO L124 PetriNetUnfolderBase]: 674/1184 cut-off events. [2024-06-03 20:40:23,888 INFO L125 PetriNetUnfolderBase]: For 80462/80462 co-relation queries the response was YES. [2024-06-03 20:40:23,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8838 conditions, 1184 events. 674/1184 cut-off events. For 80462/80462 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5921 event pairs, 87 based on Foata normal form. 2/1186 useless extension candidates. Maximal degree in co-relation 8712. Up to 1027 conditions per place. [2024-06-03 20:40:23,897 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 216 selfloop transitions, 44 changer transitions 0/262 dead transitions. [2024-06-03 20:40:23,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 262 transitions, 3570 flow [2024-06-03 20:40:23,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:40:23,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:40:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-03 20:40:23,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3424242424242424 [2024-06-03 20:40:23,899 INFO L175 Difference]: Start difference. First operand has 272 places, 244 transitions, 2962 flow. Second operand 10 states and 113 transitions. [2024-06-03 20:40:23,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 262 transitions, 3570 flow [2024-06-03 20:40:24,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 262 transitions, 3411 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 20:40:24,168 INFO L231 Difference]: Finished difference. Result has 273 places, 245 transitions, 2927 flow [2024-06-03 20:40:24,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2803, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2927, PETRI_PLACES=273, PETRI_TRANSITIONS=245} [2024-06-03 20:40:24,168 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 241 predicate places. [2024-06-03 20:40:24,168 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 245 transitions, 2927 flow [2024-06-03 20:40:24,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:24,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:40:24,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:40:24,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-03 20:40:24,169 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 20:40:24,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:40:24,169 INFO L85 PathProgramCache]: Analyzing trace with hash -959865013, now seen corresponding path program 6 times [2024-06-03 20:40:24,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:40:24,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380253599] [2024-06-03 20:40:24,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:40:24,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:40:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:40:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:40:29,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:40:29,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380253599] [2024-06-03 20:40:29,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380253599] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:40:29,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:40:29,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:40:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810714467] [2024-06-03 20:40:29,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:40:29,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:40:29,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:40:29,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:40:29,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:40:30,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:40:30,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 245 transitions, 2927 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:30,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:40:30,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:40:30,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:40:30,664 INFO L124 PetriNetUnfolderBase]: 675/1186 cut-off events. [2024-06-03 20:40:30,665 INFO L125 PetriNetUnfolderBase]: For 80178/80178 co-relation queries the response was YES. [2024-06-03 20:40:30,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8741 conditions, 1186 events. 675/1186 cut-off events. For 80178/80178 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5948 event pairs, 89 based on Foata normal form. 2/1188 useless extension candidates. Maximal degree in co-relation 8614. Up to 1019 conditions per place. [2024-06-03 20:40:30,677 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 216 selfloop transitions, 48 changer transitions 0/266 dead transitions. [2024-06-03 20:40:30,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 266 transitions, 3587 flow [2024-06-03 20:40:30,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:40:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:40:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-03 20:40:30,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3415977961432507 [2024-06-03 20:40:30,678 INFO L175 Difference]: Start difference. First operand has 273 places, 245 transitions, 2927 flow. Second operand 11 states and 124 transitions. [2024-06-03 20:40:30,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 266 transitions, 3587 flow [2024-06-03 20:40:30,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 266 transitions, 3473 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-03 20:40:30,983 INFO L231 Difference]: Finished difference. Result has 276 places, 247 transitions, 2970 flow [2024-06-03 20:40:30,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2813, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2970, PETRI_PLACES=276, PETRI_TRANSITIONS=247} [2024-06-03 20:40:30,983 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 244 predicate places. [2024-06-03 20:40:30,983 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 247 transitions, 2970 flow [2024-06-03 20:40:30,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:30,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:40:30,984 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 20:40:30,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-03 20:40:30,984 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 20:40:30,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:40:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1100139507, now seen corresponding path program 1 times [2024-06-03 20:40:30,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:40:30,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351576899] [2024-06-03 20:40:30,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:40:30,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:40:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:40:36,657 INFO 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 20:40:36,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:40:36,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351576899] [2024-06-03 20:40:36,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351576899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:40:36,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:40:36,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:40:36,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854877580] [2024-06-03 20:40:36,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:40:36,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:40:36,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:40:36,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:40:36,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:40:36,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:40:36,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 247 transitions, 2970 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:36,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:40:36,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:40:36,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:40:37,477 INFO L124 PetriNetUnfolderBase]: 683/1202 cut-off events. [2024-06-03 20:40:37,477 INFO L125 PetriNetUnfolderBase]: For 87647/87647 co-relation queries the response was YES. [2024-06-03 20:40:37,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8811 conditions, 1202 events. 683/1202 cut-off events. For 87647/87647 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6129 event pairs, 150 based on Foata normal form. 4/1206 useless extension candidates. Maximal degree in co-relation 8683. Up to 1093 conditions per place. [2024-06-03 20:40:37,489 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 232 selfloop transitions, 34 changer transitions 0/268 dead transitions. [2024-06-03 20:40:37,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 268 transitions, 3586 flow [2024-06-03 20:40:37,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 20:40:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 20:40:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 125 transitions. [2024-06-03 20:40:37,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31565656565656564 [2024-06-03 20:40:37,491 INFO L175 Difference]: Start difference. First operand has 276 places, 247 transitions, 2970 flow. Second operand 12 states and 125 transitions. [2024-06-03 20:40:37,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 268 transitions, 3586 flow [2024-06-03 20:40:37,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 268 transitions, 3451 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-03 20:40:37,732 INFO L231 Difference]: Finished difference. Result has 279 places, 248 transitions, 2927 flow [2024-06-03 20:40:37,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2835, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2927, PETRI_PLACES=279, PETRI_TRANSITIONS=248} [2024-06-03 20:40:37,733 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 247 predicate places. [2024-06-03 20:40:37,733 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 248 transitions, 2927 flow [2024-06-03 20:40:37,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:37,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:40:37,733 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 20:40:37,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-03 20:40:37,733 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 20:40:37,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:40:37,734 INFO L85 PathProgramCache]: Analyzing trace with hash -922438133, now seen corresponding path program 9 times [2024-06-03 20:40:37,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:40:37,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427607516] [2024-06-03 20:40:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:40:37,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:40:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:40:41,507 INFO 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 20:40:41,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:40:41,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427607516] [2024-06-03 20:40:41,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427607516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:40:41,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:40:41,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:40:41,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551497992] [2024-06-03 20:40:41,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:40:41,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:40:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:40:41,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:40:41,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:40:41,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:40:41,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 248 transitions, 2927 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:41,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:40:41,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:40:41,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:40:42,091 INFO L124 PetriNetUnfolderBase]: 687/1210 cut-off events. [2024-06-03 20:40:42,091 INFO L125 PetriNetUnfolderBase]: For 84259/84259 co-relation queries the response was YES. [2024-06-03 20:40:42,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8833 conditions, 1210 events. 687/1210 cut-off events. For 84259/84259 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6128 event pairs, 134 based on Foata normal form. 2/1212 useless extension candidates. Maximal degree in co-relation 8704. Up to 1053 conditions per place. [2024-06-03 20:40:42,103 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 216 selfloop transitions, 46 changer transitions 0/264 dead transitions. [2024-06-03 20:40:42,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 264 transitions, 3531 flow [2024-06-03 20:40:42,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:40:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:40:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-03 20:40:42,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 20:40:42,105 INFO L175 Difference]: Start difference. First operand has 279 places, 248 transitions, 2927 flow. Second operand 9 states and 99 transitions. [2024-06-03 20:40:42,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 264 transitions, 3531 flow [2024-06-03 20:40:42,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 264 transitions, 3449 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-03 20:40:42,422 INFO L231 Difference]: Finished difference. Result has 278 places, 249 transitions, 2982 flow [2024-06-03 20:40:42,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2845, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2982, PETRI_PLACES=278, PETRI_TRANSITIONS=249} [2024-06-03 20:40:42,423 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 246 predicate places. [2024-06-03 20:40:42,423 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 249 transitions, 2982 flow [2024-06-03 20:40:42,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:42,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:40:42,423 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 20:40:42,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-03 20:40:42,423 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 20:40:42,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:40:42,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1002076483, now seen corresponding path program 10 times [2024-06-03 20:40:42,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:40:42,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850994081] [2024-06-03 20:40:42,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:40:42,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:40:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:40:46,215 INFO 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 20:40:46,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:40:46,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850994081] [2024-06-03 20:40:46,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850994081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:40:46,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:40:46,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:40:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826503916] [2024-06-03 20:40:46,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:40:46,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:40:46,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:40:46,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:40:46,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:40:46,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:40:46,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 249 transitions, 2982 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:46,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:40:46,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:40:46,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:40:46,885 INFO L124 PetriNetUnfolderBase]: 691/1218 cut-off events. [2024-06-03 20:40:46,885 INFO L125 PetriNetUnfolderBase]: For 87067/87067 co-relation queries the response was YES. [2024-06-03 20:40:46,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8969 conditions, 1218 events. 691/1218 cut-off events. For 87067/87067 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6196 event pairs, 130 based on Foata normal form. 2/1220 useless extension candidates. Maximal degree in co-relation 8839. Up to 1070 conditions per place. [2024-06-03 20:40:46,896 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 226 selfloop transitions, 37 changer transitions 0/265 dead transitions. [2024-06-03 20:40:46,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 265 transitions, 3584 flow [2024-06-03 20:40:46,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:40:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:40:46,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-03 20:40:46,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32996632996632996 [2024-06-03 20:40:46,898 INFO L175 Difference]: Start difference. First operand has 278 places, 249 transitions, 2982 flow. Second operand 9 states and 98 transitions. [2024-06-03 20:40:46,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 265 transitions, 3584 flow [2024-06-03 20:40:47,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 265 transitions, 3463 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-03 20:40:47,141 INFO L231 Difference]: Finished difference. Result has 280 places, 250 transitions, 2979 flow [2024-06-03 20:40:47,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2865, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2979, PETRI_PLACES=280, PETRI_TRANSITIONS=250} [2024-06-03 20:40:47,142 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 248 predicate places. [2024-06-03 20:40:47,142 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 250 transitions, 2979 flow [2024-06-03 20:40:47,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:47,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:40:47,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:40:47,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-03 20:40:47,143 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 20:40:47,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:40:47,143 INFO L85 PathProgramCache]: Analyzing trace with hash -53297302, now seen corresponding path program 3 times [2024-06-03 20:40:47,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:40:47,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947280455] [2024-06-03 20:40:47,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:40:47,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:40:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:40:51,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 20:40:51,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:40:51,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947280455] [2024-06-03 20:40:51,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947280455] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:40:51,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:40:51,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:40:51,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717913096] [2024-06-03 20:40:51,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:40:51,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:40:51,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:40:51,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:40:51,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:40:51,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:40:51,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 250 transitions, 2979 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:51,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:40:51,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:40:51,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:40:51,908 INFO L124 PetriNetUnfolderBase]: 689/1215 cut-off events. [2024-06-03 20:40:51,908 INFO L125 PetriNetUnfolderBase]: For 78859/78859 co-relation queries the response was YES. [2024-06-03 20:40:51,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8780 conditions, 1215 events. 689/1215 cut-off events. For 78859/78859 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6182 event pairs, 132 based on Foata normal form. 1/1216 useless extension candidates. Maximal degree in co-relation 8649. Up to 1049 conditions per place. [2024-06-03 20:40:51,921 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 208 selfloop transitions, 55 changer transitions 0/265 dead transitions. [2024-06-03 20:40:51,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 265 transitions, 3559 flow [2024-06-03 20:40:51,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:40:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:40:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-03 20:40:51,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3367003367003367 [2024-06-03 20:40:51,922 INFO L175 Difference]: Start difference. First operand has 280 places, 250 transitions, 2979 flow. Second operand 9 states and 100 transitions. [2024-06-03 20:40:51,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 265 transitions, 3559 flow [2024-06-03 20:40:52,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 265 transitions, 3443 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-03 20:40:52,279 INFO L231 Difference]: Finished difference. Result has 282 places, 250 transitions, 2993 flow [2024-06-03 20:40:52,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2863, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2993, PETRI_PLACES=282, PETRI_TRANSITIONS=250} [2024-06-03 20:40:52,280 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 250 predicate places. [2024-06-03 20:40:52,280 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 250 transitions, 2993 flow [2024-06-03 20:40:52,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:52,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:40:52,280 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 20:40:52,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-03 20:40:52,281 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 20:40:52,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:40:52,281 INFO L85 PathProgramCache]: Analyzing trace with hash -931050557, now seen corresponding path program 7 times [2024-06-03 20:40:52,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:40:52,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183133467] [2024-06-03 20:40:52,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:40:52,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:40:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:40:58,243 INFO 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 20:40:58,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:40:58,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183133467] [2024-06-03 20:40:58,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183133467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:40:58,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:40:58,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:40:58,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644526538] [2024-06-03 20:40:58,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:40:58,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:40:58,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:40:58,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:40:58,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:40:58,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:40:58,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 250 transitions, 2993 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:58,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:40:58,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:40:58,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:40:58,859 INFO L124 PetriNetUnfolderBase]: 695/1225 cut-off events. [2024-06-03 20:40:58,859 INFO L125 PetriNetUnfolderBase]: For 78871/78871 co-relation queries the response was YES. [2024-06-03 20:40:58,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8847 conditions, 1225 events. 695/1225 cut-off events. For 78871/78871 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6235 event pairs, 133 based on Foata normal form. 2/1227 useless extension candidates. Maximal degree in co-relation 8715. Up to 1062 conditions per place. [2024-06-03 20:40:58,872 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 221 selfloop transitions, 46 changer transitions 0/269 dead transitions. [2024-06-03 20:40:58,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 269 transitions, 3641 flow [2024-06-03 20:40:58,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:40:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:40:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-03 20:40:58,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303030303030303 [2024-06-03 20:40:58,874 INFO L175 Difference]: Start difference. First operand has 282 places, 250 transitions, 2993 flow. Second operand 10 states and 109 transitions. [2024-06-03 20:40:58,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 269 transitions, 3641 flow [2024-06-03 20:40:59,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 269 transitions, 3481 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-03 20:40:59,142 INFO L231 Difference]: Finished difference. Result has 283 places, 252 transitions, 2990 flow [2024-06-03 20:40:59,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2833, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2990, PETRI_PLACES=283, PETRI_TRANSITIONS=252} [2024-06-03 20:40:59,142 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 251 predicate places. [2024-06-03 20:40:59,143 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 252 transitions, 2990 flow [2024-06-03 20:40:59,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:40:59,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:40:59,143 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 20:40:59,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-03 20:40:59,143 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 20:40:59,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:40:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash 271786601, now seen corresponding path program 11 times [2024-06-03 20:40:59,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:40:59,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786074398] [2024-06-03 20:40:59,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:40:59,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:40:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:41:03,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 20:41:03,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:41:03,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786074398] [2024-06-03 20:41:03,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786074398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:41:03,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:41:03,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:41:03,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845993107] [2024-06-03 20:41:03,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:41:03,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:41:03,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:41:03,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:41:03,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:41:03,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:41:03,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 252 transitions, 2990 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:03,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:41:03,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:41:03,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:41:04,211 INFO L124 PetriNetUnfolderBase]: 699/1233 cut-off events. [2024-06-03 20:41:04,211 INFO L125 PetriNetUnfolderBase]: For 77696/77696 co-relation queries the response was YES. [2024-06-03 20:41:04,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8865 conditions, 1233 events. 699/1233 cut-off events. For 77696/77696 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6288 event pairs, 76 based on Foata normal form. 2/1235 useless extension candidates. Maximal degree in co-relation 8733. Up to 995 conditions per place. [2024-06-03 20:41:04,224 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 196 selfloop transitions, 71 changer transitions 0/269 dead transitions. [2024-06-03 20:41:04,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 269 transitions, 3616 flow [2024-06-03 20:41:04,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:41:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:41:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-03 20:41:04,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3501683501683502 [2024-06-03 20:41:04,225 INFO L175 Difference]: Start difference. First operand has 283 places, 252 transitions, 2990 flow. Second operand 9 states and 104 transitions. [2024-06-03 20:41:04,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 269 transitions, 3616 flow [2024-06-03 20:41:04,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 269 transitions, 3499 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-03 20:41:04,497 INFO L231 Difference]: Finished difference. Result has 284 places, 253 transitions, 3051 flow [2024-06-03 20:41:04,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2873, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3051, PETRI_PLACES=284, PETRI_TRANSITIONS=253} [2024-06-03 20:41:04,498 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 252 predicate places. [2024-06-03 20:41:04,498 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 253 transitions, 3051 flow [2024-06-03 20:41:04,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:04,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:41:04,498 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 20:41:04,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-03 20:41:04,498 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 20:41:04,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:41:04,499 INFO L85 PathProgramCache]: Analyzing trace with hash -786950777, now seen corresponding path program 8 times [2024-06-03 20:41:04,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:41:04,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986955688] [2024-06-03 20:41:04,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:41:04,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:41:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:41:10,248 INFO 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 20:41:10,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:41:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986955688] [2024-06-03 20:41:10,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986955688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:41:10,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:41:10,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:41:10,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024454079] [2024-06-03 20:41:10,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:41:10,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:41:10,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:41:10,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:41:10,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:41:10,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:41:10,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 253 transitions, 3051 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:10,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:41:10,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:41:10,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:41:11,026 INFO L124 PetriNetUnfolderBase]: 715/1259 cut-off events. [2024-06-03 20:41:11,027 INFO L125 PetriNetUnfolderBase]: For 85918/85918 co-relation queries the response was YES. [2024-06-03 20:41:11,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9320 conditions, 1259 events. 715/1259 cut-off events. For 85918/85918 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6426 event pairs, 74 based on Foata normal form. 2/1261 useless extension candidates. Maximal degree in co-relation 9187. Up to 817 conditions per place. [2024-06-03 20:41:11,040 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 155 selfloop transitions, 121 changer transitions 0/278 dead transitions. [2024-06-03 20:41:11,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 278 transitions, 3953 flow [2024-06-03 20:41:11,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:41:11,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:41:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-03 20:41:11,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3606060606060606 [2024-06-03 20:41:11,042 INFO L175 Difference]: Start difference. First operand has 284 places, 253 transitions, 3051 flow. Second operand 10 states and 119 transitions. [2024-06-03 20:41:11,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 278 transitions, 3953 flow [2024-06-03 20:41:11,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 278 transitions, 3785 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-03 20:41:11,329 INFO L231 Difference]: Finished difference. Result has 287 places, 257 transitions, 3249 flow [2024-06-03 20:41:11,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2885, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3249, PETRI_PLACES=287, PETRI_TRANSITIONS=257} [2024-06-03 20:41:11,330 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 255 predicate places. [2024-06-03 20:41:11,330 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 257 transitions, 3249 flow [2024-06-03 20:41:11,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:11,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:41:11,330 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 20:41:11,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-03 20:41:11,331 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 20:41:11,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:41:11,331 INFO L85 PathProgramCache]: Analyzing trace with hash -774238483, now seen corresponding path program 12 times [2024-06-03 20:41:11,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:41:11,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239705816] [2024-06-03 20:41:11,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:41:11,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:41:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:41:15,096 INFO 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 20:41:15,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:41:15,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239705816] [2024-06-03 20:41:15,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239705816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:41:15,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:41:15,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:41:15,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258651690] [2024-06-03 20:41:15,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:41:15,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:41:15,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:41:15,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:41:15,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:41:15,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:41:15,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 257 transitions, 3249 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:15,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:41:15,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:41:15,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:41:15,748 INFO L124 PetriNetUnfolderBase]: 719/1267 cut-off events. [2024-06-03 20:41:15,748 INFO L125 PetriNetUnfolderBase]: For 86068/86068 co-relation queries the response was YES. [2024-06-03 20:41:15,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9520 conditions, 1267 events. 719/1267 cut-off events. For 86068/86068 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6489 event pairs, 100 based on Foata normal form. 2/1269 useless extension candidates. Maximal degree in co-relation 9386. Up to 1096 conditions per place. [2024-06-03 20:41:15,761 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 221 selfloop transitions, 49 changer transitions 0/272 dead transitions. [2024-06-03 20:41:15,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 272 transitions, 3867 flow [2024-06-03 20:41:15,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:41:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:41:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-03 20:41:15,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2024-06-03 20:41:15,763 INFO L175 Difference]: Start difference. First operand has 287 places, 257 transitions, 3249 flow. Second operand 9 states and 102 transitions. [2024-06-03 20:41:15,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 272 transitions, 3867 flow [2024-06-03 20:41:16,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 272 transitions, 3677 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-03 20:41:16,061 INFO L231 Difference]: Finished difference. Result has 289 places, 258 transitions, 3193 flow [2024-06-03 20:41:16,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3059, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3193, PETRI_PLACES=289, PETRI_TRANSITIONS=258} [2024-06-03 20:41:16,062 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 257 predicate places. [2024-06-03 20:41:16,062 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 258 transitions, 3193 flow [2024-06-03 20:41:16,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:16,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:41:16,062 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 20:41:16,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-03 20:41:16,062 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 20:41:16,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:41:16,063 INFO L85 PathProgramCache]: Analyzing trace with hash -774242203, now seen corresponding path program 13 times [2024-06-03 20:41:16,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:41:16,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977287303] [2024-06-03 20:41:16,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:41:16,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:41:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:41:20,316 INFO 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 20:41:20,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:41:20,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977287303] [2024-06-03 20:41:20,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977287303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:41:20,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:41:20,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:41:20,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237245433] [2024-06-03 20:41:20,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:41:20,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:41:20,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:41:20,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:41:20,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:41:20,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:41:20,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 258 transitions, 3193 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:20,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:41:20,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:41:20,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:41:21,098 INFO L124 PetriNetUnfolderBase]: 723/1275 cut-off events. [2024-06-03 20:41:21,098 INFO L125 PetriNetUnfolderBase]: For 85733/85733 co-relation queries the response was YES. [2024-06-03 20:41:21,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9524 conditions, 1275 events. 723/1275 cut-off events. For 85733/85733 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6543 event pairs, 96 based on Foata normal form. 2/1277 useless extension candidates. Maximal degree in co-relation 9389. Up to 1104 conditions per place. [2024-06-03 20:41:21,112 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 224 selfloop transitions, 47 changer transitions 0/273 dead transitions. [2024-06-03 20:41:21,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 273 transitions, 3809 flow [2024-06-03 20:41:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:41:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:41:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-03 20:41:21,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3400673400673401 [2024-06-03 20:41:21,113 INFO L175 Difference]: Start difference. First operand has 289 places, 258 transitions, 3193 flow. Second operand 9 states and 101 transitions. [2024-06-03 20:41:21,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 273 transitions, 3809 flow [2024-06-03 20:41:21,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 273 transitions, 3685 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-03 20:41:21,448 INFO L231 Difference]: Finished difference. Result has 291 places, 259 transitions, 3201 flow [2024-06-03 20:41:21,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3071, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3201, PETRI_PLACES=291, PETRI_TRANSITIONS=259} [2024-06-03 20:41:21,449 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 259 predicate places. [2024-06-03 20:41:21,449 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 259 transitions, 3201 flow [2024-06-03 20:41:21,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:21,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:41:21,449 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 20:41:21,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-03 20:41:21,449 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 20:41:21,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:41:21,450 INFO L85 PathProgramCache]: Analyzing trace with hash -792522407, now seen corresponding path program 9 times [2024-06-03 20:41:21,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:41:21,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227292831] [2024-06-03 20:41:21,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:41:21,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:41:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:41:27,666 INFO 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 20:41:27,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:41:27,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227292831] [2024-06-03 20:41:27,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227292831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:41:27,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:41:27,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:41:27,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704922974] [2024-06-03 20:41:27,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:41:27,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:41:27,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:41:27,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:41:27,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:41:27,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:41:27,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 259 transitions, 3201 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:27,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:41:27,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:41:27,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:41:28,315 INFO L124 PetriNetUnfolderBase]: 729/1285 cut-off events. [2024-06-03 20:41:28,315 INFO L125 PetriNetUnfolderBase]: For 85699/85699 co-relation queries the response was YES. [2024-06-03 20:41:28,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9579 conditions, 1285 events. 729/1285 cut-off events. For 85699/85699 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6636 event pairs, 100 based on Foata normal form. 2/1287 useless extension candidates. Maximal degree in co-relation 9443. Up to 1094 conditions per place. [2024-06-03 20:41:28,328 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 220 selfloop transitions, 55 changer transitions 0/277 dead transitions. [2024-06-03 20:41:28,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 277 transitions, 3871 flow [2024-06-03 20:41:28,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:41:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:41:28,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-03 20:41:28,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2024-06-03 20:41:28,330 INFO L175 Difference]: Start difference. First operand has 291 places, 259 transitions, 3201 flow. Second operand 10 states and 112 transitions. [2024-06-03 20:41:28,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 277 transitions, 3871 flow [2024-06-03 20:41:28,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 277 transitions, 3753 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-03 20:41:28,698 INFO L231 Difference]: Finished difference. Result has 294 places, 261 transitions, 3259 flow [2024-06-03 20:41:28,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3083, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3259, PETRI_PLACES=294, PETRI_TRANSITIONS=261} [2024-06-03 20:41:28,699 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 262 predicate places. [2024-06-03 20:41:28,699 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 261 transitions, 3259 flow [2024-06-03 20:41:28,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:28,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:41:28,699 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 20:41:28,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-03 20:41:28,700 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 20:41:28,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:41:28,701 INFO L85 PathProgramCache]: Analyzing trace with hash -768524191, now seen corresponding path program 10 times [2024-06-03 20:41:28,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:41:28,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124901953] [2024-06-03 20:41:28,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:41:28,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:41:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:41:35,285 INFO 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 20:41:35,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:41:35,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124901953] [2024-06-03 20:41:35,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124901953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:41:35,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:41:35,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:41:35,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077740332] [2024-06-03 20:41:35,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:41:35,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:41:35,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:41:35,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:41:35,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:41:35,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:41:35,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 261 transitions, 3259 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:35,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:41:35,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:41:35,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:41:36,030 INFO L124 PetriNetUnfolderBase]: 735/1295 cut-off events. [2024-06-03 20:41:36,030 INFO L125 PetriNetUnfolderBase]: For 85762/85762 co-relation queries the response was YES. [2024-06-03 20:41:36,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9679 conditions, 1295 events. 735/1295 cut-off events. For 85762/85762 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6689 event pairs, 76 based on Foata normal form. 2/1297 useless extension candidates. Maximal degree in co-relation 9542. Up to 950 conditions per place. [2024-06-03 20:41:36,049 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 179 selfloop transitions, 101 changer transitions 0/282 dead transitions. [2024-06-03 20:41:36,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 282 transitions, 3963 flow [2024-06-03 20:41:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:41:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:41:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-03 20:41:36,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2024-06-03 20:41:36,050 INFO L175 Difference]: Start difference. First operand has 294 places, 261 transitions, 3259 flow. Second operand 10 states and 116 transitions. [2024-06-03 20:41:36,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 282 transitions, 3963 flow [2024-06-03 20:41:36,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 282 transitions, 3817 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-03 20:41:36,380 INFO L231 Difference]: Finished difference. Result has 296 places, 263 transitions, 3385 flow [2024-06-03 20:41:36,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3113, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3385, PETRI_PLACES=296, PETRI_TRANSITIONS=263} [2024-06-03 20:41:36,384 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 264 predicate places. [2024-06-03 20:41:36,384 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 263 transitions, 3385 flow [2024-06-03 20:41:36,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:36,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:41:36,384 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 20:41:36,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-03 20:41:36,385 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 20:41:36,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:41:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash -768726001, now seen corresponding path program 11 times [2024-06-03 20:41:36,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:41:36,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750573294] [2024-06-03 20:41:36,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:41:36,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:41:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:41:41,772 INFO 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 20:41:41,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:41:41,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750573294] [2024-06-03 20:41:41,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750573294] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:41:41,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:41:41,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:41:41,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856055676] [2024-06-03 20:41:41,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:41:41,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:41:41,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:41:41,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:41:41,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:41:41,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:41:41,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 263 transitions, 3385 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:41,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:41:41,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:41:41,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:41:42,540 INFO L124 PetriNetUnfolderBase]: 736/1297 cut-off events. [2024-06-03 20:41:42,540 INFO L125 PetriNetUnfolderBase]: For 85240/85240 co-relation queries the response was YES. [2024-06-03 20:41:42,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9772 conditions, 1297 events. 736/1297 cut-off events. For 85240/85240 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6715 event pairs, 80 based on Foata normal form. 2/1299 useless extension candidates. Maximal degree in co-relation 9634. Up to 1039 conditions per place. [2024-06-03 20:41:42,554 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 204 selfloop transitions, 77 changer transitions 0/283 dead transitions. [2024-06-03 20:41:42,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 283 transitions, 4089 flow [2024-06-03 20:41:42,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:41:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:41:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-03 20:41:42,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2024-06-03 20:41:42,555 INFO L175 Difference]: Start difference. First operand has 296 places, 263 transitions, 3385 flow. Second operand 10 states and 114 transitions. [2024-06-03 20:41:42,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 283 transitions, 4089 flow [2024-06-03 20:41:42,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 283 transitions, 3842 flow, removed 24 selfloop flow, removed 9 redundant places. [2024-06-03 20:41:42,885 INFO L231 Difference]: Finished difference. Result has 297 places, 265 transitions, 3366 flow [2024-06-03 20:41:42,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3138, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3366, PETRI_PLACES=297, PETRI_TRANSITIONS=265} [2024-06-03 20:41:42,900 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 265 predicate places. [2024-06-03 20:41:42,900 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 265 transitions, 3366 flow [2024-06-03 20:41:42,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:42,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:41:42,901 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 20:41:42,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-03 20:41:42,901 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 20:41:42,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:41:42,901 INFO L85 PathProgramCache]: Analyzing trace with hash 272687747, now seen corresponding path program 2 times [2024-06-03 20:41:42,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:41:42,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334870560] [2024-06-03 20:41:42,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:41:42,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:41:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:41:49,213 INFO 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 20:41:49,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:41:49,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334870560] [2024-06-03 20:41:49,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334870560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:41:49,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:41:49,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:41:49,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337267768] [2024-06-03 20:41:49,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:41:49,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:41:49,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:41:49,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:41:49,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:41:49,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:41:49,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 265 transitions, 3366 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:49,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:41:49,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:41:49,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:41:49,956 INFO L124 PetriNetUnfolderBase]: 744/1314 cut-off events. [2024-06-03 20:41:49,956 INFO L125 PetriNetUnfolderBase]: For 91021/91021 co-relation queries the response was YES. [2024-06-03 20:41:49,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9737 conditions, 1314 events. 744/1314 cut-off events. For 91021/91021 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 6879 event pairs, 154 based on Foata normal form. 4/1318 useless extension candidates. Maximal degree in co-relation 9599. Up to 1158 conditions per place. [2024-06-03 20:41:49,970 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 239 selfloop transitions, 43 changer transitions 0/284 dead transitions. [2024-06-03 20:41:49,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 284 transitions, 4010 flow [2024-06-03 20:41:49,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:41:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:41:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-03 20:41:49,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31955922865013775 [2024-06-03 20:41:49,974 INFO L175 Difference]: Start difference. First operand has 297 places, 265 transitions, 3366 flow. Second operand 11 states and 116 transitions. [2024-06-03 20:41:49,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 284 transitions, 4010 flow [2024-06-03 20:41:50,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 284 transitions, 3812 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-03 20:41:50,255 INFO L231 Difference]: Finished difference. Result has 300 places, 266 transitions, 3282 flow [2024-06-03 20:41:50,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3168, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3282, PETRI_PLACES=300, PETRI_TRANSITIONS=266} [2024-06-03 20:41:50,257 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 268 predicate places. [2024-06-03 20:41:50,257 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 266 transitions, 3282 flow [2024-06-03 20:41:50,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:50,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:41:50,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 20:41:50,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-03 20:41:50,258 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 20:41:50,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:41:50,258 INFO L85 PathProgramCache]: Analyzing trace with hash -755879267, now seen corresponding path program 14 times [2024-06-03 20:41:50,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:41:50,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656917126] [2024-06-03 20:41:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:41:50,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:41:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:41:54,613 INFO 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 20:41:54,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:41:54,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656917126] [2024-06-03 20:41:54,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656917126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:41:54,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:41:54,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:41:54,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767963452] [2024-06-03 20:41:54,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:41:54,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:41:54,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:41:54,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:41:54,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:41:54,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:41:54,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 266 transitions, 3282 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:54,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:41:54,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:41:54,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:41:55,364 INFO L124 PetriNetUnfolderBase]: 754/1333 cut-off events. [2024-06-03 20:41:55,364 INFO L125 PetriNetUnfolderBase]: For 87334/87334 co-relation queries the response was YES. [2024-06-03 20:41:55,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9739 conditions, 1333 events. 754/1333 cut-off events. For 87334/87334 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6952 event pairs, 117 based on Foata normal form. 2/1335 useless extension candidates. Maximal degree in co-relation 9600. Up to 1170 conditions per place. [2024-06-03 20:41:55,378 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 234 selfloop transitions, 46 changer transitions 0/282 dead transitions. [2024-06-03 20:41:55,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 282 transitions, 3933 flow [2024-06-03 20:41:55,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:41:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:41:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-03 20:41:55,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 20:41:55,379 INFO L175 Difference]: Start difference. First operand has 300 places, 266 transitions, 3282 flow. Second operand 9 states and 99 transitions. [2024-06-03 20:41:55,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 282 transitions, 3933 flow [2024-06-03 20:41:55,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 282 transitions, 3831 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-03 20:41:55,721 INFO L231 Difference]: Finished difference. Result has 301 places, 269 transitions, 3326 flow [2024-06-03 20:41:55,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3180, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3326, PETRI_PLACES=301, PETRI_TRANSITIONS=269} [2024-06-03 20:41:55,721 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 269 predicate places. [2024-06-03 20:41:55,721 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 269 transitions, 3326 flow [2024-06-03 20:41:55,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:41:55,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:41:55,721 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 20:41:55,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-03 20:41:55,722 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 20:41:55,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:41:55,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1182968225, now seen corresponding path program 15 times [2024-06-03 20:41:55,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:41:55,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439818813] [2024-06-03 20:41:55,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:41:55,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:41:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:42:00,029 INFO 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 20:42:00,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:42:00,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439818813] [2024-06-03 20:42:00,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439818813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:42:00,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:42:00,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:42:00,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805505937] [2024-06-03 20:42:00,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:42:00,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:42:00,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:42:00,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:42:00,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:42:00,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:42:00,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 269 transitions, 3326 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:00,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:42:00,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:42:00,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:42:00,667 INFO L124 PetriNetUnfolderBase]: 758/1339 cut-off events. [2024-06-03 20:42:00,667 INFO L125 PetriNetUnfolderBase]: For 87736/87736 co-relation queries the response was YES. [2024-06-03 20:42:00,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9809 conditions, 1339 events. 758/1339 cut-off events. For 87736/87736 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 7017 event pairs, 120 based on Foata normal form. 2/1341 useless extension candidates. Maximal degree in co-relation 9668. Up to 1182 conditions per place. [2024-06-03 20:42:00,681 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 237 selfloop transitions, 44 changer transitions 0/283 dead transitions. [2024-06-03 20:42:00,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 283 transitions, 3970 flow [2024-06-03 20:42:00,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:42:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:42:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-03 20:42:00,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3367003367003367 [2024-06-03 20:42:00,682 INFO L175 Difference]: Start difference. First operand has 301 places, 269 transitions, 3326 flow. Second operand 9 states and 100 transitions. [2024-06-03 20:42:00,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 283 transitions, 3970 flow [2024-06-03 20:42:01,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 283 transitions, 3857 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 20:42:01,040 INFO L231 Difference]: Finished difference. Result has 304 places, 270 transitions, 3337 flow [2024-06-03 20:42:01,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3213, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3337, PETRI_PLACES=304, PETRI_TRANSITIONS=270} [2024-06-03 20:42:01,040 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 272 predicate places. [2024-06-03 20:42:01,040 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 270 transitions, 3337 flow [2024-06-03 20:42:01,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:01,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:42:01,041 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 20:42:01,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-03 20:42:01,041 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 20:42:01,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:42:01,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1228483691, now seen corresponding path program 12 times [2024-06-03 20:42:01,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:42:01,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350303395] [2024-06-03 20:42:01,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:42:01,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:42:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:42:09,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 20:42:09,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:42:09,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350303395] [2024-06-03 20:42:09,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350303395] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:42:09,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:42:09,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:42:09,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198146533] [2024-06-03 20:42:09,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:42:09,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:42:09,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:42:09,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:42:09,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:42:09,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:42:09,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 270 transitions, 3337 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:09,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:42:09,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:42:09,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:42:10,265 INFO L124 PetriNetUnfolderBase]: 774/1365 cut-off events. [2024-06-03 20:42:10,265 INFO L125 PetriNetUnfolderBase]: For 96315/96315 co-relation queries the response was YES. [2024-06-03 20:42:10,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10189 conditions, 1365 events. 774/1365 cut-off events. For 96315/96315 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 7175 event pairs, 76 based on Foata normal form. 2/1367 useless extension candidates. Maximal degree in co-relation 10047. Up to 1044 conditions per place. [2024-06-03 20:42:10,279 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 206 selfloop transitions, 87 changer transitions 0/295 dead transitions. [2024-06-03 20:42:10,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 295 transitions, 4287 flow [2024-06-03 20:42:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:42:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:42:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-03 20:42:10,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-03 20:42:10,280 INFO L175 Difference]: Start difference. First operand has 304 places, 270 transitions, 3337 flow. Second operand 10 states and 120 transitions. [2024-06-03 20:42:10,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 295 transitions, 4287 flow [2024-06-03 20:42:10,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 295 transitions, 4173 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-03 20:42:10,631 INFO L231 Difference]: Finished difference. Result has 307 places, 274 transitions, 3514 flow [2024-06-03 20:42:10,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3223, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3514, PETRI_PLACES=307, PETRI_TRANSITIONS=274} [2024-06-03 20:42:10,632 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 275 predicate places. [2024-06-03 20:42:10,632 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 274 transitions, 3514 flow [2024-06-03 20:42:10,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:10,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:42:10,632 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 20:42:10,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-03 20:42:10,632 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 20:42:10,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:42:10,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1188690236, now seen corresponding path program 2 times [2024-06-03 20:42:10,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:42:10,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005856669] [2024-06-03 20:42:10,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:42:10,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:42:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:42:16,684 INFO 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 20:42:16,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:42:16,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005856669] [2024-06-03 20:42:16,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005856669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:42:16,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:42:16,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:42:16,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094001947] [2024-06-03 20:42:16,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:42:16,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:42:16,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:42:16,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:42:16,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:42:16,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:42:16,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 274 transitions, 3514 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:16,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:42:16,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:42:16,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:42:17,464 INFO L124 PetriNetUnfolderBase]: 772/1362 cut-off events. [2024-06-03 20:42:17,464 INFO L125 PetriNetUnfolderBase]: For 92330/92330 co-relation queries the response was YES. [2024-06-03 20:42:17,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10213 conditions, 1362 events. 772/1362 cut-off events. For 92330/92330 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 7185 event pairs, 174 based on Foata normal form. 1/1363 useless extension candidates. Maximal degree in co-relation 10070. Up to 1257 conditions per place. [2024-06-03 20:42:17,478 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 248 selfloop transitions, 35 changer transitions 0/285 dead transitions. [2024-06-03 20:42:17,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 285 transitions, 4116 flow [2024-06-03 20:42:17,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:42:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:42:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-03 20:42:17,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32996632996632996 [2024-06-03 20:42:17,479 INFO L175 Difference]: Start difference. First operand has 307 places, 274 transitions, 3514 flow. Second operand 9 states and 98 transitions. [2024-06-03 20:42:17,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 285 transitions, 4116 flow [2024-06-03 20:42:17,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 285 transitions, 3945 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-03 20:42:17,817 INFO L231 Difference]: Finished difference. Result has 310 places, 274 transitions, 3423 flow [2024-06-03 20:42:17,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3343, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3423, PETRI_PLACES=310, PETRI_TRANSITIONS=274} [2024-06-03 20:42:17,820 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 278 predicate places. [2024-06-03 20:42:17,820 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 274 transitions, 3423 flow [2024-06-03 20:42:17,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:17,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:42:17,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:42:17,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-03 20:42:17,821 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 20:42:17,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:42:17,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1445113603, now seen corresponding path program 16 times [2024-06-03 20:42:17,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:42:17,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144532370] [2024-06-03 20:42:17,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:42:17,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:42:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:42:21,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 20:42:21,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:42:21,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144532370] [2024-06-03 20:42:21,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144532370] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:42:21,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:42:21,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:42:21,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127927008] [2024-06-03 20:42:21,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:42:21,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:42:21,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:42:21,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:42:21,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:42:22,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:42:22,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 274 transitions, 3423 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:22,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:42:22,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:42:22,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:42:22,616 INFO L124 PetriNetUnfolderBase]: 776/1370 cut-off events. [2024-06-03 20:42:22,616 INFO L125 PetriNetUnfolderBase]: For 97264/97264 co-relation queries the response was YES. [2024-06-03 20:42:22,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10242 conditions, 1370 events. 776/1370 cut-off events. For 97264/97264 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 7221 event pairs, 123 based on Foata normal form. 2/1372 useless extension candidates. Maximal degree in co-relation 10097. Up to 1213 conditions per place. [2024-06-03 20:42:22,630 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 243 selfloop transitions, 43 changer transitions 0/288 dead transitions. [2024-06-03 20:42:22,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 288 transitions, 4073 flow [2024-06-03 20:42:22,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:42:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:42:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-03 20:42:22,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 20:42:22,632 INFO L175 Difference]: Start difference. First operand has 310 places, 274 transitions, 3423 flow. Second operand 9 states and 99 transitions. [2024-06-03 20:42:22,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 288 transitions, 4073 flow [2024-06-03 20:42:23,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 288 transitions, 3933 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-03 20:42:23,029 INFO L231 Difference]: Finished difference. Result has 311 places, 275 transitions, 3407 flow [2024-06-03 20:42:23,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3283, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3407, PETRI_PLACES=311, PETRI_TRANSITIONS=275} [2024-06-03 20:42:23,030 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 279 predicate places. [2024-06-03 20:42:23,030 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 275 transitions, 3407 flow [2024-06-03 20:42:23,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:23,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:42:23,030 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 20:42:23,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-03 20:42:23,031 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 20:42:23,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:42:23,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1382629367, now seen corresponding path program 13 times [2024-06-03 20:42:23,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:42:23,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504773463] [2024-06-03 20:42:23,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:42:23,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:42:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:42:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:42:28,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:42:28,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504773463] [2024-06-03 20:42:28,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504773463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:42:28,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:42:28,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:42:28,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650205357] [2024-06-03 20:42:28,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:42:28,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:42:28,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:42:28,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:42:28,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:42:28,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:42:28,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 275 transitions, 3407 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:28,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:42:28,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:42:28,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:42:29,642 INFO L124 PetriNetUnfolderBase]: 804/1416 cut-off events. [2024-06-03 20:42:29,642 INFO L125 PetriNetUnfolderBase]: For 104538/104538 co-relation queries the response was YES. [2024-06-03 20:42:29,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10719 conditions, 1416 events. 804/1416 cut-off events. For 104538/104538 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7517 event pairs, 119 based on Foata normal form. 2/1418 useless extension candidates. Maximal degree in co-relation 10573. Up to 1210 conditions per place. [2024-06-03 20:42:29,657 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 245 selfloop transitions, 55 changer transitions 0/302 dead transitions. [2024-06-03 20:42:29,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 302 transitions, 4389 flow [2024-06-03 20:42:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:42:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:42:29,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-03 20:42:29,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2024-06-03 20:42:29,659 INFO L175 Difference]: Start difference. First operand has 311 places, 275 transitions, 3407 flow. Second operand 10 states and 116 transitions. [2024-06-03 20:42:29,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 302 transitions, 4389 flow [2024-06-03 20:42:30,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 302 transitions, 4275 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-03 20:42:30,105 INFO L231 Difference]: Finished difference. Result has 315 places, 283 transitions, 3563 flow [2024-06-03 20:42:30,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3293, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3563, PETRI_PLACES=315, PETRI_TRANSITIONS=283} [2024-06-03 20:42:30,106 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 283 predicate places. [2024-06-03 20:42:30,106 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 283 transitions, 3563 flow [2024-06-03 20:42:30,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:30,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:42:30,106 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 20:42:30,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-03 20:42:30,106 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 20:42:30,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:42:30,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1228491131, now seen corresponding path program 14 times [2024-06-03 20:42:30,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:42:30,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848731278] [2024-06-03 20:42:30,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:42:30,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:42:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:42:35,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 20:42:35,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:42:35,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848731278] [2024-06-03 20:42:35,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848731278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:42:35,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:42:35,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:42:35,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697611855] [2024-06-03 20:42:35,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:42:35,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:42:35,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:42:35,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:42:35,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:42:35,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:42:35,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 283 transitions, 3563 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:35,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:42:35,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:42:35,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:42:36,638 INFO L124 PetriNetUnfolderBase]: 810/1426 cut-off events. [2024-06-03 20:42:36,638 INFO L125 PetriNetUnfolderBase]: For 107186/107186 co-relation queries the response was YES. [2024-06-03 20:42:36,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10884 conditions, 1426 events. 810/1426 cut-off events. For 107186/107186 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 7569 event pairs, 80 based on Foata normal form. 2/1428 useless extension candidates. Maximal degree in co-relation 10736. Up to 1101 conditions per place. [2024-06-03 20:42:36,651 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 215 selfloop transitions, 88 changer transitions 0/305 dead transitions. [2024-06-03 20:42:36,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 305 transitions, 4475 flow [2024-06-03 20:42:36,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:42:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:42:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-03 20:42:36,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-03 20:42:36,652 INFO L175 Difference]: Start difference. First operand has 315 places, 283 transitions, 3563 flow. Second operand 10 states and 120 transitions. [2024-06-03 20:42:36,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 305 transitions, 4475 flow [2024-06-03 20:42:37,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 305 transitions, 4353 flow, removed 33 selfloop flow, removed 5 redundant places. [2024-06-03 20:42:37,111 INFO L231 Difference]: Finished difference. Result has 320 places, 285 transitions, 3672 flow [2024-06-03 20:42:37,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3441, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3672, PETRI_PLACES=320, PETRI_TRANSITIONS=285} [2024-06-03 20:42:37,111 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 288 predicate places. [2024-06-03 20:42:37,111 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 285 transitions, 3672 flow [2024-06-03 20:42:37,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:37,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:42:37,112 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 20:42:37,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-03 20:42:37,112 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 20:42:37,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:42:37,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1382621927, now seen corresponding path program 15 times [2024-06-03 20:42:37,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:42:37,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268575484] [2024-06-03 20:42:37,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:42:37,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:42:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:42:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:42:43,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:42:43,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268575484] [2024-06-03 20:42:43,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268575484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:42:43,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:42:43,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:42:43,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55378632] [2024-06-03 20:42:43,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:42:43,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:42:43,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:42:43,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:42:43,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:42:43,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:42:43,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 285 transitions, 3672 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:43,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:42:43,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:42:43,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:42:44,112 INFO L124 PetriNetUnfolderBase]: 816/1436 cut-off events. [2024-06-03 20:42:44,113 INFO L125 PetriNetUnfolderBase]: For 109672/109672 co-relation queries the response was YES. [2024-06-03 20:42:44,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11122 conditions, 1436 events. 816/1436 cut-off events. For 109672/109672 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 7632 event pairs, 121 based on Foata normal form. 2/1438 useless extension candidates. Maximal degree in co-relation 10972. Up to 1226 conditions per place. [2024-06-03 20:42:44,129 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 247 selfloop transitions, 56 changer transitions 0/305 dead transitions. [2024-06-03 20:42:44,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 305 transitions, 4572 flow [2024-06-03 20:42:44,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:42:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:42:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-03 20:42:44,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2024-06-03 20:42:44,130 INFO L175 Difference]: Start difference. First operand has 320 places, 285 transitions, 3672 flow. Second operand 10 states and 116 transitions. [2024-06-03 20:42:44,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 305 transitions, 4572 flow [2024-06-03 20:42:44,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 305 transitions, 4365 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-03 20:42:44,611 INFO L231 Difference]: Finished difference. Result has 323 places, 287 transitions, 3632 flow [2024-06-03 20:42:44,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3465, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3632, PETRI_PLACES=323, PETRI_TRANSITIONS=287} [2024-06-03 20:42:44,612 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 291 predicate places. [2024-06-03 20:42:44,612 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 287 transitions, 3632 flow [2024-06-03 20:42:44,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:44,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:42:44,628 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 20:42:44,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-03 20:42:44,629 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 20:42:44,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:42:44,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1228698893, now seen corresponding path program 17 times [2024-06-03 20:42:44,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:42:44,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961632917] [2024-06-03 20:42:44,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:42:44,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:42:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:42:48,720 INFO 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 20:42:48,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:42:48,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961632917] [2024-06-03 20:42:48,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961632917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:42:48,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:42:48,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:42:48,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983148527] [2024-06-03 20:42:48,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:42:48,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:42:48,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:42:48,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:42:48,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:42:48,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:42:48,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 287 transitions, 3632 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:48,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:42:48,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:42:48,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:42:49,534 INFO L124 PetriNetUnfolderBase]: 820/1444 cut-off events. [2024-06-03 20:42:49,534 INFO L125 PetriNetUnfolderBase]: For 112352/112352 co-relation queries the response was YES. [2024-06-03 20:42:49,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11101 conditions, 1444 events. 820/1444 cut-off events. For 112352/112352 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 7677 event pairs, 81 based on Foata normal form. 2/1446 useless extension candidates. Maximal degree in co-relation 10950. Up to 1168 conditions per place. [2024-06-03 20:42:49,551 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 223 selfloop transitions, 78 changer transitions 0/303 dead transitions. [2024-06-03 20:42:49,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 303 transitions, 4332 flow [2024-06-03 20:42:49,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:42:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:42:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-03 20:42:49,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3468013468013468 [2024-06-03 20:42:49,553 INFO L175 Difference]: Start difference. First operand has 323 places, 287 transitions, 3632 flow. Second operand 9 states and 103 transitions. [2024-06-03 20:42:49,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 303 transitions, 4332 flow [2024-06-03 20:42:50,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 303 transitions, 4195 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-03 20:42:50,033 INFO L231 Difference]: Finished difference. Result has 326 places, 288 transitions, 3691 flow [2024-06-03 20:42:50,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3495, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3691, PETRI_PLACES=326, PETRI_TRANSITIONS=288} [2024-06-03 20:42:50,034 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 294 predicate places. [2024-06-03 20:42:50,034 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 288 transitions, 3691 flow [2024-06-03 20:42:50,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:50,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:42:50,034 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 20:42:50,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-03 20:42:50,034 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 20:42:50,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:42:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1183118327, now seen corresponding path program 16 times [2024-06-03 20:42:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:42:50,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245371236] [2024-06-03 20:42:50,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:42:50,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:42:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:42:56,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 20:42:56,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:42:56,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245371236] [2024-06-03 20:42:56,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245371236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:42:56,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:42:56,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:42:56,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323763101] [2024-06-03 20:42:56,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:42:56,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:42:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:42:56,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:42:56,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:42:56,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:42:56,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 288 transitions, 3691 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:56,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:42:56,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:42:56,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:42:56,865 INFO L124 PetriNetUnfolderBase]: 826/1454 cut-off events. [2024-06-03 20:42:56,866 INFO L125 PetriNetUnfolderBase]: For 115349/115349 co-relation queries the response was YES. [2024-06-03 20:42:56,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11265 conditions, 1454 events. 826/1454 cut-off events. For 115349/115349 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 7772 event pairs, 136 based on Foata normal form. 2/1456 useless extension candidates. Maximal degree in co-relation 11113. Up to 1287 conditions per place. [2024-06-03 20:42:56,882 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 256 selfloop transitions, 47 changer transitions 0/305 dead transitions. [2024-06-03 20:42:56,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 305 transitions, 4427 flow [2024-06-03 20:42:56,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:42:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:42:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-03 20:42:56,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 20:42:56,883 INFO L175 Difference]: Start difference. First operand has 326 places, 288 transitions, 3691 flow. Second operand 10 states and 110 transitions. [2024-06-03 20:42:56,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 305 transitions, 4427 flow [2024-06-03 20:42:57,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 305 transitions, 4241 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-03 20:42:57,400 INFO L231 Difference]: Finished difference. Result has 329 places, 290 transitions, 3670 flow [2024-06-03 20:42:57,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3505, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3670, PETRI_PLACES=329, PETRI_TRANSITIONS=290} [2024-06-03 20:42:57,400 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 297 predicate places. [2024-06-03 20:42:57,400 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 290 transitions, 3670 flow [2024-06-03 20:42:57,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:42:57,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:42:57,401 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 20:42:57,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-03 20:42:57,401 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 20:42:57,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:42:57,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1382420117, now seen corresponding path program 17 times [2024-06-03 20:42:57,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:42:57,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988759179] [2024-06-03 20:42:57,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:42:57,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:42:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:43:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:43:03,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:43:03,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988759179] [2024-06-03 20:43:03,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988759179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:43:03,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:43:03,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:43:03,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2660642] [2024-06-03 20:43:03,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:43:03,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:43:03,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:43:03,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:43:03,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:43:03,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:43:03,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 290 transitions, 3670 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:03,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:43:03,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:43:03,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:43:04,073 INFO L124 PetriNetUnfolderBase]: 822/1448 cut-off events. [2024-06-03 20:43:04,073 INFO L125 PetriNetUnfolderBase]: For 110425/110425 co-relation queries the response was YES. [2024-06-03 20:43:04,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10960 conditions, 1448 events. 822/1448 cut-off events. For 110425/110425 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 7744 event pairs, 129 based on Foata normal form. 2/1450 useless extension candidates. Maximal degree in co-relation 10807. Up to 1277 conditions per place. [2024-06-03 20:43:04,087 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 254 selfloop transitions, 49 changer transitions 0/305 dead transitions. [2024-06-03 20:43:04,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 305 transitions, 4342 flow [2024-06-03 20:43:04,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:43:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:43:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-03 20:43:04,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303030303030303 [2024-06-03 20:43:04,088 INFO L175 Difference]: Start difference. First operand has 329 places, 290 transitions, 3670 flow. Second operand 10 states and 109 transitions. [2024-06-03 20:43:04,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 305 transitions, 4342 flow [2024-06-03 20:43:04,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 305 transitions, 4153 flow, removed 49 selfloop flow, removed 8 redundant places. [2024-06-03 20:43:04,610 INFO L231 Difference]: Finished difference. Result has 331 places, 290 transitions, 3584 flow [2024-06-03 20:43:04,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3481, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3584, PETRI_PLACES=331, PETRI_TRANSITIONS=290} [2024-06-03 20:43:04,610 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 299 predicate places. [2024-06-03 20:43:04,610 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 290 transitions, 3584 flow [2024-06-03 20:43:04,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:04,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:43:04,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:43:04,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-03 20:43:04,611 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 20:43:04,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:43:04,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1188474755, now seen corresponding path program 18 times [2024-06-03 20:43:04,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:43:04,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904317145] [2024-06-03 20:43:04,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:43:04,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:43:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:43:08,434 INFO 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 20:43:08,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:43:08,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904317145] [2024-06-03 20:43:08,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904317145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:43:08,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:43:08,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:43:08,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051337453] [2024-06-03 20:43:08,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:43:08,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:43:08,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:43:08,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:43:08,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:43:08,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:43:08,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 290 transitions, 3584 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:08,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:43:08,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:43:08,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:43:09,106 INFO L124 PetriNetUnfolderBase]: 819/1443 cut-off events. [2024-06-03 20:43:09,106 INFO L125 PetriNetUnfolderBase]: For 104976/104976 co-relation queries the response was YES. [2024-06-03 20:43:09,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10653 conditions, 1443 events. 819/1443 cut-off events. For 104976/104976 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 7701 event pairs, 128 based on Foata normal form. 2/1445 useless extension candidates. Maximal degree in co-relation 10499. Up to 1259 conditions per place. [2024-06-03 20:43:09,123 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 251 selfloop transitions, 52 changer transitions 0/305 dead transitions. [2024-06-03 20:43:09,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 305 transitions, 4256 flow [2024-06-03 20:43:09,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:43:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:43:09,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-03 20:43:09,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3501683501683502 [2024-06-03 20:43:09,125 INFO L175 Difference]: Start difference. First operand has 331 places, 290 transitions, 3584 flow. Second operand 9 states and 104 transitions. [2024-06-03 20:43:09,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 305 transitions, 4256 flow [2024-06-03 20:43:09,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 305 transitions, 4145 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-03 20:43:09,640 INFO L231 Difference]: Finished difference. Result has 331 places, 290 transitions, 3583 flow [2024-06-03 20:43:09,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3473, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3583, PETRI_PLACES=331, PETRI_TRANSITIONS=290} [2024-06-03 20:43:09,641 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 299 predicate places. [2024-06-03 20:43:09,641 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 290 transitions, 3583 flow [2024-06-03 20:43:09,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:09,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:43:09,642 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 20:43:09,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-03 20:43:09,642 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 20:43:09,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:43:09,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1390048597, now seen corresponding path program 3 times [2024-06-03 20:43:09,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:43:09,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963368223] [2024-06-03 20:43:09,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:43:09,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:43:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:43:15,791 INFO 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 20:43:15,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:43:15,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963368223] [2024-06-03 20:43:15,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963368223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:43:15,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:43:15,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:43:15,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862559802] [2024-06-03 20:43:15,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:43:15,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:43:15,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:43:15,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:43:15,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:43:15,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:43:15,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 290 transitions, 3583 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:15,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:43:15,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:43:15,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:43:16,665 INFO L124 PetriNetUnfolderBase]: 827/1459 cut-off events. [2024-06-03 20:43:16,665 INFO L125 PetriNetUnfolderBase]: For 114723/114723 co-relation queries the response was YES. [2024-06-03 20:43:16,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10758 conditions, 1459 events. 827/1459 cut-off events. For 114723/114723 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 7850 event pairs, 183 based on Foata normal form. 4/1463 useless extension candidates. Maximal degree in co-relation 10603. Up to 1350 conditions per place. [2024-06-03 20:43:16,683 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 272 selfloop transitions, 34 changer transitions 0/308 dead transitions. [2024-06-03 20:43:16,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 308 transitions, 4278 flow [2024-06-03 20:43:16,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 20:43:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 20:43:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2024-06-03 20:43:16,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30808080808080807 [2024-06-03 20:43:16,684 INFO L175 Difference]: Start difference. First operand has 331 places, 290 transitions, 3583 flow. Second operand 12 states and 122 transitions. [2024-06-03 20:43:16,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 308 transitions, 4278 flow [2024-06-03 20:43:17,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 308 transitions, 4080 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-03 20:43:17,169 INFO L231 Difference]: Finished difference. Result has 335 places, 291 transitions, 3479 flow [2024-06-03 20:43:17,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3385, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3479, PETRI_PLACES=335, PETRI_TRANSITIONS=291} [2024-06-03 20:43:17,169 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 303 predicate places. [2024-06-03 20:43:17,169 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 291 transitions, 3479 flow [2024-06-03 20:43:17,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:17,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:43:17,176 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 20:43:17,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-03 20:43:17,177 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 20:43:17,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:43:17,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1188480707, now seen corresponding path program 18 times [2024-06-03 20:43:17,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:43:17,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423752813] [2024-06-03 20:43:17,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:43:17,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:43:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:43:22,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:43:22,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:43:22,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423752813] [2024-06-03 20:43:22,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423752813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:43:22,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:43:22,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:43:22,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67647367] [2024-06-03 20:43:22,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:43:22,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:43:22,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:43:22,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:43:22,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:43:22,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:43:22,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 291 transitions, 3479 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:22,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:43:22,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:43:22,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:43:23,166 INFO L124 PetriNetUnfolderBase]: 833/1469 cut-off events. [2024-06-03 20:43:23,166 INFO L125 PetriNetUnfolderBase]: For 107301/107301 co-relation queries the response was YES. [2024-06-03 20:43:23,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10687 conditions, 1469 events. 833/1469 cut-off events. For 107301/107301 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 7886 event pairs, 128 based on Foata normal form. 2/1471 useless extension candidates. Maximal degree in co-relation 10531. Up to 1265 conditions per place. [2024-06-03 20:43:23,183 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 250 selfloop transitions, 58 changer transitions 0/310 dead transitions. [2024-06-03 20:43:23,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 310 transitions, 4243 flow [2024-06-03 20:43:23,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:43:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:43:23,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-03 20:43:23,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2024-06-03 20:43:23,184 INFO L175 Difference]: Start difference. First operand has 335 places, 291 transitions, 3479 flow. Second operand 10 states and 114 transitions. [2024-06-03 20:43:23,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 310 transitions, 4243 flow [2024-06-03 20:43:23,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 310 transitions, 4076 flow, removed 15 selfloop flow, removed 12 redundant places. [2024-06-03 20:43:23,676 INFO L231 Difference]: Finished difference. Result has 333 places, 293 transitions, 3506 flow [2024-06-03 20:43:23,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3314, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3506, PETRI_PLACES=333, PETRI_TRANSITIONS=293} [2024-06-03 20:43:23,676 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 301 predicate places. [2024-06-03 20:43:23,677 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 293 transitions, 3506 flow [2024-06-03 20:43:23,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:23,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:43:23,677 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 20:43:23,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-03 20:43:23,677 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 20:43:23,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:43:23,677 INFO L85 PathProgramCache]: Analyzing trace with hash -966543843, now seen corresponding path program 19 times [2024-06-03 20:43:23,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:43:23,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737764236] [2024-06-03 20:43:23,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:43:23,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:43:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:43:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:43:29,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:43:29,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737764236] [2024-06-03 20:43:29,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737764236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:43:29,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:43:29,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:43:29,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613762934] [2024-06-03 20:43:29,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:43:29,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:43:29,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:43:29,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:43:29,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:43:29,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:43:29,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 293 transitions, 3506 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:29,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:43:29,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:43:29,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:43:30,411 INFO L124 PetriNetUnfolderBase]: 829/1465 cut-off events. [2024-06-03 20:43:30,411 INFO L125 PetriNetUnfolderBase]: For 102067/102067 co-relation queries the response was YES. [2024-06-03 20:43:30,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10341 conditions, 1465 events. 829/1465 cut-off events. For 102067/102067 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 7870 event pairs, 81 based on Foata normal form. 2/1467 useless extension candidates. Maximal degree in co-relation 10187. Up to 1177 conditions per place. [2024-06-03 20:43:30,427 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 227 selfloop transitions, 81 changer transitions 0/310 dead transitions. [2024-06-03 20:43:30,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 310 transitions, 4202 flow [2024-06-03 20:43:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:43:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:43:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-03 20:43:30,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3424242424242424 [2024-06-03 20:43:30,429 INFO L175 Difference]: Start difference. First operand has 333 places, 293 transitions, 3506 flow. Second operand 10 states and 113 transitions. [2024-06-03 20:43:30,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 310 transitions, 4202 flow [2024-06-03 20:43:30,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 310 transitions, 3991 flow, removed 49 selfloop flow, removed 9 redundant places. [2024-06-03 20:43:30,911 INFO L231 Difference]: Finished difference. Result has 334 places, 293 transitions, 3462 flow [2024-06-03 20:43:30,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3295, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3462, PETRI_PLACES=334, PETRI_TRANSITIONS=293} [2024-06-03 20:43:30,911 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 302 predicate places. [2024-06-03 20:43:30,911 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 293 transitions, 3462 flow [2024-06-03 20:43:30,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:30,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:43:30,912 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 20:43:30,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-03 20:43:30,912 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 20:43:30,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:43:30,913 INFO L85 PathProgramCache]: Analyzing trace with hash -958915363, now seen corresponding path program 4 times [2024-06-03 20:43:30,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:43:30,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726659260] [2024-06-03 20:43:30,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:43:30,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:43:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:43: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 20:43:38,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:43:38,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726659260] [2024-06-03 20:43:38,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726659260] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:43:38,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:43:38,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:43:38,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237716221] [2024-06-03 20:43:38,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:43:38,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:43:38,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:43:38,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:43:38,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:43:38,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:43:38,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 293 transitions, 3462 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:38,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:43:38,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:43:38,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:43:39,180 INFO L124 PetriNetUnfolderBase]: 837/1481 cut-off events. [2024-06-03 20:43:39,181 INFO L125 PetriNetUnfolderBase]: For 108755/108755 co-relation queries the response was YES. [2024-06-03 20:43:39,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10353 conditions, 1481 events. 837/1481 cut-off events. For 108755/108755 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8028 event pairs, 156 based on Foata normal form. 4/1485 useless extension candidates. Maximal degree in co-relation 10199. Up to 1340 conditions per place. [2024-06-03 20:43:39,198 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 266 selfloop transitions, 43 changer transitions 0/311 dead transitions. [2024-06-03 20:43:39,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 311 transitions, 4160 flow [2024-06-03 20:43:39,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:43:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:43:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-03 20:43:39,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31955922865013775 [2024-06-03 20:43:39,212 INFO L175 Difference]: Start difference. First operand has 334 places, 293 transitions, 3462 flow. Second operand 11 states and 116 transitions. [2024-06-03 20:43:39,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 311 transitions, 4160 flow [2024-06-03 20:43:39,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 311 transitions, 3982 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-03 20:43:39,681 INFO L231 Difference]: Finished difference. Result has 335 places, 294 transitions, 3396 flow [2024-06-03 20:43:39,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3284, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3396, PETRI_PLACES=335, PETRI_TRANSITIONS=294} [2024-06-03 20:43:39,681 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 303 predicate places. [2024-06-03 20:43:39,681 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 294 transitions, 3396 flow [2024-06-03 20:43:39,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:39,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:43:39,681 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 20:43:39,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-03 20:43:39,682 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 20:43:39,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:43:39,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1450839055, now seen corresponding path program 20 times [2024-06-03 20:43:39,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:43:39,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318653980] [2024-06-03 20:43:39,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:43:39,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:43:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:43:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:43:45,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:43:45,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318653980] [2024-06-03 20:43:45,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318653980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:43:45,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:43:45,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:43:45,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125437410] [2024-06-03 20:43:45,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:43:45,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:43:45,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:43:45,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:43:45,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:43:45,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:43:45,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 294 transitions, 3396 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:45,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:43:45,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:43:45,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:43:46,420 INFO L124 PetriNetUnfolderBase]: 853/1507 cut-off events. [2024-06-03 20:43:46,420 INFO L125 PetriNetUnfolderBase]: For 112530/112530 co-relation queries the response was YES. [2024-06-03 20:43:46,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10728 conditions, 1507 events. 853/1507 cut-off events. For 112530/112530 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 8148 event pairs, 125 based on Foata normal form. 2/1509 useless extension candidates. Maximal degree in co-relation 10573. Up to 1220 conditions per place. [2024-06-03 20:43:46,437 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 238 selfloop transitions, 78 changer transitions 0/318 dead transitions. [2024-06-03 20:43:46,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 318 transitions, 4436 flow [2024-06-03 20:43:46,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:43:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:43:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-03 20:43:46,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3606060606060606 [2024-06-03 20:43:46,438 INFO L175 Difference]: Start difference. First operand has 335 places, 294 transitions, 3396 flow. Second operand 10 states and 119 transitions. [2024-06-03 20:43:46,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 318 transitions, 4436 flow [2024-06-03 20:43:47,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 318 transitions, 4334 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-03 20:43:47,012 INFO L231 Difference]: Finished difference. Result has 336 places, 298 transitions, 3598 flow [2024-06-03 20:43:47,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3294, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3598, PETRI_PLACES=336, PETRI_TRANSITIONS=298} [2024-06-03 20:43:47,014 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 304 predicate places. [2024-06-03 20:43:47,014 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 298 transitions, 3598 flow [2024-06-03 20:43:47,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:47,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:43:47,014 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 20:43:47,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-03 20:43:47,015 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 20:43:47,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:43:47,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1450831615, now seen corresponding path program 21 times [2024-06-03 20:43:47,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:43:47,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915946788] [2024-06-03 20:43:47,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:43:47,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:43:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:43:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:43:52,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:43:52,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915946788] [2024-06-03 20:43:52,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915946788] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:43:52,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:43:52,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:43:52,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406846331] [2024-06-03 20:43:52,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:43:52,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:43:52,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:43:52,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:43:52,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:43:52,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:43:52,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 298 transitions, 3598 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:52,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:43:52,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:43:52,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:43:53,627 INFO L124 PetriNetUnfolderBase]: 849/1501 cut-off events. [2024-06-03 20:43:53,627 INFO L125 PetriNetUnfolderBase]: For 107461/107461 co-relation queries the response was YES. [2024-06-03 20:43:53,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10629 conditions, 1501 events. 849/1501 cut-off events. For 107461/107461 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 8129 event pairs, 125 based on Foata normal form. 2/1503 useless extension candidates. Maximal degree in co-relation 10473. Up to 1217 conditions per place. [2024-06-03 20:43:53,645 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 239 selfloop transitions, 75 changer transitions 0/316 dead transitions. [2024-06-03 20:43:53,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 316 transitions, 4314 flow [2024-06-03 20:43:53,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:43:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:43:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-03 20:43:53,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3575757575757576 [2024-06-03 20:43:53,646 INFO L175 Difference]: Start difference. First operand has 336 places, 298 transitions, 3598 flow. Second operand 10 states and 118 transitions. [2024-06-03 20:43:53,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 316 transitions, 4314 flow [2024-06-03 20:43:54,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 316 transitions, 4117 flow, removed 58 selfloop flow, removed 7 redundant places. [2024-06-03 20:43:54,181 INFO L231 Difference]: Finished difference. Result has 339 places, 298 transitions, 3559 flow [2024-06-03 20:43:54,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3401, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3559, PETRI_PLACES=339, PETRI_TRANSITIONS=298} [2024-06-03 20:43:54,182 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 307 predicate places. [2024-06-03 20:43:54,182 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 298 transitions, 3559 flow [2024-06-03 20:43:54,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:54,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:43:54,182 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 20:43:54,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-03 20:43:54,182 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 20:43:54,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:43:54,183 INFO L85 PathProgramCache]: Analyzing trace with hash -709834083, now seen corresponding path program 22 times [2024-06-03 20:43:54,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:43:54,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941864398] [2024-06-03 20:43:54,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:43:54,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:43:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:43:59,284 INFO 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 20:43:59,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:43:59,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941864398] [2024-06-03 20:43:59,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941864398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:43:59,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:43:59,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:43:59,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660000489] [2024-06-03 20:43:59,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:43:59,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:43:59,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:43:59,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:43:59,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:43:59,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:43:59,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 298 transitions, 3559 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:43:59,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:43:59,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:43:59,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:44:00,184 INFO L124 PetriNetUnfolderBase]: 875/1543 cut-off events. [2024-06-03 20:44:00,184 INFO L125 PetriNetUnfolderBase]: For 123449/123449 co-relation queries the response was YES. [2024-06-03 20:44:00,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11367 conditions, 1543 events. 875/1543 cut-off events. For 123449/123449 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 8377 event pairs, 76 based on Foata normal form. 2/1545 useless extension candidates. Maximal degree in co-relation 11210. Up to 625 conditions per place. [2024-06-03 20:44:00,200 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 183 selfloop transitions, 145 changer transitions 0/330 dead transitions. [2024-06-03 20:44:00,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 330 transitions, 5113 flow [2024-06-03 20:44:00,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:44:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:44:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-03 20:44:00,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38484848484848483 [2024-06-03 20:44:00,201 INFO L175 Difference]: Start difference. First operand has 339 places, 298 transitions, 3559 flow. Second operand 10 states and 127 transitions. [2024-06-03 20:44:00,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 330 transitions, 5113 flow [2024-06-03 20:44:00,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 330 transitions, 4927 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-03 20:44:00,727 INFO L231 Difference]: Finished difference. Result has 339 places, 307 transitions, 3938 flow [2024-06-03 20:44:00,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3379, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3938, PETRI_PLACES=339, PETRI_TRANSITIONS=307} [2024-06-03 20:44:00,728 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 307 predicate places. [2024-06-03 20:44:00,728 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 307 transitions, 3938 flow [2024-06-03 20:44:00,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:00,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:44:00,728 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 20:44:00,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-03 20:44:00,729 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 20:44:00,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:44:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash -711030815, now seen corresponding path program 23 times [2024-06-03 20:44:00,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:44:00,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384672475] [2024-06-03 20:44:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:44:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:44:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:44:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:44:05,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:44:05,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384672475] [2024-06-03 20:44:05,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384672475] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:44:05,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:44:05,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:44:05,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341586518] [2024-06-03 20:44:05,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:44:05,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:44:05,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:44:05,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:44:05,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:44:06,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:44:06,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 307 transitions, 3938 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:06,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:44:06,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:44:06,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:44:06,844 INFO L124 PetriNetUnfolderBase]: 871/1537 cut-off events. [2024-06-03 20:44:06,844 INFO L125 PetriNetUnfolderBase]: For 116126/116126 co-relation queries the response was YES. [2024-06-03 20:44:06,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11299 conditions, 1537 events. 871/1537 cut-off events. For 116126/116126 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 8349 event pairs, 78 based on Foata normal form. 2/1539 useless extension candidates. Maximal degree in co-relation 11142. Up to 624 conditions per place. [2024-06-03 20:44:06,863 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 181 selfloop transitions, 144 changer transitions 0/327 dead transitions. [2024-06-03 20:44:06,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 327 transitions, 5034 flow [2024-06-03 20:44:06,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:44:06,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:44:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 20:44:06,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-03 20:44:06,864 INFO L175 Difference]: Start difference. First operand has 339 places, 307 transitions, 3938 flow. Second operand 10 states and 124 transitions. [2024-06-03 20:44:06,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 327 transitions, 5034 flow [2024-06-03 20:44:07,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 327 transitions, 4780 flow, removed 77 selfloop flow, removed 4 redundant places. [2024-06-03 20:44:07,366 INFO L231 Difference]: Finished difference. Result has 345 places, 307 transitions, 3977 flow [2024-06-03 20:44:07,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3684, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3977, PETRI_PLACES=345, PETRI_TRANSITIONS=307} [2024-06-03 20:44:07,366 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 313 predicate places. [2024-06-03 20:44:07,366 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 307 transitions, 3977 flow [2024-06-03 20:44:07,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:07,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:44:07,368 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 20:44:07,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-03 20:44:07,368 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 20:44:07,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:44:07,368 INFO L85 PathProgramCache]: Analyzing trace with hash -386012865, now seen corresponding path program 5 times [2024-06-03 20:44:07,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:44:07,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965089757] [2024-06-03 20:44:07,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:44:07,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:44:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:44:11,945 INFO 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 20:44:11,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:44:11,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965089757] [2024-06-03 20:44:11,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965089757] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:44:11,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:44:11,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:44:11,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312833341] [2024-06-03 20:44:11,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:44:11,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:44:11,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:44:11,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:44:11,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:44:12,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:44:12,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 307 transitions, 3977 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:12,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:44:12,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:44:12,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:44:12,605 INFO L124 PetriNetUnfolderBase]: 879/1551 cut-off events. [2024-06-03 20:44:12,605 INFO L125 PetriNetUnfolderBase]: For 125192/125192 co-relation queries the response was YES. [2024-06-03 20:44:12,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11459 conditions, 1551 events. 879/1551 cut-off events. For 125192/125192 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 8464 event pairs, 290 based on Foata normal form. 4/1555 useless extension candidates. Maximal degree in co-relation 11300. Up to 1487 conditions per place. [2024-06-03 20:44:12,623 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 299 selfloop transitions, 21 changer transitions 0/322 dead transitions. [2024-06-03 20:44:12,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 322 transitions, 4681 flow [2024-06-03 20:44:12,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:44:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:44:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-03 20:44:12,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30303030303030304 [2024-06-03 20:44:12,624 INFO L175 Difference]: Start difference. First operand has 345 places, 307 transitions, 3977 flow. Second operand 11 states and 110 transitions. [2024-06-03 20:44:12,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 322 transitions, 4681 flow [2024-06-03 20:44:13,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 322 transitions, 4382 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 20:44:13,105 INFO L231 Difference]: Finished difference. Result has 347 places, 308 transitions, 3748 flow [2024-06-03 20:44:13,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3678, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3748, PETRI_PLACES=347, PETRI_TRANSITIONS=308} [2024-06-03 20:44:13,105 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 315 predicate places. [2024-06-03 20:44:13,105 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 308 transitions, 3748 flow [2024-06-03 20:44:13,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:13,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:44:13,106 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 20:44:13,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-03 20:44:13,106 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 20:44:13,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:44:13,106 INFO L85 PathProgramCache]: Analyzing trace with hash -710753985, now seen corresponding path program 6 times [2024-06-03 20:44:13,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:44:13,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72409667] [2024-06-03 20:44:13,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:44:13,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:44:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:44:18,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 20:44:18,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:44:18,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72409667] [2024-06-03 20:44:18,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72409667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:44:18,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:44:18,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:44:18,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444200532] [2024-06-03 20:44:18,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:44:18,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:44:18,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:44:18,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:44:18,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:44:18,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:44:18,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 308 transitions, 3748 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:18,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:44:18,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:44:18,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:44:18,809 INFO L124 PetriNetUnfolderBase]: 887/1569 cut-off events. [2024-06-03 20:44:18,809 INFO L125 PetriNetUnfolderBase]: For 126945/126945 co-relation queries the response was YES. [2024-06-03 20:44:18,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11239 conditions, 1569 events. 887/1569 cut-off events. For 126945/126945 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 8610 event pairs, 151 based on Foata normal form. 4/1573 useless extension candidates. Maximal degree in co-relation 11079. Up to 1279 conditions per place. [2024-06-03 20:44:18,828 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 247 selfloop transitions, 77 changer transitions 0/326 dead transitions. [2024-06-03 20:44:18,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 326 transitions, 4480 flow [2024-06-03 20:44:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:44:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:44:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-03 20:44:18,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 20:44:18,829 INFO L175 Difference]: Start difference. First operand has 347 places, 308 transitions, 3748 flow. Second operand 11 states and 121 transitions. [2024-06-03 20:44:18,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 326 transitions, 4480 flow [2024-06-03 20:44:19,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 326 transitions, 4420 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-03 20:44:19,321 INFO L231 Difference]: Finished difference. Result has 349 places, 309 transitions, 3872 flow [2024-06-03 20:44:19,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3688, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3872, PETRI_PLACES=349, PETRI_TRANSITIONS=309} [2024-06-03 20:44:19,321 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 317 predicate places. [2024-06-03 20:44:19,321 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 309 transitions, 3872 flow [2024-06-03 20:44:19,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:19,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:44:19,322 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 20:44:19,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-03 20:44:19,322 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 20:44:19,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:44:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash -385626915, now seen corresponding path program 7 times [2024-06-03 20:44:19,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:44:19,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617446406] [2024-06-03 20:44:19,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:44:19,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:44:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:44:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:44:23,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:44:23,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617446406] [2024-06-03 20:44:23,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617446406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:44:23,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:44:23,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 20:44:23,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297185267] [2024-06-03 20:44:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:44:23,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 20:44:23,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:44:23,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 20:44:23,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 20:44:24,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:44:24,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 309 transitions, 3872 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:24,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:44:24,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:44:24,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:44:24,770 INFO L124 PetriNetUnfolderBase]: 902/1596 cut-off events. [2024-06-03 20:44:24,771 INFO L125 PetriNetUnfolderBase]: For 138945/138945 co-relation queries the response was YES. [2024-06-03 20:44:24,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11743 conditions, 1596 events. 902/1596 cut-off events. For 138945/138945 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 8788 event pairs, 297 based on Foata normal form. 4/1600 useless extension candidates. Maximal degree in co-relation 11582. Up to 1486 conditions per place. [2024-06-03 20:44:24,788 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 303 selfloop transitions, 22 changer transitions 0/327 dead transitions. [2024-06-03 20:44:24,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 327 transitions, 4804 flow [2024-06-03 20:44:24,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:44:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:44:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2024-06-03 20:44:24,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30578512396694213 [2024-06-03 20:44:24,789 INFO L175 Difference]: Start difference. First operand has 349 places, 309 transitions, 3872 flow. Second operand 11 states and 111 transitions. [2024-06-03 20:44:24,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 327 transitions, 4804 flow [2024-06-03 20:44:25,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 327 transitions, 4630 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-03 20:44:25,331 INFO L231 Difference]: Finished difference. Result has 351 places, 311 transitions, 3800 flow [2024-06-03 20:44:25,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3698, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3800, PETRI_PLACES=351, PETRI_TRANSITIONS=311} [2024-06-03 20:44:25,331 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 319 predicate places. [2024-06-03 20:44:25,331 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 311 transitions, 3800 flow [2024-06-03 20:44:25,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:25,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:44:25,331 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 20:44:25,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-03 20:44:25,332 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 20:44:25,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:44:25,332 INFO L85 PathProgramCache]: Analyzing trace with hash -659213773, now seen corresponding path program 24 times [2024-06-03 20:44:25,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:44:25,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066589170] [2024-06-03 20:44:25,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:44:25,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:44:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:44:30,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 20:44:30,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:44:30,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066589170] [2024-06-03 20:44:30,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066589170] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:44:30,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:44:30,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:44:30,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656144799] [2024-06-03 20:44:30,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:44:30,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:44:30,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:44:30,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:44:30,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:44:30,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:44:30,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 311 transitions, 3800 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:30,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:44:30,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:44:30,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:44:30,776 INFO L124 PetriNetUnfolderBase]: 904/1600 cut-off events. [2024-06-03 20:44:30,777 INFO L125 PetriNetUnfolderBase]: For 133412/133412 co-relation queries the response was YES. [2024-06-03 20:44:30,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11461 conditions, 1600 events. 904/1600 cut-off events. For 133412/133412 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 8813 event pairs, 304 based on Foata normal form. 4/1604 useless extension candidates. Maximal degree in co-relation 11299. Up to 1527 conditions per place. [2024-06-03 20:44:30,796 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 302 selfloop transitions, 23 changer transitions 0/327 dead transitions. [2024-06-03 20:44:30,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 327 transitions, 4736 flow [2024-06-03 20:44:30,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 20:44:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 20:44:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-03 20:44:30,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3242424242424242 [2024-06-03 20:44:30,798 INFO L175 Difference]: Start difference. First operand has 351 places, 311 transitions, 3800 flow. Second operand 10 states and 107 transitions. [2024-06-03 20:44:30,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 327 transitions, 4736 flow [2024-06-03 20:44:31,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 327 transitions, 4629 flow, removed 41 selfloop flow, removed 7 redundant places. [2024-06-03 20:44:31,385 INFO L231 Difference]: Finished difference. Result has 355 places, 313 transitions, 3808 flow [2024-06-03 20:44:31,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3693, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3808, PETRI_PLACES=355, PETRI_TRANSITIONS=313} [2024-06-03 20:44:31,385 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 323 predicate places. [2024-06-03 20:44:31,386 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 313 transitions, 3808 flow [2024-06-03 20:44:31,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:31,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:44:31,386 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 20:44:31,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-03 20:44:31,386 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 20:44:31,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:44:31,387 INFO L85 PathProgramCache]: Analyzing trace with hash -397054755, now seen corresponding path program 8 times [2024-06-03 20:44:31,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:44:31,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276291486] [2024-06-03 20:44:31,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:44:31,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:44:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:44:37,740 INFO 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 20:44:37,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:44:37,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276291486] [2024-06-03 20:44:37,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276291486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:44:37,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:44:37,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 20:44:37,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728958908] [2024-06-03 20:44:37,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:44:37,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 20:44:37,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:44:37,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 20:44:37,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 20:44:37,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:44:37,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 313 transitions, 3808 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:37,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:44:37,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:44:37,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:44:38,570 INFO L124 PetriNetUnfolderBase]: 898/1590 cut-off events. [2024-06-03 20:44:38,570 INFO L125 PetriNetUnfolderBase]: For 117275/117275 co-relation queries the response was YES. [2024-06-03 20:44:38,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10990 conditions, 1590 events. 898/1590 cut-off events. For 117275/117275 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 8752 event pairs, 296 based on Foata normal form. 4/1594 useless extension candidates. Maximal degree in co-relation 10825. Up to 1510 conditions per place. [2024-06-03 20:44:38,589 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 304 selfloop transitions, 21 changer transitions 0/327 dead transitions. [2024-06-03 20:44:38,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 327 transitions, 4500 flow [2024-06-03 20:44:38,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:44:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:44:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-03 20:44:38,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30303030303030304 [2024-06-03 20:44:38,590 INFO L175 Difference]: Start difference. First operand has 355 places, 313 transitions, 3808 flow. Second operand 11 states and 110 transitions. [2024-06-03 20:44:38,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 327 transitions, 4500 flow [2024-06-03 20:44:39,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 327 transitions, 4434 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-03 20:44:39,079 INFO L231 Difference]: Finished difference. Result has 358 places, 313 transitions, 3790 flow [2024-06-03 20:44:39,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3742, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3790, PETRI_PLACES=358, PETRI_TRANSITIONS=313} [2024-06-03 20:44:39,080 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 326 predicate places. [2024-06-03 20:44:39,081 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 313 transitions, 3790 flow [2024-06-03 20:44:39,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:39,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:44:39,081 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 20:44:39,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-03 20:44:39,081 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 20:44:39,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:44:39,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1017222327, now seen corresponding path program 1 times [2024-06-03 20:44:39,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:44:39,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505567433] [2024-06-03 20:44:39,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:44:39,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:44:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:44:43,914 INFO 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 20:44:43,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:44:43,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505567433] [2024-06-03 20:44:43,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505567433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:44:43,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:44:43,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 20:44:43,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973720868] [2024-06-03 20:44:43,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:44:43,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 20:44:43,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:44:43,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 20:44:43,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 20:44:43,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:44:43,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 313 transitions, 3790 flow. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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 20:44:43,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:44:43,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:44:43,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:44:44,549 INFO L124 PetriNetUnfolderBase]: 940/1669 cut-off events. [2024-06-03 20:44:44,549 INFO L125 PetriNetUnfolderBase]: For 111473/111473 co-relation queries the response was YES. [2024-06-03 20:44:44,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11379 conditions, 1669 events. 940/1669 cut-off events. For 111473/111473 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 9334 event pairs, 157 based on Foata normal form. 2/1671 useless extension candidates. Maximal degree in co-relation 11213. Up to 1481 conditions per place. [2024-06-03 20:44:44,569 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 286 selfloop transitions, 60 changer transitions 0/348 dead transitions. [2024-06-03 20:44:44,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 348 transitions, 4723 flow [2024-06-03 20:44:44,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:44:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:44:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-03 20:44:44,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33608815426997246 [2024-06-03 20:44:44,570 INFO L175 Difference]: Start difference. First operand has 358 places, 313 transitions, 3790 flow. Second operand 11 states and 122 transitions. [2024-06-03 20:44:44,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 348 transitions, 4723 flow [2024-06-03 20:44:45,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 348 transitions, 4674 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-03 20:44:45,060 INFO L231 Difference]: Finished difference. Result has 364 places, 329 transitions, 4102 flow [2024-06-03 20:44:45,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3741, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4102, PETRI_PLACES=364, PETRI_TRANSITIONS=329} [2024-06-03 20:44:45,067 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 332 predicate places. [2024-06-03 20:44:45,067 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 329 transitions, 4102 flow [2024-06-03 20:44:45,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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 20:44:45,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:44:45,068 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 20:44:45,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-03 20:44:45,068 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 20:44:45,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:44:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1941588105, now seen corresponding path program 2 times [2024-06-03 20:44:45,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:44:45,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75532427] [2024-06-03 20:44:45,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:44:45,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:44:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:44:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:44:50,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:44:50,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75532427] [2024-06-03 20:44:50,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75532427] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:44:50,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:44:50,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:44:50,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600213977] [2024-06-03 20:44:50,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:44:50,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:44:50,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:44:50,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:44:50,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:44:50,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:44:50,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 329 transitions, 4102 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:50,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:44:50,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:44:50,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:44:51,163 INFO L124 PetriNetUnfolderBase]: 944/1679 cut-off events. [2024-06-03 20:44:51,163 INFO L125 PetriNetUnfolderBase]: For 114043/114043 co-relation queries the response was YES. [2024-06-03 20:44:51,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11796 conditions, 1679 events. 944/1679 cut-off events. For 114043/114043 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 9404 event pairs, 202 based on Foata normal form. 2/1681 useless extension candidates. Maximal degree in co-relation 11624. Up to 1525 conditions per place. [2024-06-03 20:44:51,183 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 301 selfloop transitions, 48 changer transitions 0/351 dead transitions. [2024-06-03 20:44:51,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 351 transitions, 4907 flow [2024-06-03 20:44:51,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 20:44:51,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 20:44:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 127 transitions. [2024-06-03 20:44:51,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3207070707070707 [2024-06-03 20:44:51,185 INFO L175 Difference]: Start difference. First operand has 364 places, 329 transitions, 4102 flow. Second operand 12 states and 127 transitions. [2024-06-03 20:44:51,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 351 transitions, 4907 flow [2024-06-03 20:44:51,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 351 transitions, 4816 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-03 20:44:51,672 INFO L231 Difference]: Finished difference. Result has 372 places, 330 transitions, 4144 flow [2024-06-03 20:44:51,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4017, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4144, PETRI_PLACES=372, PETRI_TRANSITIONS=330} [2024-06-03 20:44:51,673 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 340 predicate places. [2024-06-03 20:44:51,673 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 330 transitions, 4144 flow [2024-06-03 20:44:51,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:51,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:44:51,673 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 20:44:51,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-03 20:44:51,674 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 20:44:51,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:44:51,674 INFO L85 PathProgramCache]: Analyzing trace with hash -702364809, now seen corresponding path program 3 times [2024-06-03 20:44:51,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:44:51,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675039786] [2024-06-03 20:44:51,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:44:51,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:44:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:44:56,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 20:44:56,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:44:56,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675039786] [2024-06-03 20:44:56,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675039786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:44:56,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:44:56,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:44:56,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857247322] [2024-06-03 20:44:56,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:44:56,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:44:56,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:44:56,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:44:56,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:44:56,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:44:56,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 330 transitions, 4144 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:56,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:44:56,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:44:56,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:44:57,008 INFO L124 PetriNetUnfolderBase]: 948/1687 cut-off events. [2024-06-03 20:44:57,008 INFO L125 PetriNetUnfolderBase]: For 118105/118105 co-relation queries the response was YES. [2024-06-03 20:44:57,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11841 conditions, 1687 events. 948/1687 cut-off events. For 118105/118105 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 9488 event pairs, 206 based on Foata normal form. 2/1689 useless extension candidates. Maximal degree in co-relation 11669. Up to 1536 conditions per place. [2024-06-03 20:44:57,030 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 305 selfloop transitions, 45 changer transitions 0/352 dead transitions. [2024-06-03 20:44:57,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 352 transitions, 4939 flow [2024-06-03 20:44:57,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 20:44:57,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 20:44:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2024-06-03 20:44:57,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2024-06-03 20:44:57,031 INFO L175 Difference]: Start difference. First operand has 372 places, 330 transitions, 4144 flow. Second operand 12 states and 126 transitions. [2024-06-03 20:44:57,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 352 transitions, 4939 flow [2024-06-03 20:44:57,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 352 transitions, 4794 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-06-03 20:44:57,552 INFO L231 Difference]: Finished difference. Result has 373 places, 331 transitions, 4121 flow [2024-06-03 20:44:57,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3999, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4121, PETRI_PLACES=373, PETRI_TRANSITIONS=331} [2024-06-03 20:44:57,553 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 341 predicate places. [2024-06-03 20:44:57,553 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 331 transitions, 4121 flow [2024-06-03 20:44:57,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:44:57,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:44:57,553 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 20:44:57,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-03 20:44:57,554 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 20:44:57,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:44:57,554 INFO L85 PathProgramCache]: Analyzing trace with hash -706775799, now seen corresponding path program 4 times [2024-06-03 20:44:57,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:44:57,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602093617] [2024-06-03 20:44:57,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:44:57,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:44:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:45:02,597 INFO 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 20:45:02,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:45:02,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602093617] [2024-06-03 20:45:02,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602093617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:45:02,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:45:02,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:45:02,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653757870] [2024-06-03 20:45:02,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:45:02,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:45:02,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:45:02,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:45:02,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:45:02,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:45:02,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 331 transitions, 4121 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:45:02,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:45:02,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:45:02,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:45:03,367 INFO L124 PetriNetUnfolderBase]: 952/1695 cut-off events. [2024-06-03 20:45:03,367 INFO L125 PetriNetUnfolderBase]: For 120452/120452 co-relation queries the response was YES. [2024-06-03 20:45:03,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11862 conditions, 1695 events. 952/1695 cut-off events. For 120452/120452 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 9514 event pairs, 209 based on Foata normal form. 2/1697 useless extension candidates. Maximal degree in co-relation 11689. Up to 1539 conditions per place. [2024-06-03 20:45:03,387 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 308 selfloop transitions, 43 changer transitions 0/353 dead transitions. [2024-06-03 20:45:03,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 353 transitions, 4912 flow [2024-06-03 20:45:03,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 20:45:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 20:45:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 125 transitions. [2024-06-03 20:45:03,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31565656565656564 [2024-06-03 20:45:03,388 INFO L175 Difference]: Start difference. First operand has 373 places, 331 transitions, 4121 flow. Second operand 12 states and 125 transitions. [2024-06-03 20:45:03,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 353 transitions, 4912 flow [2024-06-03 20:45:03,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 353 transitions, 4800 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-06-03 20:45:03,964 INFO L231 Difference]: Finished difference. Result has 375 places, 332 transitions, 4129 flow [2024-06-03 20:45:03,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4009, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4129, PETRI_PLACES=375, PETRI_TRANSITIONS=332} [2024-06-03 20:45:03,964 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 343 predicate places. [2024-06-03 20:45:03,965 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 332 transitions, 4129 flow [2024-06-03 20:45:03,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:45:03,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:45:03,965 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 20:45:03,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-03 20:45:03,965 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 20:45:03,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:45:03,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1142134637, now seen corresponding path program 5 times [2024-06-03 20:45:03,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:45:03,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222177152] [2024-06-03 20:45:03,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:45:03,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:45:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:45:08,322 INFO 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 20:45:08,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:45:08,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222177152] [2024-06-03 20:45:08,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222177152] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:45:08,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:45:08,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:45:08,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594037077] [2024-06-03 20:45:08,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:45:08,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:45:08,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:45:08,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:45:08,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:45:08,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:45:08,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 332 transitions, 4129 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:45:08,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:45:08,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:45:08,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:45:09,136 INFO L124 PetriNetUnfolderBase]: 969/1730 cut-off events. [2024-06-03 20:45:09,136 INFO L125 PetriNetUnfolderBase]: For 122974/122974 co-relation queries the response was YES. [2024-06-03 20:45:09,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12011 conditions, 1730 events. 969/1730 cut-off events. For 122974/122974 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 9798 event pairs, 174 based on Foata normal form. 2/1732 useless extension candidates. Maximal degree in co-relation 11837. Up to 1482 conditions per place. [2024-06-03 20:45:09,158 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 306 selfloop transitions, 50 changer transitions 0/358 dead transitions. [2024-06-03 20:45:09,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 358 transitions, 4953 flow [2024-06-03 20:45:09,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 20:45:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 20:45:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2024-06-03 20:45:09,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3106060606060606 [2024-06-03 20:45:09,159 INFO L175 Difference]: Start difference. First operand has 375 places, 332 transitions, 4129 flow. Second operand 12 states and 123 transitions. [2024-06-03 20:45:09,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 358 transitions, 4953 flow [2024-06-03 20:45:09,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 358 transitions, 4843 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-03 20:45:09,807 INFO L231 Difference]: Finished difference. Result has 379 places, 336 transitions, 4185 flow [2024-06-03 20:45:09,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4019, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4185, PETRI_PLACES=379, PETRI_TRANSITIONS=336} [2024-06-03 20:45:09,807 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 347 predicate places. [2024-06-03 20:45:09,807 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 336 transitions, 4185 flow [2024-06-03 20:45:09,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:45:09,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:45:09,807 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 20:45:09,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-03 20:45:09,808 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 20:45:09,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:45:09,808 INFO L85 PathProgramCache]: Analyzing trace with hash 925522797, now seen corresponding path program 6 times [2024-06-03 20:45:09,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:45:09,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240395588] [2024-06-03 20:45:09,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:45:09,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:45:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:45:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:45:14,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:45:14,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240395588] [2024-06-03 20:45:14,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240395588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:45:14,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:45:14,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:45:14,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698983536] [2024-06-03 20:45:14,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:45:14,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:45:14,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:45:14,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:45:14,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:45:14,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:45:14,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 336 transitions, 4185 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:45:14,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:45:14,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:45:14,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:45:15,353 INFO L124 PetriNetUnfolderBase]: 986/1765 cut-off events. [2024-06-03 20:45:15,353 INFO L125 PetriNetUnfolderBase]: For 125817/125817 co-relation queries the response was YES. [2024-06-03 20:45:15,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12220 conditions, 1765 events. 986/1765 cut-off events. For 125817/125817 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 10110 event pairs, 204 based on Foata normal form. 2/1767 useless extension candidates. Maximal degree in co-relation 12043. Up to 1569 conditions per place. [2024-06-03 20:45:15,371 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 314 selfloop transitions, 48 changer transitions 0/364 dead transitions. [2024-06-03 20:45:15,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 364 transitions, 5038 flow [2024-06-03 20:45:15,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-03 20:45:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-03 20:45:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2024-06-03 20:45:15,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3146853146853147 [2024-06-03 20:45:15,372 INFO L175 Difference]: Start difference. First operand has 379 places, 336 transitions, 4185 flow. Second operand 13 states and 135 transitions. [2024-06-03 20:45:15,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 364 transitions, 5038 flow [2024-06-03 20:45:15,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 364 transitions, 4919 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-03 20:45:15,933 INFO L231 Difference]: Finished difference. Result has 388 places, 340 transitions, 4253 flow [2024-06-03 20:45:15,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4067, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4253, PETRI_PLACES=388, PETRI_TRANSITIONS=340} [2024-06-03 20:45:15,933 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 356 predicate places. [2024-06-03 20:45:15,933 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 340 transitions, 4253 flow [2024-06-03 20:45:15,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:45:15,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:45:15,934 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 20:45:15,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-03 20:45:15,934 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 20:45:15,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:45:15,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2002353617, now seen corresponding path program 1 times [2024-06-03 20:45:15,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:45:15,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799496788] [2024-06-03 20:45:15,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:45:15,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:45:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:45:22,003 INFO 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 20:45:22,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:45:22,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799496788] [2024-06-03 20:45:22,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799496788] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:45:22,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:45:22,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:45:22,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002275998] [2024-06-03 20:45:22,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:45:22,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:45:22,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:45:22,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:45:22,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:45:22,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-03 20:45:22,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 340 transitions, 4253 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 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 20:45:22,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:45:22,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-03 20:45:22,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:45:23,102 INFO L124 PetriNetUnfolderBase]: 992/1775 cut-off events. [2024-06-03 20:45:23,102 INFO L125 PetriNetUnfolderBase]: For 127134/127134 co-relation queries the response was YES. [2024-06-03 20:45:23,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12338 conditions, 1775 events. 992/1775 cut-off events. For 127134/127134 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 10183 event pairs, 229 based on Foata normal form. 2/1777 useless extension candidates. Maximal degree in co-relation 12158. Up to 1572 conditions per place. [2024-06-03 20:45:23,124 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 303 selfloop transitions, 56 changer transitions 0/361 dead transitions. [2024-06-03 20:45:23,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 361 transitions, 5109 flow [2024-06-03 20:45:23,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:45:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:45:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-03 20:45:23,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35537190082644626 [2024-06-03 20:45:23,126 INFO L175 Difference]: Start difference. First operand has 388 places, 340 transitions, 4253 flow. Second operand 11 states and 129 transitions. [2024-06-03 20:45:23,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 361 transitions, 5109 flow [2024-06-03 20:45:23,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 361 transitions, 4988 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-03 20:45:23,696 INFO L231 Difference]: Finished difference. Result has 391 places, 342 transitions, 4309 flow [2024-06-03 20:45:23,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4132, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4309, PETRI_PLACES=391, PETRI_TRANSITIONS=342} [2024-06-03 20:45:23,697 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 359 predicate places. [2024-06-03 20:45:23,697 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 342 transitions, 4309 flow [2024-06-03 20:45:23,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 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 20:45:23,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:45:23,697 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 20:45:23,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-03 20:45:23,698 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 20:45:23,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:45:23,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1859177079, now seen corresponding path program 1 times [2024-06-03 20:45:23,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:45:23,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836125687] [2024-06-03 20:45:23,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:45:23,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:45:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:45:29,599 INFO 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 20:45:29,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:45:29,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836125687] [2024-06-03 20:45:29,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836125687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:45:29,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:45:29,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:45:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59339732] [2024-06-03 20:45:29,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:45:29,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:45:29,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:45:29,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:45:29,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:45:29,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:45:29,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 342 transitions, 4309 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:45:29,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:45:29,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:45:29,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:45:30,616 INFO L124 PetriNetUnfolderBase]: 995/1780 cut-off events. [2024-06-03 20:45:30,617 INFO L125 PetriNetUnfolderBase]: For 122952/122952 co-relation queries the response was YES. [2024-06-03 20:45:30,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12382 conditions, 1780 events. 995/1780 cut-off events. For 122952/122952 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 10227 event pairs, 226 based on Foata normal form. 1/1781 useless extension candidates. Maximal degree in co-relation 12201. Up to 1581 conditions per place. [2024-06-03 20:45:30,639 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 301 selfloop transitions, 62 changer transitions 0/365 dead transitions. [2024-06-03 20:45:30,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 365 transitions, 5182 flow [2024-06-03 20:45:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 20:45:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 20:45:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-03 20:45:30,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32323232323232326 [2024-06-03 20:45:30,640 INFO L175 Difference]: Start difference. First operand has 391 places, 342 transitions, 4309 flow. Second operand 12 states and 128 transitions. [2024-06-03 20:45:30,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 365 transitions, 5182 flow [2024-06-03 20:45:31,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 365 transitions, 5029 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-03 20:45:31,238 INFO L231 Difference]: Finished difference. Result has 394 places, 344 transitions, 4360 flow [2024-06-03 20:45:31,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4156, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4360, PETRI_PLACES=394, PETRI_TRANSITIONS=344} [2024-06-03 20:45:31,238 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 362 predicate places. [2024-06-03 20:45:31,238 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 344 transitions, 4360 flow [2024-06-03 20:45:31,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:45:31,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:45:31,239 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 20:45:31,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-06-03 20:45:31,239 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 20:45:31,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:45:31,239 INFO L85 PathProgramCache]: Analyzing trace with hash 177348825, now seen corresponding path program 7 times [2024-06-03 20:45:31,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:45:31,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757584259] [2024-06-03 20:45:31,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:45:31,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:45:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:45:36,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 20:45:36,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:45:36,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757584259] [2024-06-03 20:45:36,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757584259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:45:36,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:45:36,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:45:36,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533287595] [2024-06-03 20:45:36,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:45:36,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:45:36,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:45:36,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:45:36,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:45:36,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:45:36,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 344 transitions, 4360 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:45:36,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:45:36,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:45:36,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:45:37,080 INFO L124 PetriNetUnfolderBase]: 1003/1796 cut-off events. [2024-06-03 20:45:37,080 INFO L125 PetriNetUnfolderBase]: For 129675/129675 co-relation queries the response was YES. [2024-06-03 20:45:37,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12505 conditions, 1796 events. 1003/1796 cut-off events. For 129675/129675 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 10364 event pairs, 184 based on Foata normal form. 2/1798 useless extension candidates. Maximal degree in co-relation 12323. Up to 1653 conditions per place. [2024-06-03 20:45:37,102 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 333 selfloop transitions, 34 changer transitions 0/369 dead transitions. [2024-06-03 20:45:37,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 369 transitions, 5208 flow [2024-06-03 20:45:37,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 20:45:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 20:45:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-03 20:45:37,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32323232323232326 [2024-06-03 20:45:37,103 INFO L175 Difference]: Start difference. First operand has 394 places, 344 transitions, 4360 flow. Second operand 12 states and 128 transitions. [2024-06-03 20:45:37,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 369 transitions, 5208 flow [2024-06-03 20:45:37,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 369 transitions, 5058 flow, removed 19 selfloop flow, removed 10 redundant places. [2024-06-03 20:45:37,750 INFO L231 Difference]: Finished difference. Result has 397 places, 346 transitions, 4327 flow [2024-06-03 20:45:37,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4210, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4327, PETRI_PLACES=397, PETRI_TRANSITIONS=346} [2024-06-03 20:45:37,751 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 365 predicate places. [2024-06-03 20:45:37,751 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 346 transitions, 4327 flow [2024-06-03 20:45:37,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:45:37,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:45:37,751 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 20:45:37,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-06-03 20:45:37,751 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 20:45:37,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:45:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1482782461, now seen corresponding path program 8 times [2024-06-03 20:45:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:45:37,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053117519] [2024-06-03 20:45:37,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:45:37,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:45:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:45:42,521 INFO 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 20:45:42,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:45:42,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053117519] [2024-06-03 20:45:42,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053117519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:45:42,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:45:42,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:45:42,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089887163] [2024-06-03 20:45:42,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:45:42,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:45:42,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:45:42,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:45:42,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:45:42,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:45:42,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 346 transitions, 4327 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:45:42,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:45:42,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:45:42,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:45:43,382 INFO L124 PetriNetUnfolderBase]: 1007/1804 cut-off events. [2024-06-03 20:45:43,382 INFO L125 PetriNetUnfolderBase]: For 133167/133167 co-relation queries the response was YES. [2024-06-03 20:45:43,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12532 conditions, 1804 events. 1007/1804 cut-off events. For 133167/133167 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 10394 event pairs, 194 based on Foata normal form. 2/1806 useless extension candidates. Maximal degree in co-relation 12348. Up to 1671 conditions per place. [2024-06-03 20:45:43,405 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 327 selfloop transitions, 38 changer transitions 0/367 dead transitions. [2024-06-03 20:45:43,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 367 transitions, 5174 flow [2024-06-03 20:45:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:45:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:45:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-03 20:45:43,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3305785123966942 [2024-06-03 20:45:43,406 INFO L175 Difference]: Start difference. First operand has 397 places, 346 transitions, 4327 flow. Second operand 11 states and 120 transitions. [2024-06-03 20:45:43,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 367 transitions, 5174 flow [2024-06-03 20:45:44,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 367 transitions, 5076 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-03 20:45:44,076 INFO L231 Difference]: Finished difference. Result has 399 places, 347 transitions, 4346 flow [2024-06-03 20:45:44,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4229, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4346, PETRI_PLACES=399, PETRI_TRANSITIONS=347} [2024-06-03 20:45:44,077 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 367 predicate places. [2024-06-03 20:45:44,077 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 347 transitions, 4346 flow [2024-06-03 20:45:44,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:45:44,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:45:44,077 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 20:45:44,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2024-06-03 20:45:44,077 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 20:45:44,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:45:44,078 INFO L85 PathProgramCache]: Analyzing trace with hash 235556595, now seen corresponding path program 9 times [2024-06-03 20:45:44,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:45:44,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20270774] [2024-06-03 20:45:44,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:45:44,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:45:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:45:49,102 INFO 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 20:45:49,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:45:49,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20270774] [2024-06-03 20:45:49,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20270774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:45:49,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:45:49,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:45:49,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130929703] [2024-06-03 20:45:49,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:45:49,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:45:49,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:45:49,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:45:49,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:45:49,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:45:49,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 347 transitions, 4346 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:45:49,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:45:49,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:45:49,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:45:49,907 INFO L124 PetriNetUnfolderBase]: 1021/1830 cut-off events. [2024-06-03 20:45:49,907 INFO L125 PetriNetUnfolderBase]: For 135923/135923 co-relation queries the response was YES. [2024-06-03 20:45:49,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12689 conditions, 1830 events. 1021/1830 cut-off events. For 135923/135923 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 10601 event pairs, 178 based on Foata normal form. 2/1832 useless extension candidates. Maximal degree in co-relation 12504. Up to 1598 conditions per place. [2024-06-03 20:45:49,928 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 301 selfloop transitions, 69 changer transitions 0/372 dead transitions. [2024-06-03 20:45:49,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 372 transitions, 5253 flow [2024-06-03 20:45:49,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:45:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:45:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-03 20:45:49,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3415977961432507 [2024-06-03 20:45:49,930 INFO L175 Difference]: Start difference. First operand has 399 places, 347 transitions, 4346 flow. Second operand 11 states and 124 transitions. [2024-06-03 20:45:49,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 372 transitions, 5253 flow [2024-06-03 20:45:50,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 372 transitions, 5148 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-03 20:45:50,683 INFO L231 Difference]: Finished difference. Result has 404 places, 353 transitions, 4541 flow [2024-06-03 20:45:50,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4241, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4541, PETRI_PLACES=404, PETRI_TRANSITIONS=353} [2024-06-03 20:45:50,683 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 372 predicate places. [2024-06-03 20:45:50,683 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 353 transitions, 4541 flow [2024-06-03 20:45:50,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:45:50,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:45:50,683 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 20:45:50,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-06-03 20:45:50,684 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 20:45:50,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:45:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash 183729545, now seen corresponding path program 10 times [2024-06-03 20:45:50,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:45:50,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557406874] [2024-06-03 20:45:50,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:45:50,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:45:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:45:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:45:55,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:45:55,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557406874] [2024-06-03 20:45:55,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557406874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:45:55,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:45:55,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:45:55,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192429491] [2024-06-03 20:45:55,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:45:55,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:45:55,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:45:55,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:45:55,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:45:55,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:45:55,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 353 transitions, 4541 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:45:55,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:45:55,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:45:55,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:45:56,304 INFO L124 PetriNetUnfolderBase]: 1033/1854 cut-off events. [2024-06-03 20:45:56,304 INFO L125 PetriNetUnfolderBase]: For 139003/139003 co-relation queries the response was YES. [2024-06-03 20:45:56,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12971 conditions, 1854 events. 1033/1854 cut-off events. For 139003/139003 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 10799 event pairs, 194 based on Foata normal form. 2/1856 useless extension candidates. Maximal degree in co-relation 12782. Up to 1642 conditions per place. [2024-06-03 20:45:56,323 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 317 selfloop transitions, 55 changer transitions 0/374 dead transitions. [2024-06-03 20:45:56,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 374 transitions, 5395 flow [2024-06-03 20:45:56,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:45:56,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:45:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-03 20:45:56,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 20:45:56,324 INFO L175 Difference]: Start difference. First operand has 404 places, 353 transitions, 4541 flow. Second operand 11 states and 121 transitions. [2024-06-03 20:45:56,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 374 transitions, 5395 flow [2024-06-03 20:45:56,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 374 transitions, 5268 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-03 20:45:56,976 INFO L231 Difference]: Finished difference. Result has 411 places, 356 transitions, 4606 flow [2024-06-03 20:45:56,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4416, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4606, PETRI_PLACES=411, PETRI_TRANSITIONS=356} [2024-06-03 20:45:56,976 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 379 predicate places. [2024-06-03 20:45:56,976 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 356 transitions, 4606 flow [2024-06-03 20:45:56,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:45:56,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:45:56,977 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 20:45:56,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2024-06-03 20:45:56,977 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 20:45:56,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:45:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash 194771693, now seen corresponding path program 2 times [2024-06-03 20:45:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:45:56,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049716896] [2024-06-03 20:45:56,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:45:56,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:45:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:46:03,382 INFO 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 20:46:03,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:46:03,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049716896] [2024-06-03 20:46:03,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049716896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:46:03,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:46:03,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:46:03,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989638775] [2024-06-03 20:46:03,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:46:03,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:46:03,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:46:03,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:46:03,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:46:03,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:46:03,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 356 transitions, 4606 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:46:03,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:46:03,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:46:03,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:46:04,366 INFO L124 PetriNetUnfolderBase]: 1031/1851 cut-off events. [2024-06-03 20:46:04,367 INFO L125 PetriNetUnfolderBase]: For 127510/127510 co-relation queries the response was YES. [2024-06-03 20:46:04,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12831 conditions, 1851 events. 1031/1851 cut-off events. For 127510/127510 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 10794 event pairs, 198 based on Foata normal form. 1/1852 useless extension candidates. Maximal degree in co-relation 12639. Up to 1715 conditions per place. [2024-06-03 20:46:04,390 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 333 selfloop transitions, 41 changer transitions 0/376 dead transitions. [2024-06-03 20:46:04,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 376 transitions, 5445 flow [2024-06-03 20:46:04,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:46:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:46:04,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-03 20:46:04,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 20:46:04,391 INFO L175 Difference]: Start difference. First operand has 411 places, 356 transitions, 4606 flow. Second operand 11 states and 121 transitions. [2024-06-03 20:46:04,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 376 transitions, 5445 flow [2024-06-03 20:46:05,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 376 transitions, 5287 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-06-03 20:46:05,032 INFO L231 Difference]: Finished difference. Result has 415 places, 356 transitions, 4538 flow [2024-06-03 20:46:05,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4448, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4538, PETRI_PLACES=415, PETRI_TRANSITIONS=356} [2024-06-03 20:46:05,032 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 383 predicate places. [2024-06-03 20:46:05,032 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 356 transitions, 4538 flow [2024-06-03 20:46:05,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:46:05,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:46:05,033 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 20:46:05,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2024-06-03 20:46:05,033 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 20:46:05,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:46:05,033 INFO L85 PathProgramCache]: Analyzing trace with hash 851505425, now seen corresponding path program 11 times [2024-06-03 20:46:05,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:46:05,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232566024] [2024-06-03 20:46:05,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:46:05,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:46:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:46:09,982 INFO 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 20:46:09,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:46:09,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232566024] [2024-06-03 20:46:09,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232566024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:46:09,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:46:09,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:46:09,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839491850] [2024-06-03 20:46:09,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:46:09,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:46:09,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:46:09,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:46:09,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:46:10,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:46:10,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 356 transitions, 4538 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:46:10,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:46:10,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:46:10,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:46:10,977 INFO L124 PetriNetUnfolderBase]: 1035/1859 cut-off events. [2024-06-03 20:46:10,978 INFO L125 PetriNetUnfolderBase]: For 132755/132755 co-relation queries the response was YES. [2024-06-03 20:46:11,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12816 conditions, 1859 events. 1035/1859 cut-off events. For 132755/132755 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 10855 event pairs, 175 based on Foata normal form. 2/1861 useless extension candidates. Maximal degree in co-relation 12623. Up to 1619 conditions per place. [2024-06-03 20:46:11,005 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 307 selfloop transitions, 69 changer transitions 0/378 dead transitions. [2024-06-03 20:46:11,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 378 transitions, 5426 flow [2024-06-03 20:46:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:46:11,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:46:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-03 20:46:11,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3443526170798898 [2024-06-03 20:46:11,007 INFO L175 Difference]: Start difference. First operand has 415 places, 356 transitions, 4538 flow. Second operand 11 states and 125 transitions. [2024-06-03 20:46:11,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 378 transitions, 5426 flow [2024-06-03 20:46:11,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 378 transitions, 5336 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-03 20:46:11,745 INFO L231 Difference]: Finished difference. Result has 417 places, 357 transitions, 4628 flow [2024-06-03 20:46:11,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4448, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4628, PETRI_PLACES=417, PETRI_TRANSITIONS=357} [2024-06-03 20:46:11,745 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 385 predicate places. [2024-06-03 20:46:11,745 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 357 transitions, 4628 flow [2024-06-03 20:46:11,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:46:11,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:46:11,746 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 20:46:11,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2024-06-03 20:46:11,746 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 20:46:11,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:46:11,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2075597487, now seen corresponding path program 12 times [2024-06-03 20:46:11,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:46:11,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610810174] [2024-06-03 20:46:11,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:46:11,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:46:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:46:15,840 INFO 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 20:46:15,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:46:15,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610810174] [2024-06-03 20:46:15,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610810174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:46:15,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:46:15,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:46:15,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181463866] [2024-06-03 20:46:15,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:46:15,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:46:15,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:46:15,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:46:15,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:46:16,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:46:16,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 357 transitions, 4628 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:46:16,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:46:16,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:46:16,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:46:16,703 INFO L124 PetriNetUnfolderBase]: 1039/1867 cut-off events. [2024-06-03 20:46:16,703 INFO L125 PetriNetUnfolderBase]: For 136185/136185 co-relation queries the response was YES. [2024-06-03 20:46:16,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12996 conditions, 1867 events. 1039/1867 cut-off events. For 136185/136185 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 10942 event pairs, 173 based on Foata normal form. 2/1869 useless extension candidates. Maximal degree in co-relation 12802. Up to 1627 conditions per place. [2024-06-03 20:46:16,727 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 309 selfloop transitions, 68 changer transitions 0/379 dead transitions. [2024-06-03 20:46:16,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 379 transitions, 5512 flow [2024-06-03 20:46:16,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:46:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:46:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-03 20:46:16,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3415977961432507 [2024-06-03 20:46:16,729 INFO L175 Difference]: Start difference. First operand has 417 places, 357 transitions, 4628 flow. Second operand 11 states and 124 transitions. [2024-06-03 20:46:16,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 379 transitions, 5512 flow [2024-06-03 20:46:17,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 379 transitions, 5332 flow, removed 19 selfloop flow, removed 11 redundant places. [2024-06-03 20:46:17,481 INFO L231 Difference]: Finished difference. Result has 417 places, 358 transitions, 4628 flow [2024-06-03 20:46:17,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4448, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4628, PETRI_PLACES=417, PETRI_TRANSITIONS=358} [2024-06-03 20:46:17,482 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 385 predicate places. [2024-06-03 20:46:17,482 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 358 transitions, 4628 flow [2024-06-03 20:46:17,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:46:17,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:46:17,491 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 20:46:17,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2024-06-03 20:46:17,491 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 20:46:17,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:46:17,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2068917483, now seen corresponding path program 1 times [2024-06-03 20:46:17,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:46:17,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466883439] [2024-06-03 20:46:17,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:46:17,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:46:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:46:23,568 INFO 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 20:46:23,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:46:23,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466883439] [2024-06-03 20:46:23,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466883439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:46:23,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:46:23,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:46:23,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122140255] [2024-06-03 20:46:23,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:46:23,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:46:23,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:46:23,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:46:23,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:46:23,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:46:23,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 358 transitions, 4628 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:46:23,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:46:23,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:46:23,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:46:24,556 INFO L124 PetriNetUnfolderBase]: 1046/1880 cut-off events. [2024-06-03 20:46:24,557 INFO L125 PetriNetUnfolderBase]: For 133892/133892 co-relation queries the response was YES. [2024-06-03 20:46:24,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13000 conditions, 1880 events. 1046/1880 cut-off events. For 133892/133892 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 11061 event pairs, 277 based on Foata normal form. 2/1882 useless extension candidates. Maximal degree in co-relation 12807. Up to 1743 conditions per place. [2024-06-03 20:46:24,585 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 334 selfloop transitions, 45 changer transitions 0/381 dead transitions. [2024-06-03 20:46:24,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 381 transitions, 5498 flow [2024-06-03 20:46:24,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 20:46:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 20:46:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 127 transitions. [2024-06-03 20:46:24,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3207070707070707 [2024-06-03 20:46:24,586 INFO L175 Difference]: Start difference. First operand has 417 places, 358 transitions, 4628 flow. Second operand 12 states and 127 transitions. [2024-06-03 20:46:24,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 381 transitions, 5498 flow [2024-06-03 20:46:25,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 381 transitions, 5328 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-03 20:46:25,338 INFO L231 Difference]: Finished difference. Result has 421 places, 361 transitions, 4612 flow [2024-06-03 20:46:25,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4458, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4612, PETRI_PLACES=421, PETRI_TRANSITIONS=361} [2024-06-03 20:46:25,339 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 389 predicate places. [2024-06-03 20:46:25,339 INFO L495 AbstractCegarLoop]: Abstraction has has 421 places, 361 transitions, 4612 flow [2024-06-03 20:46:25,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:46:25,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:46:25,339 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 20:46:25,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2024-06-03 20:46:25,340 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 20:46:25,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:46:25,340 INFO L85 PathProgramCache]: Analyzing trace with hash 857934515, now seen corresponding path program 13 times [2024-06-03 20:46:25,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:46:25,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099059622] [2024-06-03 20:46:25,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:46:25,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:46:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:46:30,219 INFO 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 20:46:30,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:46:30,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099059622] [2024-06-03 20:46:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099059622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:46:30,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:46:30,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:46:30,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043721648] [2024-06-03 20:46:30,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:46:30,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:46:30,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:46:30,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:46:30,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:46:30,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:46:30,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 361 transitions, 4612 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:46:30,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:46:30,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:46:30,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:46:31,153 INFO L124 PetriNetUnfolderBase]: 1050/1888 cut-off events. [2024-06-03 20:46:31,153 INFO L125 PetriNetUnfolderBase]: For 136125/136125 co-relation queries the response was YES. [2024-06-03 20:46:31,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13012 conditions, 1888 events. 1050/1888 cut-off events. For 136125/136125 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 11077 event pairs, 173 based on Foata normal form. 2/1890 useless extension candidates. Maximal degree in co-relation 12817. Up to 1599 conditions per place. [2024-06-03 20:46:31,174 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 299 selfloop transitions, 83 changer transitions 0/384 dead transitions. [2024-06-03 20:46:31,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 384 transitions, 5522 flow [2024-06-03 20:46:31,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:46:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:46:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-03 20:46:31,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.349862258953168 [2024-06-03 20:46:31,175 INFO L175 Difference]: Start difference. First operand has 421 places, 361 transitions, 4612 flow. Second operand 11 states and 127 transitions. [2024-06-03 20:46:31,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 384 transitions, 5522 flow [2024-06-03 20:46:31,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 384 transitions, 5418 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-03 20:46:31,860 INFO L231 Difference]: Finished difference. Result has 423 places, 362 transitions, 4720 flow [2024-06-03 20:46:31,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4508, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4720, PETRI_PLACES=423, PETRI_TRANSITIONS=362} [2024-06-03 20:46:31,860 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 391 predicate places. [2024-06-03 20:46:31,860 INFO L495 AbstractCegarLoop]: Abstraction has has 423 places, 362 transitions, 4720 flow [2024-06-03 20:46:31,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:46:31,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:46:31,861 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 20:46:31,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2024-06-03 20:46:31,861 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 20:46:31,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:46:31,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2075412913, now seen corresponding path program 2 times [2024-06-03 20:46:31,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:46:31,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313752476] [2024-06-03 20:46:31,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:46:31,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:46:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:46:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:46:37,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:46:37,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313752476] [2024-06-03 20:46:37,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313752476] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:46:37,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:46:37,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:46:37,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757928072] [2024-06-03 20:46:37,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:46:37,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:46:37,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:46:37,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:46:37,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:46:37,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:46:37,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 362 transitions, 4720 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:46:37,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:46:37,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:46:37,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:46:38,428 INFO L124 PetriNetUnfolderBase]: 1056/1898 cut-off events. [2024-06-03 20:46:38,428 INFO L125 PetriNetUnfolderBase]: For 138923/138923 co-relation queries the response was YES. [2024-06-03 20:46:38,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13205 conditions, 1898 events. 1056/1898 cut-off events. For 138923/138923 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 11153 event pairs, 175 based on Foata normal form. 2/1900 useless extension candidates. Maximal degree in co-relation 13009. Up to 1648 conditions per place. [2024-06-03 20:46:38,460 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 313 selfloop transitions, 72 changer transitions 0/387 dead transitions. [2024-06-03 20:46:38,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 387 transitions, 5668 flow [2024-06-03 20:46:38,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 20:46:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 20:46:38,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2024-06-03 20:46:38,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2024-06-03 20:46:38,462 INFO L175 Difference]: Start difference. First operand has 423 places, 362 transitions, 4720 flow. Second operand 12 states and 135 transitions. [2024-06-03 20:46:38,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 387 transitions, 5668 flow [2024-06-03 20:46:39,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 387 transitions, 5466 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-06-03 20:46:39,159 INFO L231 Difference]: Finished difference. Result has 426 places, 364 transitions, 4729 flow [2024-06-03 20:46:39,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4518, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4729, PETRI_PLACES=426, PETRI_TRANSITIONS=364} [2024-06-03 20:46:39,159 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 394 predicate places. [2024-06-03 20:46:39,159 INFO L495 AbstractCegarLoop]: Abstraction has has 426 places, 364 transitions, 4729 flow [2024-06-03 20:46:39,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:46:39,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:46:39,160 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 20:46:39,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2024-06-03 20:46:39,160 INFO L420 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 20:46:39,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:46:39,160 INFO L85 PathProgramCache]: Analyzing trace with hash 680802995, now seen corresponding path program 14 times [2024-06-03 20:46:39,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:46:39,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467492354] [2024-06-03 20:46:39,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:46:39,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:46:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:46:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:46:44,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:46:44,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467492354] [2024-06-03 20:46:44,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467492354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:46:44,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:46:44,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:46:44,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092302990] [2024-06-03 20:46:44,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:46:44,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:46:44,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:46:44,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:46:44,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:46:44,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:46:44,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 364 transitions, 4729 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:46:44,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:46:44,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:46:44,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:46:45,324 INFO L124 PetriNetUnfolderBase]: 1060/1906 cut-off events. [2024-06-03 20:46:45,325 INFO L125 PetriNetUnfolderBase]: For 141418/141418 co-relation queries the response was YES. [2024-06-03 20:46:45,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13234 conditions, 1906 events. 1060/1906 cut-off events. For 141418/141418 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 11209 event pairs, 193 based on Foata normal form. 2/1908 useless extension candidates. Maximal degree in co-relation 13037. Up to 1711 conditions per place. [2024-06-03 20:46:45,351 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 325 selfloop transitions, 57 changer transitions 0/384 dead transitions. [2024-06-03 20:46:45,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 384 transitions, 5619 flow [2024-06-03 20:46:45,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 20:46:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 20:46:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-03 20:46:45,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33884297520661155 [2024-06-03 20:46:45,352 INFO L175 Difference]: Start difference. First operand has 426 places, 364 transitions, 4729 flow. Second operand 11 states and 123 transitions. [2024-06-03 20:46:45,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 384 transitions, 5619 flow [2024-06-03 20:46:46,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 384 transitions, 5428 flow, removed 25 selfloop flow, removed 10 redundant places. [2024-06-03 20:46:46,160 INFO L231 Difference]: Finished difference. Result has 427 places, 365 transitions, 4700 flow [2024-06-03 20:46:46,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4538, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4700, PETRI_PLACES=427, PETRI_TRANSITIONS=365} [2024-06-03 20:46:46,161 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 395 predicate places. [2024-06-03 20:46:46,161 INFO L495 AbstractCegarLoop]: Abstraction has has 427 places, 365 transitions, 4700 flow [2024-06-03 20:46:46,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:46:46,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:46:46,161 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 20:46:46,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2024-06-03 20:46:46,162 INFO L420 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 20:46:46,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:46:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2068917793, now seen corresponding path program 3 times [2024-06-03 20:46:46,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:46:46,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809817243] [2024-06-03 20:46:46,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:46:46,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:46:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:46:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:46:54,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:46:54,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809817243] [2024-06-03 20:46:54,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809817243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:46:54,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:46:54,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 20:46:54,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798653092] [2024-06-03 20:46:54,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:46:54,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 20:46:54,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:46:54,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 20:46:54,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-03 20:46:54,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-03 20:46:54,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 365 transitions, 4700 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:46:54,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:46:54,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-03 20:46:54,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:46:55,631 INFO L124 PetriNetUnfolderBase]: 1082/1942 cut-off events. [2024-06-03 20:46:55,631 INFO L125 PetriNetUnfolderBase]: For 156471/156471 co-relation queries the response was YES. [2024-06-03 20:46:55,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13680 conditions, 1942 events. 1082/1942 cut-off events. For 156471/156471 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 11450 event pairs, 175 based on Foata normal form. 2/1944 useless extension candidates. Maximal degree in co-relation 13482. Up to 1532 conditions per place. [2024-06-03 20:46:55,656 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 286 selfloop transitions, 110 changer transitions 0/398 dead transitions. [2024-06-03 20:46:55,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 398 transitions, 5986 flow [2024-06-03 20:46:55,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 20:46:55,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 20:46:55,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions. [2024-06-03 20:46:55,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35858585858585856 [2024-06-03 20:46:55,657 INFO L175 Difference]: Start difference. First operand has 427 places, 365 transitions, 4700 flow. Second operand 12 states and 142 transitions. [2024-06-03 20:46:55,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 398 transitions, 5986 flow [2024-06-03 20:46:56,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 398 transitions, 5834 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-03 20:46:56,543 INFO L231 Difference]: Finished difference. Result has 431 places, 371 transitions, 4938 flow [2024-06-03 20:46:56,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4548, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4938, PETRI_PLACES=431, PETRI_TRANSITIONS=371} [2024-06-03 20:46:56,544 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 399 predicate places. [2024-06-03 20:46:56,544 INFO L495 AbstractCegarLoop]: Abstraction has has 431 places, 371 transitions, 4938 flow [2024-06-03 20:46:56,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:46:56,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:46:56,544 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 20:46:56,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2024-06-03 20:46:56,545 INFO L420 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 20:46:56,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:46:56,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2068926163, now seen corresponding path program 4 times [2024-06-03 20:46:56,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:46:56,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382555705] [2024-06-03 20:46:56,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:46:56,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:46:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15