./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix022_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/mix022_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix022_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-cde23df-m [2024-06-14 14:50:43,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 14:50:43,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 14:50:43,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 14:50:43,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 14:50:43,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 14:50:43,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 14:50:43,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 14:50:43,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 14:50:43,776 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 14:50:43,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 14:50:43,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 14:50:43,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 14:50:43,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 14:50:43,779 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 14:50:43,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 14:50:43,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 14:50:43,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 14:50:43,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 14:50:43,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 14:50:43,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 14:50:43,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 14:50:43,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 14:50:43,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 14:50:43,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 14:50:43,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 14:50:43,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 14:50:43,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 14:50:43,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 14:50:43,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 14:50:43,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 14:50:43,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 14:50:43,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:50:43,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 14:50:43,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 14:50:43,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 14:50:43,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 14:50:43,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 14:50:43,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 14:50:43,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 14:50:43,785 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 14:50:43,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 14:50:43,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 14:50:43,785 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 14:50:43,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 14:50:44,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 14:50:44,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 14:50:44,015 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 14:50:44,015 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 14:50:44,016 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/mix022_tso.yml/witness.yml [2024-06-14 14:50:44,204 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 14:50:44,204 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 14:50:44,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.i [2024-06-14 14:50:45,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 14:50:45,373 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 14:50:45,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.i [2024-06-14 14:50:45,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf02c600/8a0be306a39b4269b6cb653c25669346/FLAG81e1ec937 [2024-06-14 14:50:45,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf02c600/8a0be306a39b4269b6cb653c25669346 [2024-06-14 14:50:45,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 14:50:45,404 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 14:50:45,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 14:50:45,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 14:50:45,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 14:50:45,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:50:44" (1/2) ... [2024-06-14 14:50:45,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5edf6475 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:50:45, skipping insertion in model container [2024-06-14 14:50:45,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:50:44" (1/2) ... [2024-06-14 14:50:45,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2168661f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:50:45, skipping insertion in model container [2024-06-14 14:50:45,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:50:45" (2/2) ... [2024-06-14 14:50:45,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5edf6475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:45, skipping insertion in model container [2024-06-14 14:50:45,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:50:45" (2/2) ... [2024-06-14 14:50:45,412 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 14:50:45,472 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 14:50:45,473 INFO L97 edCorrectnessWitness]: Location invariant before [L813-L813] (((((((((((((((! multithreaded || x$r_buff1_thd0 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (1LL + (long long )x) - (long long )y >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p1_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 14:50:45,473 INFO L97 edCorrectnessWitness]: Location invariant before [L814-L814] (((((((((((((((! multithreaded || x$r_buff1_thd0 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (1LL + (long long )x) - (long long )y >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p1_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 14:50:45,474 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 14:50:45,474 INFO L106 edCorrectnessWitness]: ghost_update [L811-L811] multithreaded = 1; [2024-06-14 14:50:45,511 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 14:50:45,859 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:50:45,870 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 14:50:46,074 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:50:46,119 INFO L206 MainTranslator]: Completed translation [2024-06-14 14:50:46,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:46 WrapperNode [2024-06-14 14:50:46,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 14:50:46,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 14:50:46,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 14:50:46,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 14:50:46,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:46" (1/1) ... [2024-06-14 14:50:46,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:46" (1/1) ... [2024-06-14 14:50:46,219 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154 [2024-06-14 14:50:46,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 14:50:46,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 14:50:46,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 14:50:46,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 14:50:46,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:46" (1/1) ... [2024-06-14 14:50:46,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:46" (1/1) ... [2024-06-14 14:50:46,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:46" (1/1) ... [2024-06-14 14:50:46,286 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 14:50:46,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:46" (1/1) ... [2024-06-14 14:50:46,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:46" (1/1) ... [2024-06-14 14:50:46,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:46" (1/1) ... [2024-06-14 14:50:46,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:46" (1/1) ... [2024-06-14 14:50:46,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:46" (1/1) ... [2024-06-14 14:50:46,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:46" (1/1) ... [2024-06-14 14:50:46,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 14:50:46,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 14:50:46,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 14:50:46,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 14:50:46,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:46" (1/1) ... [2024-06-14 14:50:46,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:50:46,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:50:46,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 14:50:46,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 14:50:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 14:50:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 14:50:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 14:50:46,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 14:50:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 14:50:46,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 14:50:46,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 14:50:46,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 14:50:46,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 14:50:46,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 14:50:46,408 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 14:50:46,521 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 14:50:46,522 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 14:50:47,093 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 14:50:47,093 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 14:50:47,266 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 14:50:47,267 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 14:50:47,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:50:47 BoogieIcfgContainer [2024-06-14 14:50:47,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 14:50:47,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 14:50:47,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 14:50:47,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 14:50:47,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:50:44" (1/4) ... [2024-06-14 14:50:47,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da8e358 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:50:47, skipping insertion in model container [2024-06-14 14:50:47,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:50:45" (2/4) ... [2024-06-14 14:50:47,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da8e358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:50:47, skipping insertion in model container [2024-06-14 14:50:47,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:46" (3/4) ... [2024-06-14 14:50:47,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da8e358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:50:47, skipping insertion in model container [2024-06-14 14:50:47,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:50:47" (4/4) ... [2024-06-14 14:50:47,279 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_tso.i [2024-06-14 14:50:47,292 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 14:50:47,292 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 14:50:47,293 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 14:50:47,353 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 14:50:47,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-14 14:50:47,412 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-14 14:50:47,413 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:50:47,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 14:50:47,414 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-14 14:50:47,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-14 14:50:47,436 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:50:47,457 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;@456cf2f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:50:47,457 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:50:47,478 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:50:47,478 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 14:50:47,478 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:50:47,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:47,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 14:50:47,480 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:50:47,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1606705191, now seen corresponding path program 1 times [2024-06-14 14:50:47,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:47,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490823637] [2024-06-14 14:50:47,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:47,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:50:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:50:50,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:50:50,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490823637] [2024-06-14 14:50:50,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490823637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:50:50,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:50:50,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:50:50,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050862176] [2024-06-14 14:50:50,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:50:50,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:50:50,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:50:50,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:50:50,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:50:50,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-14 14:50:50,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:50,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:50,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-14 14:50:50,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:50,476 INFO L124 PetriNetUnfolderBase]: 162/309 cut-off events. [2024-06-14 14:50:50,477 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-14 14:50:50,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 309 events. 162/309 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1128 event pairs, 97 based on Foata normal form. 1/298 useless extension candidates. Maximal degree in co-relation 608. Up to 288 conditions per place. [2024-06-14 14:50:50,482 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 23 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-14 14:50:50,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 119 flow [2024-06-14 14:50:50,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:50:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:50:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-06-14 14:50:50,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5268817204301075 [2024-06-14 14:50:50,492 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 49 transitions. [2024-06-14 14:50:50,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 119 flow [2024-06-14 14:50:50,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 14:50:50,496 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-14 14:50:50,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-06-14 14:50:50,500 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-14 14:50:50,501 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-14 14:50:50,501 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-14 14:50:50,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:50,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:50:50,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 14:50:50,502 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:50:50,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:50,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2144571448, now seen corresponding path program 1 times [2024-06-14 14:50:50,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:50,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868677895] [2024-06-14 14:50:50,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:50,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:50:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:50:52,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:50:52,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868677895] [2024-06-14 14:50:52,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868677895] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:50:52,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:50:52,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 14:50:52,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803165604] [2024-06-14 14:50:52,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:50:52,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 14:50:52,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:50:52,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 14:50:52,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 14:50:52,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:50:52,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:52,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:52,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:50:52,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:52,485 INFO L124 PetriNetUnfolderBase]: 186/337 cut-off events. [2024-06-14 14:50:52,485 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-06-14 14:50:52,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 337 events. 186/337 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1172 event pairs, 94 based on Foata normal form. 2/338 useless extension candidates. Maximal degree in co-relation 766. Up to 319 conditions per place. [2024-06-14 14:50:52,488 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 28 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-14 14:50:52,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 163 flow [2024-06-14 14:50:52,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:50:52,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:50:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2024-06-14 14:50:52,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47580645161290325 [2024-06-14 14:50:52,489 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 59 transitions. [2024-06-14 14:50:52,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 163 flow [2024-06-14 14:50:52,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:50:52,491 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-14 14:50:52,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-06-14 14:50:52,492 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-14 14:50:52,492 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-14 14:50:52,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:52,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:52,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:50:52,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 14:50:52,493 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:50:52,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:52,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2057206554, now seen corresponding path program 1 times [2024-06-14 14:50:52,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:52,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040242944] [2024-06-14 14:50:52,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:52,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:50:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:50:54,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:50:54,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040242944] [2024-06-14 14:50:54,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040242944] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:50:54,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:50:54,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 14:50:54,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884175766] [2024-06-14 14:50:54,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:50:54,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:50:54,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:50:54,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:50:54,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 14:50:54,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:50:54,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:54,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:54,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:50:54,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:54,441 INFO L124 PetriNetUnfolderBase]: 180/327 cut-off events. [2024-06-14 14:50:54,441 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2024-06-14 14:50:54,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 327 events. 180/327 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1119 event pairs, 52 based on Foata normal form. 4/330 useless extension candidates. Maximal degree in co-relation 822. Up to 291 conditions per place. [2024-06-14 14:50:54,444 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 33 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-14 14:50:54,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 215 flow [2024-06-14 14:50:54,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:50:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:50:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2024-06-14 14:50:54,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645161290322581 [2024-06-14 14:50:54,446 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 72 transitions. [2024-06-14 14:50:54,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 215 flow [2024-06-14 14:50:54,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 206 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 14:50:54,448 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 119 flow [2024-06-14 14:50:54,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-06-14 14:50:54,448 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-14 14:50:54,449 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 119 flow [2024-06-14 14:50:54,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:54,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:54,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:50:54,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 14:50:54,449 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-14 14:50:54,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:54,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1290578649, now seen corresponding path program 1 times [2024-06-14 14:50:54,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:54,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306184683] [2024-06-14 14:50:54,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:54,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:50:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:50:56,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:50:56,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306184683] [2024-06-14 14:50:56,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306184683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:50:56,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:50:56,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:50:56,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967937994] [2024-06-14 14:50:56,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:50:56,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:50:56,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:50:56,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:50:56,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:50:56,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:50:56,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 119 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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-14 14:50:56,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:56,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:50:56,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:57,167 INFO L124 PetriNetUnfolderBase]: 176/319 cut-off events. [2024-06-14 14:50:57,167 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2024-06-14 14:50:57,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 319 events. 176/319 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1082 event pairs, 30 based on Foata normal form. 4/322 useless extension candidates. Maximal degree in co-relation 873. Up to 265 conditions per place. [2024-06-14 14:50:57,171 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 33 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-06-14 14:50:57,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 229 flow [2024-06-14 14:50:57,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:50:57,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:50:57,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-06-14 14:50:57,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42473118279569894 [2024-06-14 14:50:57,176 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 119 flow. Second operand 6 states and 79 transitions. [2024-06-14 14:50:57,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 229 flow [2024-06-14 14:50:57,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 214 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 14:50:57,178 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 116 flow [2024-06-14 14:50:57,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2024-06-14 14:50:57,180 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-14 14:50:57,180 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 116 flow [2024-06-14 14:50:57,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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-14 14:50:57,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:57,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:50:57,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 14:50:57,181 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-14 14:50:57,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:57,181 INFO L85 PathProgramCache]: Analyzing trace with hash 672537551, now seen corresponding path program 1 times [2024-06-14 14:50:57,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:57,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72998562] [2024-06-14 14:50:57,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:57,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:00,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:00,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72998562] [2024-06-14 14:51:00,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72998562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:00,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:00,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:51:00,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947813184] [2024-06-14 14:51:00,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:00,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:51:00,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:00,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:51:00,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:51:00,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:51:00,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:51:00,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:00,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:51:00,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:00,589 INFO L124 PetriNetUnfolderBase]: 147/283 cut-off events. [2024-06-14 14:51:00,589 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2024-06-14 14:51:00,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 283 events. 147/283 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 985 event pairs, 53 based on Foata normal form. 1/283 useless extension candidates. Maximal degree in co-relation 792. Up to 259 conditions per place. [2024-06-14 14:51:00,591 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 26 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2024-06-14 14:51:00,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 198 flow [2024-06-14 14:51:00,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:51:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:51:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2024-06-14 14:51:00,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-14 14:51:00,592 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 116 flow. Second operand 5 states and 59 transitions. [2024-06-14 14:51:00,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 198 flow [2024-06-14 14:51:00,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 178 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 14:51:00,594 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 123 flow [2024-06-14 14:51:00,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2024-06-14 14:51:00,595 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2024-06-14 14:51:00,595 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 123 flow [2024-06-14 14:51:00,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:51:00,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:00,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:51:00,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 14:51:00,596 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:51:00,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash -616340437, now seen corresponding path program 1 times [2024-06-14 14:51:00,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:00,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105007176] [2024-06-14 14:51:00,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:00,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:04,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:04,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105007176] [2024-06-14 14:51:04,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105007176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:04,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:04,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:51:04,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240811250] [2024-06-14 14:51:04,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:04,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:51:04,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:04,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:51:04,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:51:04,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-14 14:51:04,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 123 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:51:04,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:04,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-14 14:51:04,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:04,655 INFO L124 PetriNetUnfolderBase]: 145/280 cut-off events. [2024-06-14 14:51:04,656 INFO L125 PetriNetUnfolderBase]: For 477/477 co-relation queries the response was YES. [2024-06-14 14:51:04,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 280 events. 145/280 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 965 event pairs, 52 based on Foata normal form. 1/280 useless extension candidates. Maximal degree in co-relation 816. Up to 253 conditions per place. [2024-06-14 14:51:04,659 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 27 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2024-06-14 14:51:04,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 215 flow [2024-06-14 14:51:04,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:51:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:51:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2024-06-14 14:51:04,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-14 14:51:04,661 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 123 flow. Second operand 6 states and 74 transitions. [2024-06-14 14:51:04,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 215 flow [2024-06-14 14:51:04,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 204 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 14:51:04,664 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 145 flow [2024-06-14 14:51:04,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2024-06-14 14:51:04,666 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2024-06-14 14:51:04,666 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 145 flow [2024-06-14 14:51:04,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:51:04,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:04,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:51:04,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 14:51:04,668 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:51:04,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1661963166, now seen corresponding path program 1 times [2024-06-14 14:51:04,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:04,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939453725] [2024-06-14 14:51:04,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:04,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:08,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:08,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:08,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939453725] [2024-06-14 14:51:08,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939453725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:08,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:08,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:51:08,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823885547] [2024-06-14 14:51:08,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:08,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:51:08,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:08,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:51:08,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:51:08,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:51:08,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 145 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:51:08,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:08,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:51:08,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:08,292 INFO L124 PetriNetUnfolderBase]: 173/315 cut-off events. [2024-06-14 14:51:08,292 INFO L125 PetriNetUnfolderBase]: For 745/745 co-relation queries the response was YES. [2024-06-14 14:51:08,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 315 events. 173/315 cut-off events. For 745/745 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1051 event pairs, 62 based on Foata normal form. 1/315 useless extension candidates. Maximal degree in co-relation 1006. Up to 294 conditions per place. [2024-06-14 14:51:08,294 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 33 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-06-14 14:51:08,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 257 flow [2024-06-14 14:51:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:51:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:51:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2024-06-14 14:51:08,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-14 14:51:08,295 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 145 flow. Second operand 6 states and 66 transitions. [2024-06-14 14:51:08,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 257 flow [2024-06-14 14:51:08,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 240 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 14:51:08,297 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 161 flow [2024-06-14 14:51:08,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-06-14 14:51:08,298 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2024-06-14 14:51:08,298 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 161 flow [2024-06-14 14:51:08,298 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-14 14:51:08,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:08,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:51:08,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 14:51:08,299 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:51:08,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:08,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1926691336, now seen corresponding path program 2 times [2024-06-14 14:51:08,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:08,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745395707] [2024-06-14 14:51:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:11,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:11,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745395707] [2024-06-14 14:51:11,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745395707] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:11,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:11,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:51:11,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261216344] [2024-06-14 14:51:11,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:11,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:51:11,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:11,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:51:11,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:51:11,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:51:11,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 161 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:51:11,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:11,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:51:11,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:11,400 INFO L124 PetriNetUnfolderBase]: 171/313 cut-off events. [2024-06-14 14:51:11,401 INFO L125 PetriNetUnfolderBase]: For 969/972 co-relation queries the response was YES. [2024-06-14 14:51:11,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 313 events. 171/313 cut-off events. For 969/972 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1066 event pairs, 66 based on Foata normal form. 3/314 useless extension candidates. Maximal degree in co-relation 1055. Up to 285 conditions per place. [2024-06-14 14:51:11,403 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 29 selfloop transitions, 11 changer transitions 0/42 dead transitions. [2024-06-14 14:51:11,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 267 flow [2024-06-14 14:51:11,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:51:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:51:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2024-06-14 14:51:11,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34946236559139787 [2024-06-14 14:51:11,404 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 161 flow. Second operand 6 states and 65 transitions. [2024-06-14 14:51:11,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 267 flow [2024-06-14 14:51:11,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 42 transitions, 250 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 14:51:11,406 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 187 flow [2024-06-14 14:51:11,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2024-06-14 14:51:11,407 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-06-14 14:51:11,407 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 187 flow [2024-06-14 14:51:11,407 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-14 14:51:11,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:11,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:51:11,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 14:51:11,408 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:51:11,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:11,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1214428462, now seen corresponding path program 1 times [2024-06-14 14:51:11,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:11,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559311922] [2024-06-14 14:51:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:11,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:15,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:15,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559311922] [2024-06-14 14:51:15,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559311922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:15,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:15,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:51:15,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812257713] [2024-06-14 14:51:15,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:15,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:51:15,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:15,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:51:15,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:51:15,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:51:15,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 187 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-14 14:51:15,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:15,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:51:15,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:15,368 INFO L124 PetriNetUnfolderBase]: 189/344 cut-off events. [2024-06-14 14:51:15,368 INFO L125 PetriNetUnfolderBase]: For 1297/1297 co-relation queries the response was YES. [2024-06-14 14:51:15,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 344 events. 189/344 cut-off events. For 1297/1297 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1190 event pairs, 62 based on Foata normal form. 2/345 useless extension candidates. Maximal degree in co-relation 1226. Up to 307 conditions per place. [2024-06-14 14:51:15,370 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 43 selfloop transitions, 15 changer transitions 0/60 dead transitions. [2024-06-14 14:51:15,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 389 flow [2024-06-14 14:51:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:51:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:51:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-14 14:51:15,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33691756272401435 [2024-06-14 14:51:15,372 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 187 flow. Second operand 9 states and 94 transitions. [2024-06-14 14:51:15,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 389 flow [2024-06-14 14:51:15,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 358 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 14:51:15,374 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 259 flow [2024-06-14 14:51:15,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=259, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-06-14 14:51:15,375 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2024-06-14 14:51:15,375 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 259 flow [2024-06-14 14:51:15,375 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-14 14:51:15,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:15,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:51:15,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 14:51:15,376 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:51:15,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:15,376 INFO L85 PathProgramCache]: Analyzing trace with hash -632825254, now seen corresponding path program 2 times [2024-06-14 14:51:15,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:15,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949577253] [2024-06-14 14:51:15,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:15,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:18,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:18,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949577253] [2024-06-14 14:51:18,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949577253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:18,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:18,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:51:18,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569049585] [2024-06-14 14:51:18,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:18,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:51:18,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:18,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:51:18,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:51:18,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:51:18,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 259 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-14 14:51:18,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:18,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:51:18,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:19,172 INFO L124 PetriNetUnfolderBase]: 195/354 cut-off events. [2024-06-14 14:51:19,173 INFO L125 PetriNetUnfolderBase]: For 1710/1710 co-relation queries the response was YES. [2024-06-14 14:51:19,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 354 events. 195/354 cut-off events. For 1710/1710 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1228 event pairs, 43 based on Foata normal form. 2/355 useless extension candidates. Maximal degree in co-relation 1397. Up to 293 conditions per place. [2024-06-14 14:51:19,175 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 44 selfloop transitions, 20 changer transitions 0/66 dead transitions. [2024-06-14 14:51:19,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 66 transitions, 463 flow [2024-06-14 14:51:19,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:51:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:51:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-14 14:51:19,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588709677419355 [2024-06-14 14:51:19,177 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 259 flow. Second operand 8 states and 89 transitions. [2024-06-14 14:51:19,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 66 transitions, 463 flow [2024-06-14 14:51:19,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 445 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 14:51:19,179 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 327 flow [2024-06-14 14:51:19,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=327, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2024-06-14 14:51:19,180 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2024-06-14 14:51:19,180 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 327 flow [2024-06-14 14:51:19,180 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-14 14:51:19,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:19,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:51:19,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 14:51:19,181 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:51:19,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:19,181 INFO L85 PathProgramCache]: Analyzing trace with hash 277308802, now seen corresponding path program 3 times [2024-06-14 14:51:19,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:19,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140449031] [2024-06-14 14:51:19,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:19,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:22,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:22,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140449031] [2024-06-14 14:51:22,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140449031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:22,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:22,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:51:22,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039318675] [2024-06-14 14:51:22,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:22,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:51:22,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:22,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:51:22,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:51:22,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:51:22,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 327 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:51:22,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:22,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:51:22,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:23,013 INFO L124 PetriNetUnfolderBase]: 206/372 cut-off events. [2024-06-14 14:51:23,014 INFO L125 PetriNetUnfolderBase]: For 2269/2269 co-relation queries the response was YES. [2024-06-14 14:51:23,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 372 events. 206/372 cut-off events. For 2269/2269 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1307 event pairs, 43 based on Foata normal form. 2/373 useless extension candidates. Maximal degree in co-relation 1641. Up to 294 conditions per place. [2024-06-14 14:51:23,016 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 43 selfloop transitions, 24 changer transitions 0/69 dead transitions. [2024-06-14 14:51:23,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 69 transitions, 571 flow [2024-06-14 14:51:23,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:51:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:51:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-14 14:51:23,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-06-14 14:51:23,020 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 327 flow. Second operand 8 states and 90 transitions. [2024-06-14 14:51:23,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 69 transitions, 571 flow [2024-06-14 14:51:23,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 511 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-14 14:51:23,023 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 370 flow [2024-06-14 14:51:23,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=370, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2024-06-14 14:51:23,024 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2024-06-14 14:51:23,025 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 370 flow [2024-06-14 14:51:23,039 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-14 14:51:23,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:23,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:51:23,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 14:51:23,040 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:51:23,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:23,040 INFO L85 PathProgramCache]: Analyzing trace with hash -632705098, now seen corresponding path program 1 times [2024-06-14 14:51:23,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:23,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811985323] [2024-06-14 14:51:23,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:23,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:27,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:27,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811985323] [2024-06-14 14:51:27,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811985323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:27,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:27,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:51:27,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216062865] [2024-06-14 14:51:27,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:27,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:51:27,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:27,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:51:27,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:51:27,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:51:27,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 370 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-14 14:51:27,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:27,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:51:27,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:27,805 INFO L124 PetriNetUnfolderBase]: 209/377 cut-off events. [2024-06-14 14:51:27,806 INFO L125 PetriNetUnfolderBase]: For 2179/2179 co-relation queries the response was YES. [2024-06-14 14:51:27,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 377 events. 209/377 cut-off events. For 2179/2179 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1340 event pairs, 43 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 1633. Up to 348 conditions per place. [2024-06-14 14:51:27,810 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 50 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2024-06-14 14:51:27,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 528 flow [2024-06-14 14:51:27,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:51:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:51:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-14 14:51:27,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34101382488479265 [2024-06-14 14:51:27,811 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 370 flow. Second operand 7 states and 74 transitions. [2024-06-14 14:51:27,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 528 flow [2024-06-14 14:51:27,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 498 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 14:51:27,815 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 383 flow [2024-06-14 14:51:27,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=383, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-06-14 14:51:27,817 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2024-06-14 14:51:27,817 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 383 flow [2024-06-14 14:51:27,818 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-14 14:51:27,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:27,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:51:27,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 14:51:27,818 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:51:27,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:27,819 INFO L85 PathProgramCache]: Analyzing trace with hash -455573578, now seen corresponding path program 2 times [2024-06-14 14:51:27,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:27,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202291288] [2024-06-14 14:51:27,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:27,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:31,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:31,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202291288] [2024-06-14 14:51:31,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202291288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:31,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:31,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:51:31,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755790378] [2024-06-14 14:51:31,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:31,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:51:31,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:31,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:51:31,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:51:31,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:51:31,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 383 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-14 14:51:31,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:31,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:51:31,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:32,041 INFO L124 PetriNetUnfolderBase]: 212/383 cut-off events. [2024-06-14 14:51:32,041 INFO L125 PetriNetUnfolderBase]: For 2499/2502 co-relation queries the response was YES. [2024-06-14 14:51:32,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1751 conditions, 383 events. 212/383 cut-off events. For 2499/2502 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1349 event pairs, 46 based on Foata normal form. 3/383 useless extension candidates. Maximal degree in co-relation 1717. Up to 347 conditions per place. [2024-06-14 14:51:32,044 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 47 selfloop transitions, 15 changer transitions 0/64 dead transitions. [2024-06-14 14:51:32,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 64 transitions, 539 flow [2024-06-14 14:51:32,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:51:32,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:51:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2024-06-14 14:51:32,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33640552995391704 [2024-06-14 14:51:32,045 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 383 flow. Second operand 7 states and 73 transitions. [2024-06-14 14:51:32,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 64 transitions, 539 flow [2024-06-14 14:51:32,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 512 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 14:51:32,048 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 409 flow [2024-06-14 14:51:32,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=409, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2024-06-14 14:51:32,049 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2024-06-14 14:51:32,049 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 409 flow [2024-06-14 14:51:32,050 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-14 14:51:32,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:32,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:51:32,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 14:51:32,050 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:51:32,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:32,050 INFO L85 PathProgramCache]: Analyzing trace with hash -455573764, now seen corresponding path program 4 times [2024-06-14 14:51:32,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:32,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320511184] [2024-06-14 14:51:32,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:32,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:35,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:35,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:35,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320511184] [2024-06-14 14:51:35,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320511184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:35,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:35,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:51:35,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56285040] [2024-06-14 14:51:35,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:35,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:51:35,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:35,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:51:35,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:51:35,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:51:35,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 409 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-14 14:51:35,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:35,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:51:35,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:35,970 INFO L124 PetriNetUnfolderBase]: 208/377 cut-off events. [2024-06-14 14:51:35,970 INFO L125 PetriNetUnfolderBase]: For 2811/2814 co-relation queries the response was YES. [2024-06-14 14:51:35,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 377 events. 208/377 cut-off events. For 2811/2814 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1335 event pairs, 44 based on Foata normal form. 4/378 useless extension candidates. Maximal degree in co-relation 1735. Up to 286 conditions per place. [2024-06-14 14:51:35,973 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 43 selfloop transitions, 28 changer transitions 0/73 dead transitions. [2024-06-14 14:51:35,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 73 transitions, 635 flow [2024-06-14 14:51:35,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:51:35,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:51:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-14 14:51:35,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588709677419355 [2024-06-14 14:51:35,974 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 409 flow. Second operand 8 states and 89 transitions. [2024-06-14 14:51:35,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 73 transitions, 635 flow [2024-06-14 14:51:35,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 73 transitions, 598 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 14:51:35,980 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 457 flow [2024-06-14 14:51:35,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=457, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2024-06-14 14:51:35,981 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 42 predicate places. [2024-06-14 14:51:35,981 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 457 flow [2024-06-14 14:51:35,981 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-14 14:51:35,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:35,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:51:35,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 14:51:35,982 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:51:35,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:35,982 INFO L85 PathProgramCache]: Analyzing trace with hash 23398478, now seen corresponding path program 3 times [2024-06-14 14:51:35,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:35,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019315952] [2024-06-14 14:51:35,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:35,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:39,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:39,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019315952] [2024-06-14 14:51:39,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019315952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:39,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:39,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:51:39,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000790487] [2024-06-14 14:51:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:39,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:51:39,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:39,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:51:39,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:51:39,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:51:39,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 59 transitions, 457 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-14 14:51:39,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:39,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:51:39,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:40,077 INFO L124 PetriNetUnfolderBase]: 206/374 cut-off events. [2024-06-14 14:51:40,078 INFO L125 PetriNetUnfolderBase]: For 3149/3152 co-relation queries the response was YES. [2024-06-14 14:51:40,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 374 events. 206/374 cut-off events. For 3149/3152 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1320 event pairs, 45 based on Foata normal form. 3/374 useless extension candidates. Maximal degree in co-relation 1799. Up to 329 conditions per place. [2024-06-14 14:51:40,080 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 48 selfloop transitions, 20 changer transitions 0/70 dead transitions. [2024-06-14 14:51:40,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 70 transitions, 639 flow [2024-06-14 14:51:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:51:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:51:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-14 14:51:40,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34101382488479265 [2024-06-14 14:51:40,081 INFO L175 Difference]: Start difference. First operand has 72 places, 59 transitions, 457 flow. Second operand 7 states and 74 transitions. [2024-06-14 14:51:40,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 70 transitions, 639 flow [2024-06-14 14:51:40,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 570 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 14:51:40,085 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 476 flow [2024-06-14 14:51:40,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=476, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2024-06-14 14:51:40,086 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2024-06-14 14:51:40,087 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 476 flow [2024-06-14 14:51:40,087 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-14 14:51:40,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:40,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:51:40,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 14:51:40,087 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:51:40,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:40,088 INFO L85 PathProgramCache]: Analyzing trace with hash -455327500, now seen corresponding path program 1 times [2024-06-14 14:51:40,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:40,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905508005] [2024-06-14 14:51:40,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:40,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:44,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-14 14:51:44,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:44,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905508005] [2024-06-14 14:51:44,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905508005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:44,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:44,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:51:44,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464796232] [2024-06-14 14:51:44,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:44,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:51:44,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:44,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:51:44,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:51:44,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:51:44,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 476 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-14 14:51:44,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:44,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:51:44,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:45,109 INFO L124 PetriNetUnfolderBase]: 204/370 cut-off events. [2024-06-14 14:51:45,109 INFO L125 PetriNetUnfolderBase]: For 3419/3419 co-relation queries the response was YES. [2024-06-14 14:51:45,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1831 conditions, 370 events. 204/370 cut-off events. For 3419/3419 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1312 event pairs, 47 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 1793. Up to 348 conditions per place. [2024-06-14 14:51:45,112 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 59 selfloop transitions, 12 changer transitions 0/73 dead transitions. [2024-06-14 14:51:45,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 73 transitions, 648 flow [2024-06-14 14:51:45,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:51:45,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:51:45,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2024-06-14 14:51:45,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3185483870967742 [2024-06-14 14:51:45,114 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 476 flow. Second operand 8 states and 79 transitions. [2024-06-14 14:51:45,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 73 transitions, 648 flow [2024-06-14 14:51:45,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 73 transitions, 618 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 14:51:45,118 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 489 flow [2024-06-14 14:51:45,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=489, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2024-06-14 14:51:45,119 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-06-14 14:51:45,119 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 489 flow [2024-06-14 14:51:45,119 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-14 14:51:45,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:45,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:51:45,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 14:51:45,120 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:51:45,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:45,120 INFO L85 PathProgramCache]: Analyzing trace with hash 577446209, now seen corresponding path program 1 times [2024-06-14 14:51:45,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:45,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613300488] [2024-06-14 14:51:45,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:45,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:48,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:48,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613300488] [2024-06-14 14:51:48,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613300488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:48,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:48,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:51:48,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795224059] [2024-06-14 14:51:48,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:48,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:51:48,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:48,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:51:48,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:51:49,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:51:49,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 489 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-14 14:51:49,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:49,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:51:49,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:49,337 INFO L124 PetriNetUnfolderBase]: 202/367 cut-off events. [2024-06-14 14:51:49,337 INFO L125 PetriNetUnfolderBase]: For 3583/3583 co-relation queries the response was YES. [2024-06-14 14:51:49,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1861 conditions, 367 events. 202/367 cut-off events. For 3583/3583 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1291 event pairs, 40 based on Foata normal form. 1/367 useless extension candidates. Maximal degree in co-relation 1821. Up to 301 conditions per place. [2024-06-14 14:51:49,340 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 56 selfloop transitions, 20 changer transitions 0/78 dead transitions. [2024-06-14 14:51:49,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 78 transitions, 679 flow [2024-06-14 14:51:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:51:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:51:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-14 14:51:49,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3640552995391705 [2024-06-14 14:51:49,342 INFO L175 Difference]: Start difference. First operand has 79 places, 65 transitions, 489 flow. Second operand 7 states and 79 transitions. [2024-06-14 14:51:49,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 78 transitions, 679 flow [2024-06-14 14:51:49,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 78 transitions, 624 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 14:51:49,346 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 486 flow [2024-06-14 14:51:49,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=486, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2024-06-14 14:51:49,347 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-06-14 14:51:49,347 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 486 flow [2024-06-14 14:51:49,347 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-14 14:51:49,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:49,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:51:49,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 14:51:49,348 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:51:49,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:49,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2920132, now seen corresponding path program 1 times [2024-06-14 14:51:49,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:49,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832158248] [2024-06-14 14:51:49,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:49,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:53,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:53,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832158248] [2024-06-14 14:51:53,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832158248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:53,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:53,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:51:53,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337383280] [2024-06-14 14:51:53,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:53,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:51:53,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:53,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:51:53,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:51:53,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:51:53,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 486 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-14 14:51:53,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:53,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:51:53,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:53,892 INFO L124 PetriNetUnfolderBase]: 222/403 cut-off events. [2024-06-14 14:51:53,892 INFO L125 PetriNetUnfolderBase]: For 4304/4304 co-relation queries the response was YES. [2024-06-14 14:51:53,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2073 conditions, 403 events. 222/403 cut-off events. For 4304/4304 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1476 event pairs, 47 based on Foata normal form. 2/401 useless extension candidates. Maximal degree in co-relation 2033. Up to 331 conditions per place. [2024-06-14 14:51:53,895 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 63 selfloop transitions, 24 changer transitions 0/89 dead transitions. [2024-06-14 14:51:53,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 89 transitions, 816 flow [2024-06-14 14:51:53,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:51:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:51:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-14 14:51:53,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-14 14:51:53,897 INFO L175 Difference]: Start difference. First operand has 79 places, 65 transitions, 486 flow. Second operand 9 states and 96 transitions. [2024-06-14 14:51:53,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 89 transitions, 816 flow [2024-06-14 14:51:53,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 89 transitions, 754 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-14 14:51:53,902 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 637 flow [2024-06-14 14:51:53,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=637, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2024-06-14 14:51:53,902 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2024-06-14 14:51:53,903 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 637 flow [2024-06-14 14:51:53,903 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-14 14:51:53,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:53,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:51:53,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 14:51:53,903 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:51:53,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1466247788, now seen corresponding path program 2 times [2024-06-14 14:51:53,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:53,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770513961] [2024-06-14 14:51:53,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:53,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:57,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:57,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770513961] [2024-06-14 14:51:57,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770513961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:57,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:57,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:51:57,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496419774] [2024-06-14 14:51:57,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:57,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:51:57,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:57,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:51:57,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:51:57,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:51:57,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 77 transitions, 637 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:51:57,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:57,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:51:57,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:57,756 INFO L124 PetriNetUnfolderBase]: 228/414 cut-off events. [2024-06-14 14:51:57,757 INFO L125 PetriNetUnfolderBase]: For 4923/4923 co-relation queries the response was YES. [2024-06-14 14:51:57,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2238 conditions, 414 events. 228/414 cut-off events. For 4923/4923 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1538 event pairs, 44 based on Foata normal form. 2/415 useless extension candidates. Maximal degree in co-relation 2192. Up to 317 conditions per place. [2024-06-14 14:51:57,760 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 59 selfloop transitions, 33 changer transitions 0/94 dead transitions. [2024-06-14 14:51:57,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 94 transitions, 895 flow [2024-06-14 14:51:57,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:51:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:51:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-14 14:51:57,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-14 14:51:57,762 INFO L175 Difference]: Start difference. First operand has 87 places, 77 transitions, 637 flow. Second operand 8 states and 96 transitions. [2024-06-14 14:51:57,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 94 transitions, 895 flow [2024-06-14 14:51:57,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 94 transitions, 851 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-14 14:51:57,772 INFO L231 Difference]: Finished difference. Result has 93 places, 79 transitions, 694 flow [2024-06-14 14:51:57,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=694, PETRI_PLACES=93, PETRI_TRANSITIONS=79} [2024-06-14 14:51:57,773 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2024-06-14 14:51:57,773 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 79 transitions, 694 flow [2024-06-14 14:51:57,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:51:57,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:57,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:51:57,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 14:51:57,774 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:51:57,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:57,775 INFO L85 PathProgramCache]: Analyzing trace with hash -634876266, now seen corresponding path program 3 times [2024-06-14 14:51:57,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:57,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250987276] [2024-06-14 14:51:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:57,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:52:01,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:01,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250987276] [2024-06-14 14:52:01,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250987276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:01,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:01,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:52:01,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172887907] [2024-06-14 14:52:01,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:01,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:52:01,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:01,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:52:01,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:52:01,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:52:01,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 79 transitions, 694 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-14 14:52:01,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:01,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:52:01,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:01,622 INFO L124 PetriNetUnfolderBase]: 240/433 cut-off events. [2024-06-14 14:52:01,622 INFO L125 PetriNetUnfolderBase]: For 5694/5694 co-relation queries the response was YES. [2024-06-14 14:52:01,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2412 conditions, 433 events. 240/433 cut-off events. For 5694/5694 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1627 event pairs, 76 based on Foata normal form. 2/434 useless extension candidates. Maximal degree in co-relation 2364. Up to 398 conditions per place. [2024-06-14 14:52:01,626 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 79 selfloop transitions, 17 changer transitions 0/98 dead transitions. [2024-06-14 14:52:01,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 98 transitions, 976 flow [2024-06-14 14:52:01,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:52:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:52:01,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2024-06-14 14:52:01,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32974910394265233 [2024-06-14 14:52:01,628 INFO L175 Difference]: Start difference. First operand has 93 places, 79 transitions, 694 flow. Second operand 9 states and 92 transitions. [2024-06-14 14:52:01,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 98 transitions, 976 flow [2024-06-14 14:52:01,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 98 transitions, 893 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-14 14:52:01,635 INFO L231 Difference]: Finished difference. Result has 98 places, 85 transitions, 718 flow [2024-06-14 14:52:01,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=718, PETRI_PLACES=98, PETRI_TRANSITIONS=85} [2024-06-14 14:52:01,635 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 68 predicate places. [2024-06-14 14:52:01,635 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 85 transitions, 718 flow [2024-06-14 14:52:01,636 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-14 14:52:01,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:01,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:52:01,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 14:52:01,637 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:52:01,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:01,637 INFO L85 PathProgramCache]: Analyzing trace with hash -634876049, now seen corresponding path program 1 times [2024-06-14 14:52:01,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:01,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944270220] [2024-06-14 14:52:01,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:01,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:05,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-14 14:52:05,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:05,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944270220] [2024-06-14 14:52:05,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944270220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:05,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:05,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:52:05,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955280156] [2024-06-14 14:52:05,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:05,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:52:05,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:05,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:52:05,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:52:05,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:52:05,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 85 transitions, 718 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-14 14:52:05,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:05,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:52:05,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:05,963 INFO L124 PetriNetUnfolderBase]: 243/438 cut-off events. [2024-06-14 14:52:05,963 INFO L125 PetriNetUnfolderBase]: For 5471/5471 co-relation queries the response was YES. [2024-06-14 14:52:05,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2398 conditions, 438 events. 243/438 cut-off events. For 5471/5471 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1643 event pairs, 75 based on Foata normal form. 1/438 useless extension candidates. Maximal degree in co-relation 2347. Up to 406 conditions per place. [2024-06-14 14:52:05,966 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 80 selfloop transitions, 17 changer transitions 0/99 dead transitions. [2024-06-14 14:52:05,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 966 flow [2024-06-14 14:52:05,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:52:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:52:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-14 14:52:05,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32616487455197135 [2024-06-14 14:52:05,968 INFO L175 Difference]: Start difference. First operand has 98 places, 85 transitions, 718 flow. Second operand 9 states and 91 transitions. [2024-06-14 14:52:05,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 966 flow [2024-06-14 14:52:05,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 99 transitions, 923 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 14:52:05,975 INFO L231 Difference]: Finished difference. Result has 102 places, 87 transitions, 736 flow [2024-06-14 14:52:05,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=736, PETRI_PLACES=102, PETRI_TRANSITIONS=87} [2024-06-14 14:52:05,975 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 72 predicate places. [2024-06-14 14:52:05,976 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 87 transitions, 736 flow [2024-06-14 14:52:05,976 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-14 14:52:05,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:05,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:52:05,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 14:52:05,976 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:52:05,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:05,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1141228112, now seen corresponding path program 4 times [2024-06-14 14:52:05,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:05,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672029946] [2024-06-14 14:52:05,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:05,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:52:09,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:09,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672029946] [2024-06-14 14:52:09,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672029946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:09,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:09,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:52:09,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324043062] [2024-06-14 14:52:09,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:09,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:52:09,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:09,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:52:09,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:52:09,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:52:09,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 87 transitions, 736 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:52:09,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:09,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:52:09,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:09,986 INFO L124 PetriNetUnfolderBase]: 249/449 cut-off events. [2024-06-14 14:52:09,987 INFO L125 PetriNetUnfolderBase]: For 6060/6060 co-relation queries the response was YES. [2024-06-14 14:52:09,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 449 events. 249/449 cut-off events. For 6060/6060 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1680 event pairs, 45 based on Foata normal form. 2/450 useless extension candidates. Maximal degree in co-relation 2439. Up to 343 conditions per place. [2024-06-14 14:52:09,991 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 67 selfloop transitions, 33 changer transitions 0/102 dead transitions. [2024-06-14 14:52:09,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 102 transitions, 1004 flow [2024-06-14 14:52:09,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:52:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:52:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-14 14:52:09,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-14 14:52:09,992 INFO L175 Difference]: Start difference. First operand has 102 places, 87 transitions, 736 flow. Second operand 8 states and 96 transitions. [2024-06-14 14:52:09,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 102 transitions, 1004 flow [2024-06-14 14:52:09,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 102 transitions, 959 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 14:52:09,999 INFO L231 Difference]: Finished difference. Result has 103 places, 89 transitions, 792 flow [2024-06-14 14:52:09,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=792, PETRI_PLACES=103, PETRI_TRANSITIONS=89} [2024-06-14 14:52:10,000 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2024-06-14 14:52:10,000 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 792 flow [2024-06-14 14:52:10,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:52:10,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:10,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:52:10,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 14:52:10,001 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:52:10,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:10,001 INFO L85 PathProgramCache]: Analyzing trace with hash 6644999, now seen corresponding path program 2 times [2024-06-14 14:52:10,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:10,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668908560] [2024-06-14 14:52:10,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:10,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:13,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-14 14:52:13,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:13,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668908560] [2024-06-14 14:52:13,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668908560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:13,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:13,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:52:13,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086713516] [2024-06-14 14:52:13,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:13,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:52:13,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:13,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:52:13,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:52:13,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:52:13,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 792 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-14 14:52:13,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:13,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:52:13,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:14,024 INFO L124 PetriNetUnfolderBase]: 255/458 cut-off events. [2024-06-14 14:52:14,024 INFO L125 PetriNetUnfolderBase]: For 6888/6888 co-relation queries the response was YES. [2024-06-14 14:52:14,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2638 conditions, 458 events. 255/458 cut-off events. For 6888/6888 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1734 event pairs, 77 based on Foata normal form. 2/459 useless extension candidates. Maximal degree in co-relation 2585. Up to 412 conditions per place. [2024-06-14 14:52:14,027 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 79 selfloop transitions, 21 changer transitions 0/102 dead transitions. [2024-06-14 14:52:14,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 102 transitions, 1048 flow [2024-06-14 14:52:14,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:52:14,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:52:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-14 14:52:14,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3346774193548387 [2024-06-14 14:52:14,029 INFO L175 Difference]: Start difference. First operand has 103 places, 89 transitions, 792 flow. Second operand 8 states and 83 transitions. [2024-06-14 14:52:14,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 102 transitions, 1048 flow [2024-06-14 14:52:14,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 102 transitions, 963 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-14 14:52:14,036 INFO L231 Difference]: Finished difference. Result has 105 places, 91 transitions, 780 flow [2024-06-14 14:52:14,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=780, PETRI_PLACES=105, PETRI_TRANSITIONS=91} [2024-06-14 14:52:14,037 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 75 predicate places. [2024-06-14 14:52:14,037 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 91 transitions, 780 flow [2024-06-14 14:52:14,037 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-14 14:52:14,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:14,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:52:14,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 14:52:14,037 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:52:14,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:14,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1860979188, now seen corresponding path program 5 times [2024-06-14 14:52:14,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:14,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020701337] [2024-06-14 14:52:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:14,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:17,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-14 14:52:17,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:17,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020701337] [2024-06-14 14:52:17,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020701337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:17,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:17,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:52:17,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267737758] [2024-06-14 14:52:17,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:17,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:52:17,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:17,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:52:17,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:52:17,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:52:17,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 91 transitions, 780 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-14 14:52:17,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:17,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:52:17,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:18,210 INFO L124 PetriNetUnfolderBase]: 261/468 cut-off events. [2024-06-14 14:52:18,210 INFO L125 PetriNetUnfolderBase]: For 7362/7362 co-relation queries the response was YES. [2024-06-14 14:52:18,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 468 events. 261/468 cut-off events. For 7362/7362 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1789 event pairs, 77 based on Foata normal form. 2/469 useless extension candidates. Maximal degree in co-relation 2647. Up to 421 conditions per place. [2024-06-14 14:52:18,215 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 80 selfloop transitions, 22 changer transitions 0/104 dead transitions. [2024-06-14 14:52:18,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 1048 flow [2024-06-14 14:52:18,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:52:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:52:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-14 14:52:18,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3346774193548387 [2024-06-14 14:52:18,217 INFO L175 Difference]: Start difference. First operand has 105 places, 91 transitions, 780 flow. Second operand 8 states and 83 transitions. [2024-06-14 14:52:18,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 104 transitions, 1048 flow [2024-06-14 14:52:18,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 104 transitions, 997 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 14:52:18,226 INFO L231 Difference]: Finished difference. Result has 107 places, 93 transitions, 815 flow [2024-06-14 14:52:18,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=815, PETRI_PLACES=107, PETRI_TRANSITIONS=93} [2024-06-14 14:52:18,226 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 77 predicate places. [2024-06-14 14:52:18,227 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 93 transitions, 815 flow [2024-06-14 14:52:18,227 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-14 14:52:18,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:18,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:52:18,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 14:52:18,227 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:52:18,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:18,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1583038802, now seen corresponding path program 6 times [2024-06-14 14:52:18,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:18,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905162602] [2024-06-14 14:52:18,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:18,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:52:22,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:22,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905162602] [2024-06-14 14:52:22,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905162602] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:22,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:22,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:52:22,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821263200] [2024-06-14 14:52:22,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:22,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:52:22,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:22,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:52:22,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:52:22,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:52:22,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 93 transitions, 815 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-14 14:52:22,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:22,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:52:22,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:22,577 INFO L124 PetriNetUnfolderBase]: 277/495 cut-off events. [2024-06-14 14:52:22,577 INFO L125 PetriNetUnfolderBase]: For 8863/8863 co-relation queries the response was YES. [2024-06-14 14:52:22,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2963 conditions, 495 events. 277/495 cut-off events. For 8863/8863 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1909 event pairs, 81 based on Foata normal form. 2/494 useless extension candidates. Maximal degree in co-relation 2908. Up to 417 conditions per place. [2024-06-14 14:52:22,581 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 76 selfloop transitions, 30 changer transitions 0/108 dead transitions. [2024-06-14 14:52:22,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 108 transitions, 1173 flow [2024-06-14 14:52:22,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:52:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:52:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-14 14:52:22,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3467741935483871 [2024-06-14 14:52:22,583 INFO L175 Difference]: Start difference. First operand has 107 places, 93 transitions, 815 flow. Second operand 8 states and 86 transitions. [2024-06-14 14:52:22,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 108 transitions, 1173 flow [2024-06-14 14:52:22,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 108 transitions, 1097 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-14 14:52:22,593 INFO L231 Difference]: Finished difference. Result has 109 places, 97 transitions, 878 flow [2024-06-14 14:52:22,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=878, PETRI_PLACES=109, PETRI_TRANSITIONS=97} [2024-06-14 14:52:22,594 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 79 predicate places. [2024-06-14 14:52:22,594 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 97 transitions, 878 flow [2024-06-14 14:52:22,594 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-14 14:52:22,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:22,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:52:22,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 14:52:22,595 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:52:22,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:22,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1230526417, now seen corresponding path program 3 times [2024-06-14 14:52:22,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:22,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268053541] [2024-06-14 14:52:22,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:22,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:52:26,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268053541] [2024-06-14 14:52:26,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268053541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:26,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:26,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:52:26,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794515794] [2024-06-14 14:52:26,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:26,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:52:26,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:26,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:52:26,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:52:26,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:52:26,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 97 transitions, 878 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-14 14:52:26,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:26,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:52:26,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:27,004 INFO L124 PetriNetUnfolderBase]: 285/508 cut-off events. [2024-06-14 14:52:27,004 INFO L125 PetriNetUnfolderBase]: For 8906/8906 co-relation queries the response was YES. [2024-06-14 14:52:27,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3047 conditions, 508 events. 285/508 cut-off events. For 8906/8906 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1973 event pairs, 80 based on Foata normal form. 1/506 useless extension candidates. Maximal degree in co-relation 2991. Up to 437 conditions per place. [2024-06-14 14:52:27,009 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 80 selfloop transitions, 32 changer transitions 0/114 dead transitions. [2024-06-14 14:52:27,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 1296 flow [2024-06-14 14:52:27,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:52:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:52:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-14 14:52:27,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3467741935483871 [2024-06-14 14:52:27,011 INFO L175 Difference]: Start difference. First operand has 109 places, 97 transitions, 878 flow. Second operand 8 states and 86 transitions. [2024-06-14 14:52:27,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 1296 flow [2024-06-14 14:52:27,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 1244 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-14 14:52:27,022 INFO L231 Difference]: Finished difference. Result has 114 places, 104 transitions, 994 flow [2024-06-14 14:52:27,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=994, PETRI_PLACES=114, PETRI_TRANSITIONS=104} [2024-06-14 14:52:27,023 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 84 predicate places. [2024-06-14 14:52:27,023 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 104 transitions, 994 flow [2024-06-14 14:52:27,023 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-14 14:52:27,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:27,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:52:27,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 14:52:27,023 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:52:27,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:27,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1237878284, now seen corresponding path program 7 times [2024-06-14 14:52:27,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:27,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275093528] [2024-06-14 14:52:27,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:27,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:52:30,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:30,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275093528] [2024-06-14 14:52:30,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275093528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:30,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:30,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:52:30,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787132999] [2024-06-14 14:52:30,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:30,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:52:30,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:30,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:52:30,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:52:30,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:52:30,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 104 transitions, 994 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-14 14:52:30,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:30,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:52:30,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:31,096 INFO L124 PetriNetUnfolderBase]: 281/502 cut-off events. [2024-06-14 14:52:31,096 INFO L125 PetriNetUnfolderBase]: For 9227/9227 co-relation queries the response was YES. [2024-06-14 14:52:31,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3061 conditions, 502 events. 281/502 cut-off events. For 9227/9227 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1965 event pairs, 80 based on Foata normal form. 2/501 useless extension candidates. Maximal degree in co-relation 3002. Up to 457 conditions per place. [2024-06-14 14:52:31,101 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 91 selfloop transitions, 20 changer transitions 0/113 dead transitions. [2024-06-14 14:52:31,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 113 transitions, 1244 flow [2024-06-14 14:52:31,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:52:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:52:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-14 14:52:31,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33064516129032256 [2024-06-14 14:52:31,103 INFO L175 Difference]: Start difference. First operand has 114 places, 104 transitions, 994 flow. Second operand 8 states and 82 transitions. [2024-06-14 14:52:31,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 113 transitions, 1244 flow [2024-06-14 14:52:31,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 1191 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-14 14:52:31,115 INFO L231 Difference]: Finished difference. Result has 119 places, 104 transitions, 986 flow [2024-06-14 14:52:31,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=986, PETRI_PLACES=119, PETRI_TRANSITIONS=104} [2024-06-14 14:52:31,116 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2024-06-14 14:52:31,116 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 104 transitions, 986 flow [2024-06-14 14:52:31,117 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-14 14:52:31,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:31,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:52:31,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 14:52:31,117 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:52:31,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:31,118 INFO L85 PathProgramCache]: Analyzing trace with hash -419445262, now seen corresponding path program 8 times [2024-06-14 14:52:31,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:31,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095933046] [2024-06-14 14:52:31,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:31,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:52:35,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:35,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095933046] [2024-06-14 14:52:35,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095933046] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:35,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:35,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:52:35,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181838772] [2024-06-14 14:52:35,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:35,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:52:35,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:35,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:52:35,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:52:35,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:52:35,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 104 transitions, 986 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-14 14:52:35,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:35,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:52:35,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:35,893 INFO L124 PetriNetUnfolderBase]: 282/504 cut-off events. [2024-06-14 14:52:35,893 INFO L125 PetriNetUnfolderBase]: For 9551/9551 co-relation queries the response was YES. [2024-06-14 14:52:35,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3095 conditions, 504 events. 282/504 cut-off events. For 9551/9551 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1966 event pairs, 50 based on Foata normal form. 2/505 useless extension candidates. Maximal degree in co-relation 3034. Up to 315 conditions per place. [2024-06-14 14:52:35,897 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 69 selfloop transitions, 52 changer transitions 0/123 dead transitions. [2024-06-14 14:52:35,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 123 transitions, 1386 flow [2024-06-14 14:52:35,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:52:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:52:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-14 14:52:35,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36200716845878134 [2024-06-14 14:52:35,901 INFO L175 Difference]: Start difference. First operand has 119 places, 104 transitions, 986 flow. Second operand 9 states and 101 transitions. [2024-06-14 14:52:35,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 123 transitions, 1386 flow [2024-06-14 14:52:35,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 123 transitions, 1308 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 14:52:35,914 INFO L231 Difference]: Finished difference. Result has 120 places, 108 transitions, 1085 flow [2024-06-14 14:52:35,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1085, PETRI_PLACES=120, PETRI_TRANSITIONS=108} [2024-06-14 14:52:35,915 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 90 predicate places. [2024-06-14 14:52:35,915 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 108 transitions, 1085 flow [2024-06-14 14:52:35,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:52:35,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:35,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:52:35,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 14:52:35,916 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:52:35,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:35,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1237878067, now seen corresponding path program 4 times [2024-06-14 14:52:35,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:35,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45191747] [2024-06-14 14:52:35,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:35,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:40,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:52:40,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:40,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45191747] [2024-06-14 14:52:40,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45191747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:40,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:40,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:52:40,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854789649] [2024-06-14 14:52:40,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:40,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:52:40,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:40,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:52:40,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:52:40,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:52:40,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 108 transitions, 1085 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-14 14:52:40,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:40,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:52:40,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:40,323 INFO L124 PetriNetUnfolderBase]: 283/506 cut-off events. [2024-06-14 14:52:40,324 INFO L125 PetriNetUnfolderBase]: For 10269/10269 co-relation queries the response was YES. [2024-06-14 14:52:40,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3162 conditions, 506 events. 283/506 cut-off events. For 10269/10269 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1998 event pairs, 81 based on Foata normal form. 2/505 useless extension candidates. Maximal degree in co-relation 3101. Up to 461 conditions per place. [2024-06-14 14:52:40,328 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 96 selfloop transitions, 21 changer transitions 0/119 dead transitions. [2024-06-14 14:52:40,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 119 transitions, 1378 flow [2024-06-14 14:52:40,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:52:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:52:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-14 14:52:40,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33064516129032256 [2024-06-14 14:52:40,329 INFO L175 Difference]: Start difference. First operand has 120 places, 108 transitions, 1085 flow. Second operand 8 states and 82 transitions. [2024-06-14 14:52:40,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 119 transitions, 1378 flow [2024-06-14 14:52:40,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 119 transitions, 1302 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-14 14:52:40,343 INFO L231 Difference]: Finished difference. Result has 123 places, 110 transitions, 1087 flow [2024-06-14 14:52:40,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1087, PETRI_PLACES=123, PETRI_TRANSITIONS=110} [2024-06-14 14:52:40,344 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 93 predicate places. [2024-06-14 14:52:40,344 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 110 transitions, 1087 flow [2024-06-14 14:52:40,344 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-14 14:52:40,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:40,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:52:40,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 14:52:40,345 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:52:40,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:40,345 INFO L85 PathProgramCache]: Analyzing trace with hash -411820905, now seen corresponding path program 5 times [2024-06-14 14:52:40,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:40,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793525748] [2024-06-14 14:52:40,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:40,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:52:44,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:44,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793525748] [2024-06-14 14:52:44,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793525748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:44,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:44,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:52:44,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534846603] [2024-06-14 14:52:44,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:44,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:52:44,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:44,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:52:44,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:52:44,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:52:44,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 110 transitions, 1087 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-14 14:52:44,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:44,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:52:44,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:44,825 INFO L124 PetriNetUnfolderBase]: 281/503 cut-off events. [2024-06-14 14:52:44,826 INFO L125 PetriNetUnfolderBase]: For 9947/9947 co-relation queries the response was YES. [2024-06-14 14:52:44,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3136 conditions, 503 events. 281/503 cut-off events. For 9947/9947 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1974 event pairs, 96 based on Foata normal form. 1/503 useless extension candidates. Maximal degree in co-relation 3073. Up to 478 conditions per place. [2024-06-14 14:52:44,829 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 103 selfloop transitions, 13 changer transitions 0/118 dead transitions. [2024-06-14 14:52:44,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 118 transitions, 1343 flow [2024-06-14 14:52:44,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:52:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:52:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2024-06-14 14:52:44,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3185483870967742 [2024-06-14 14:52:44,830 INFO L175 Difference]: Start difference. First operand has 123 places, 110 transitions, 1087 flow. Second operand 8 states and 79 transitions. [2024-06-14 14:52:44,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 118 transitions, 1343 flow [2024-06-14 14:52:44,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 118 transitions, 1263 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-14 14:52:44,843 INFO L231 Difference]: Finished difference. Result has 125 places, 110 transitions, 1038 flow [2024-06-14 14:52:44,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1038, PETRI_PLACES=125, PETRI_TRANSITIONS=110} [2024-06-14 14:52:44,843 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 95 predicate places. [2024-06-14 14:52:44,843 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 110 transitions, 1038 flow [2024-06-14 14:52:44,843 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-14 14:52:44,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:44,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:52:44,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 14:52:44,844 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:52:44,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:44,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1230249587, now seen corresponding path program 1 times [2024-06-14 14:52:44,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:44,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259275654] [2024-06-14 14:52:44,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:44,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:52:48,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:48,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259275654] [2024-06-14 14:52:48,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259275654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:48,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:48,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:52:48,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188861599] [2024-06-14 14:52:48,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:48,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:52:48,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:48,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:52:48,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:52:49,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:52:49,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 110 transitions, 1038 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:52:49,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:49,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:52:49,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:49,332 INFO L124 PetriNetUnfolderBase]: 278/497 cut-off events. [2024-06-14 14:52:49,333 INFO L125 PetriNetUnfolderBase]: For 10143/10143 co-relation queries the response was YES. [2024-06-14 14:52:49,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 497 events. 278/497 cut-off events. For 10143/10143 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1941 event pairs, 95 based on Foata normal form. 2/498 useless extension candidates. Maximal degree in co-relation 2973. Up to 467 conditions per place. [2024-06-14 14:52:49,337 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 104 selfloop transitions, 14 changer transitions 0/120 dead transitions. [2024-06-14 14:52:49,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 120 transitions, 1302 flow [2024-06-14 14:52:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:52:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:52:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2024-06-14 14:52:49,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30824372759856633 [2024-06-14 14:52:49,338 INFO L175 Difference]: Start difference. First operand has 125 places, 110 transitions, 1038 flow. Second operand 9 states and 86 transitions. [2024-06-14 14:52:49,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 120 transitions, 1302 flow [2024-06-14 14:52:49,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 120 transitions, 1271 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 14:52:49,352 INFO L231 Difference]: Finished difference. Result has 127 places, 110 transitions, 1039 flow [2024-06-14 14:52:49,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1039, PETRI_PLACES=127, PETRI_TRANSITIONS=110} [2024-06-14 14:52:49,352 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 97 predicate places. [2024-06-14 14:52:49,353 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 110 transitions, 1039 flow [2024-06-14 14:52:49,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:52:49,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:49,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:52:49,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 14:52:49,353 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:52:49,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:49,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1128295633, now seen corresponding path program 1 times [2024-06-14 14:52:49,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:49,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901205481] [2024-06-14 14:52:49,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:49,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:53,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:52:53,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:53,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901205481] [2024-06-14 14:52:53,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901205481] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:53,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:53,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:52:53,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165474413] [2024-06-14 14:52:53,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:53,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:52:53,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:53,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:52:53,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:52:53,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:52:53,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 110 transitions, 1039 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:52:53,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:53,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:52:53,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:53,522 INFO L124 PetriNetUnfolderBase]: 287/518 cut-off events. [2024-06-14 14:52:53,522 INFO L125 PetriNetUnfolderBase]: For 10968/10968 co-relation queries the response was YES. [2024-06-14 14:52:53,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3138 conditions, 518 events. 287/518 cut-off events. For 10968/10968 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2096 event pairs, 64 based on Foata normal form. 2/519 useless extension candidates. Maximal degree in co-relation 3073. Up to 440 conditions per place. [2024-06-14 14:52:53,526 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 105 selfloop transitions, 23 changer transitions 0/130 dead transitions. [2024-06-14 14:52:53,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 130 transitions, 1372 flow [2024-06-14 14:52:53,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:52:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:52:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 14:52:53,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-14 14:52:53,527 INFO L175 Difference]: Start difference. First operand has 127 places, 110 transitions, 1039 flow. Second operand 9 states and 97 transitions. [2024-06-14 14:52:53,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 130 transitions, 1372 flow [2024-06-14 14:52:53,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 130 transitions, 1338 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 14:52:53,543 INFO L231 Difference]: Finished difference. Result has 131 places, 113 transitions, 1100 flow [2024-06-14 14:52:53,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1100, PETRI_PLACES=131, PETRI_TRANSITIONS=113} [2024-06-14 14:52:53,543 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 101 predicate places. [2024-06-14 14:52:53,543 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 113 transitions, 1100 flow [2024-06-14 14:52:53,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:52:53,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:53,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:52:53,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 14:52:53,544 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:52:53,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1693774289, now seen corresponding path program 1 times [2024-06-14 14:52:53,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:53,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159223889] [2024-06-14 14:52:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:53,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:52:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:52:58,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:52:58,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159223889] [2024-06-14 14:52:58,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159223889] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:52:58,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:52:58,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:52:58,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046352046] [2024-06-14 14:52:58,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:52:58,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:52:58,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:52:58,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:52:58,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:52:58,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:52:58,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 113 transitions, 1100 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:52:58,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:52:58,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:52:58,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:52:58,571 INFO L124 PetriNetUnfolderBase]: 299/538 cut-off events. [2024-06-14 14:52:58,571 INFO L125 PetriNetUnfolderBase]: For 11360/11360 co-relation queries the response was YES. [2024-06-14 14:52:58,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3319 conditions, 538 events. 299/538 cut-off events. For 11360/11360 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2214 event pairs, 64 based on Foata normal form. 1/538 useless extension candidates. Maximal degree in co-relation 3251. Up to 458 conditions per place. [2024-06-14 14:52:58,576 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 104 selfloop transitions, 29 changer transitions 0/135 dead transitions. [2024-06-14 14:52:58,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 135 transitions, 1485 flow [2024-06-14 14:52:58,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:52:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:52:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 14:52:58,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-14 14:52:58,577 INFO L175 Difference]: Start difference. First operand has 131 places, 113 transitions, 1100 flow. Second operand 9 states and 98 transitions. [2024-06-14 14:52:58,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 135 transitions, 1485 flow [2024-06-14 14:52:58,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 135 transitions, 1435 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-14 14:52:58,596 INFO L231 Difference]: Finished difference. Result has 136 places, 119 transitions, 1202 flow [2024-06-14 14:52:58,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1202, PETRI_PLACES=136, PETRI_TRANSITIONS=119} [2024-06-14 14:52:58,597 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 106 predicate places. [2024-06-14 14:52:58,597 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 119 transitions, 1202 flow [2024-06-14 14:52:58,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:52:58,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:52:58,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:52:58,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 14:52:58,597 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:52:58,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:52:58,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1118049823, now seen corresponding path program 2 times [2024-06-14 14:52:58,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:52:58,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128921115] [2024-06-14 14:52:58,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:52:58,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:52:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:53:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:53:02,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:53:02,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128921115] [2024-06-14 14:53:02,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128921115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:53:02,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:53:02,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:53:02,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960136950] [2024-06-14 14:53:02,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:53:02,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:53:02,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:53:02,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:53:02,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:53:02,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:53:02,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 119 transitions, 1202 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:02,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:53:02,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:53:02,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:53:03,132 INFO L124 PetriNetUnfolderBase]: 303/546 cut-off events. [2024-06-14 14:53:03,133 INFO L125 PetriNetUnfolderBase]: For 12836/12836 co-relation queries the response was YES. [2024-06-14 14:53:03,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3415 conditions, 546 events. 303/546 cut-off events. For 12836/12836 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2258 event pairs, 69 based on Foata normal form. 2/547 useless extension candidates. Maximal degree in co-relation 3346. Up to 469 conditions per place. [2024-06-14 14:53:03,136 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 108 selfloop transitions, 26 changer transitions 0/136 dead transitions. [2024-06-14 14:53:03,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 136 transitions, 1535 flow [2024-06-14 14:53:03,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:53:03,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:53:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 14:53:03,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-14 14:53:03,138 INFO L175 Difference]: Start difference. First operand has 136 places, 119 transitions, 1202 flow. Second operand 9 states and 97 transitions. [2024-06-14 14:53:03,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 136 transitions, 1535 flow [2024-06-14 14:53:03,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 136 transitions, 1447 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-14 14:53:03,158 INFO L231 Difference]: Finished difference. Result has 137 places, 120 transitions, 1189 flow [2024-06-14 14:53:03,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1189, PETRI_PLACES=137, PETRI_TRANSITIONS=120} [2024-06-14 14:53:03,159 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 107 predicate places. [2024-06-14 14:53:03,159 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 120 transitions, 1189 flow [2024-06-14 14:53:03,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:03,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:53:03,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:53:03,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 14:53:03,159 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:53:03,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:53:03,159 INFO L85 PathProgramCache]: Analyzing trace with hash -541078773, now seen corresponding path program 3 times [2024-06-14 14:53:03,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:53:03,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531668756] [2024-06-14 14:53:03,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:53:03,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:53:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:53:07,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-14 14:53:07,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:53:07,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531668756] [2024-06-14 14:53:07,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531668756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:53:07,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:53:07,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:53:07,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659440119] [2024-06-14 14:53:07,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:53:07,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:53:07,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:53:07,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:53:07,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:53:07,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:53:07,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 120 transitions, 1189 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:07,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:53:07,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:53:07,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:53:07,361 INFO L124 PetriNetUnfolderBase]: 312/565 cut-off events. [2024-06-14 14:53:07,361 INFO L125 PetriNetUnfolderBase]: For 13728/13728 co-relation queries the response was YES. [2024-06-14 14:53:07,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3480 conditions, 565 events. 312/565 cut-off events. For 13728/13728 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2380 event pairs, 52 based on Foata normal form. 2/566 useless extension candidates. Maximal degree in co-relation 3412. Up to 459 conditions per place. [2024-06-14 14:53:07,365 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 111 selfloop transitions, 25 changer transitions 0/138 dead transitions. [2024-06-14 14:53:07,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 138 transitions, 1525 flow [2024-06-14 14:53:07,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:53:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:53:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-14 14:53:07,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33691756272401435 [2024-06-14 14:53:07,366 INFO L175 Difference]: Start difference. First operand has 137 places, 120 transitions, 1189 flow. Second operand 9 states and 94 transitions. [2024-06-14 14:53:07,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 138 transitions, 1525 flow [2024-06-14 14:53:07,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 138 transitions, 1462 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 14:53:07,389 INFO L231 Difference]: Finished difference. Result has 139 places, 122 transitions, 1206 flow [2024-06-14 14:53:07,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1206, PETRI_PLACES=139, PETRI_TRANSITIONS=122} [2024-06-14 14:53:07,389 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2024-06-14 14:53:07,389 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 122 transitions, 1206 flow [2024-06-14 14:53:07,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:07,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:53:07,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:53:07,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 14:53:07,389 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:53:07,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:53:07,390 INFO L85 PathProgramCache]: Analyzing trace with hash -81736695, now seen corresponding path program 1 times [2024-06-14 14:53:07,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:53:07,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29541663] [2024-06-14 14:53:07,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:53:07,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:53:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:53:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:53:11,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:53:11,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29541663] [2024-06-14 14:53:11,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29541663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:53:11,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:53:11,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:53:11,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242214086] [2024-06-14 14:53:11,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:53:11,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:53:11,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:53:11,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:53:11,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:53:11,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:53:11,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 122 transitions, 1206 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:11,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:53:11,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:53:11,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:53:12,155 INFO L124 PetriNetUnfolderBase]: 318/576 cut-off events. [2024-06-14 14:53:12,156 INFO L125 PetriNetUnfolderBase]: For 14528/14528 co-relation queries the response was YES. [2024-06-14 14:53:12,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3544 conditions, 576 events. 318/576 cut-off events. For 14528/14528 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2454 event pairs, 53 based on Foata normal form. 2/577 useless extension candidates. Maximal degree in co-relation 3475. Up to 493 conditions per place. [2024-06-14 14:53:12,159 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 110 selfloop transitions, 31 changer transitions 0/143 dead transitions. [2024-06-14 14:53:12,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 143 transitions, 1580 flow [2024-06-14 14:53:12,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:53:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:53:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 14:53:12,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-14 14:53:12,161 INFO L175 Difference]: Start difference. First operand has 139 places, 122 transitions, 1206 flow. Second operand 10 states and 106 transitions. [2024-06-14 14:53:12,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 143 transitions, 1580 flow [2024-06-14 14:53:12,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 143 transitions, 1506 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 14:53:12,183 INFO L231 Difference]: Finished difference. Result has 143 places, 126 transitions, 1258 flow [2024-06-14 14:53:12,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1258, PETRI_PLACES=143, PETRI_TRANSITIONS=126} [2024-06-14 14:53:12,184 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 113 predicate places. [2024-06-14 14:53:12,184 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 126 transitions, 1258 flow [2024-06-14 14:53:12,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:12,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:53:12,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:53:12,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 14:53:12,185 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:53:12,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:53:12,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1729116271, now seen corresponding path program 4 times [2024-06-14 14:53:12,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:53:12,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120412829] [2024-06-14 14:53:12,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:53:12,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:53:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:53:16,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-14 14:53:16,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:53:16,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120412829] [2024-06-14 14:53:16,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120412829] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:53:16,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:53:16,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:53:16,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903835689] [2024-06-14 14:53:16,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:53:16,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:53:16,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:53:16,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:53:16,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:53:16,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:53:16,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 126 transitions, 1258 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:16,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:53:16,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:53:16,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:53:16,590 INFO L124 PetriNetUnfolderBase]: 327/594 cut-off events. [2024-06-14 14:53:16,591 INFO L125 PetriNetUnfolderBase]: For 15292/15292 co-relation queries the response was YES. [2024-06-14 14:53:16,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3670 conditions, 594 events. 327/594 cut-off events. For 15292/15292 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2576 event pairs, 51 based on Foata normal form. 2/595 useless extension candidates. Maximal degree in co-relation 3600. Up to 516 conditions per place. [2024-06-14 14:53:16,595 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 118 selfloop transitions, 23 changer transitions 0/143 dead transitions. [2024-06-14 14:53:16,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 143 transitions, 1606 flow [2024-06-14 14:53:16,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:53:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:53:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 14:53:16,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-14 14:53:16,606 INFO L175 Difference]: Start difference. First operand has 143 places, 126 transitions, 1258 flow. Second operand 9 states and 98 transitions. [2024-06-14 14:53:16,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 143 transitions, 1606 flow [2024-06-14 14:53:16,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 143 transitions, 1520 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 14:53:16,631 INFO L231 Difference]: Finished difference. Result has 147 places, 128 transitions, 1254 flow [2024-06-14 14:53:16,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1172, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1254, PETRI_PLACES=147, PETRI_TRANSITIONS=128} [2024-06-14 14:53:16,632 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places. [2024-06-14 14:53:16,633 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 128 transitions, 1254 flow [2024-06-14 14:53:16,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:16,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:53:16,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:53:16,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 14:53:16,633 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:53:16,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:53:16,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1136424781, now seen corresponding path program 5 times [2024-06-14 14:53:16,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:53:16,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746875653] [2024-06-14 14:53:16,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:53:16,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:53:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:53:20,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-14 14:53:20,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:53:20,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746875653] [2024-06-14 14:53:20,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746875653] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:53:20,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:53:20,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:53:20,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204972823] [2024-06-14 14:53:20,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:53:20,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:53:20,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:53:20,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:53:20,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:53:20,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:53:20,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 128 transitions, 1254 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:20,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:53:20,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:53:20,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:53:21,129 INFO L124 PetriNetUnfolderBase]: 334/607 cut-off events. [2024-06-14 14:53:21,129 INFO L125 PetriNetUnfolderBase]: For 16471/16471 co-relation queries the response was YES. [2024-06-14 14:53:21,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3745 conditions, 607 events. 334/607 cut-off events. For 16471/16471 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2677 event pairs, 84 based on Foata normal form. 2/608 useless extension candidates. Maximal degree in co-relation 3673. Up to 555 conditions per place. [2024-06-14 14:53:21,134 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 124 selfloop transitions, 19 changer transitions 0/145 dead transitions. [2024-06-14 14:53:21,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 145 transitions, 1620 flow [2024-06-14 14:53:21,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:53:21,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:53:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-14 14:53:21,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33691756272401435 [2024-06-14 14:53:21,137 INFO L175 Difference]: Start difference. First operand has 147 places, 128 transitions, 1254 flow. Second operand 9 states and 94 transitions. [2024-06-14 14:53:21,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 145 transitions, 1620 flow [2024-06-14 14:53:21,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 145 transitions, 1568 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-14 14:53:21,166 INFO L231 Difference]: Finished difference. Result has 152 places, 131 transitions, 1299 flow [2024-06-14 14:53:21,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1299, PETRI_PLACES=152, PETRI_TRANSITIONS=131} [2024-06-14 14:53:21,167 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 122 predicate places. [2024-06-14 14:53:21,167 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 131 transitions, 1299 flow [2024-06-14 14:53:21,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:21,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:53:21,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:53:21,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 14:53:21,168 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:53:21,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:53:21,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1136424657, now seen corresponding path program 2 times [2024-06-14 14:53:21,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:53:21,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181883420] [2024-06-14 14:53:21,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:53:21,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:53:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:53:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:53:25,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:53:25,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181883420] [2024-06-14 14:53:25,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181883420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:53:25,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:53:25,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:53:25,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045312662] [2024-06-14 14:53:25,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:53:25,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:53:25,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:53:25,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:53:25,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:53:25,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:53:25,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 131 transitions, 1299 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:25,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:53:25,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:53:25,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:53:26,001 INFO L124 PetriNetUnfolderBase]: 337/612 cut-off events. [2024-06-14 14:53:26,001 INFO L125 PetriNetUnfolderBase]: For 16710/16710 co-relation queries the response was YES. [2024-06-14 14:53:26,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3806 conditions, 612 events. 337/612 cut-off events. For 16710/16710 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2707 event pairs, 51 based on Foata normal form. 1/612 useless extension candidates. Maximal degree in co-relation 3732. Up to 532 conditions per place. [2024-06-14 14:53:26,006 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 116 selfloop transitions, 29 changer transitions 0/147 dead transitions. [2024-06-14 14:53:26,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 147 transitions, 1669 flow [2024-06-14 14:53:26,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:53:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:53:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-14 14:53:26,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-14 14:53:26,007 INFO L175 Difference]: Start difference. First operand has 152 places, 131 transitions, 1299 flow. Second operand 9 states and 99 transitions. [2024-06-14 14:53:26,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 147 transitions, 1669 flow [2024-06-14 14:53:26,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 147 transitions, 1616 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-14 14:53:26,038 INFO L231 Difference]: Finished difference. Result has 155 places, 133 transitions, 1356 flow [2024-06-14 14:53:26,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1356, PETRI_PLACES=155, PETRI_TRANSITIONS=133} [2024-06-14 14:53:26,039 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 125 predicate places. [2024-06-14 14:53:26,039 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 133 transitions, 1356 flow [2024-06-14 14:53:26,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:26,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:53:26,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:53:26,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 14:53:26,040 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:53:26,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:53:26,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1133623311, now seen corresponding path program 2 times [2024-06-14 14:53:26,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:53:26,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486340542] [2024-06-14 14:53:26,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:53:26,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:53:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:53:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:53:29,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:53:29,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486340542] [2024-06-14 14:53:29,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486340542] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:53:29,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:53:29,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:53:29,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115217197] [2024-06-14 14:53:29,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:53:29,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:53:29,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:53:29,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:53:29,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:53:30,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:53:30,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 133 transitions, 1356 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:30,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:53:30,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:53:30,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:53:30,278 INFO L124 PetriNetUnfolderBase]: 343/623 cut-off events. [2024-06-14 14:53:30,279 INFO L125 PetriNetUnfolderBase]: For 18213/18213 co-relation queries the response was YES. [2024-06-14 14:53:30,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3887 conditions, 623 events. 343/623 cut-off events. For 18213/18213 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2768 event pairs, 53 based on Foata normal form. 2/624 useless extension candidates. Maximal degree in co-relation 3812. Up to 540 conditions per place. [2024-06-14 14:53:30,283 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 121 selfloop transitions, 28 changer transitions 0/151 dead transitions. [2024-06-14 14:53:30,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 151 transitions, 1730 flow [2024-06-14 14:53:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:53:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:53:30,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 14:53:30,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-14 14:53:30,285 INFO L175 Difference]: Start difference. First operand has 155 places, 133 transitions, 1356 flow. Second operand 10 states and 107 transitions. [2024-06-14 14:53:30,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 151 transitions, 1730 flow [2024-06-14 14:53:30,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 151 transitions, 1639 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-14 14:53:30,314 INFO L231 Difference]: Finished difference. Result has 157 places, 135 transitions, 1360 flow [2024-06-14 14:53:30,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1265, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1360, PETRI_PLACES=157, PETRI_TRANSITIONS=135} [2024-06-14 14:53:30,314 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 127 predicate places. [2024-06-14 14:53:30,315 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 135 transitions, 1360 flow [2024-06-14 14:53:30,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:30,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:53:30,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:53:30,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 14:53:30,315 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:53:30,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:53:30,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1018159161, now seen corresponding path program 3 times [2024-06-14 14:53:30,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:53:30,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621868546] [2024-06-14 14:53:30,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:53:30,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:53:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:53:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:53:33,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:53:33,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621868546] [2024-06-14 14:53:33,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621868546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:53:33,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:53:33,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:53:33,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686228930] [2024-06-14 14:53:33,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:53:33,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:53:33,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:53:33,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:53:33,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:53:34,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:53:34,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 135 transitions, 1360 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:34,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:53:34,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:53:34,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:53:34,320 INFO L124 PetriNetUnfolderBase]: 382/685 cut-off events. [2024-06-14 14:53:34,320 INFO L125 PetriNetUnfolderBase]: For 23303/23303 co-relation queries the response was YES. [2024-06-14 14:53:34,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4464 conditions, 685 events. 382/685 cut-off events. For 23303/23303 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3068 event pairs, 90 based on Foata normal form. 2/686 useless extension candidates. Maximal degree in co-relation 4389. Up to 599 conditions per place. [2024-06-14 14:53:34,325 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 133 selfloop transitions, 26 changer transitions 0/161 dead transitions. [2024-06-14 14:53:34,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 161 transitions, 1990 flow [2024-06-14 14:53:34,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:53:34,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:53:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 14:53:34,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646 [2024-06-14 14:53:34,327 INFO L175 Difference]: Start difference. First operand has 157 places, 135 transitions, 1360 flow. Second operand 10 states and 109 transitions. [2024-06-14 14:53:34,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 161 transitions, 1990 flow [2024-06-14 14:53:34,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 161 transitions, 1905 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 14:53:34,366 INFO L231 Difference]: Finished difference. Result has 160 places, 144 transitions, 1469 flow [2024-06-14 14:53:34,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1469, PETRI_PLACES=160, PETRI_TRANSITIONS=144} [2024-06-14 14:53:34,367 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 130 predicate places. [2024-06-14 14:53:34,367 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 144 transitions, 1469 flow [2024-06-14 14:53:34,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:34,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:53:34,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:53:34,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 14:53:34,368 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:53:34,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:53:34,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1018152651, now seen corresponding path program 4 times [2024-06-14 14:53:34,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:53:34,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072403090] [2024-06-14 14:53:34,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:53:34,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:53:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:53:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:53:38,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:53:38,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072403090] [2024-06-14 14:53:38,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072403090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:53:38,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:53:38,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:53:38,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534816243] [2024-06-14 14:53:38,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:53:38,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:53:38,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:53:38,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:53:38,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:53:38,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:53:38,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 144 transitions, 1469 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:38,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:53:38,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:53:38,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:53:38,637 INFO L124 PetriNetUnfolderBase]: 374/673 cut-off events. [2024-06-14 14:53:38,638 INFO L125 PetriNetUnfolderBase]: For 23042/23042 co-relation queries the response was YES. [2024-06-14 14:53:38,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4314 conditions, 673 events. 374/673 cut-off events. For 23042/23042 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3023 event pairs, 88 based on Foata normal form. 4/676 useless extension candidates. Maximal degree in co-relation 4237. Up to 595 conditions per place. [2024-06-14 14:53:38,642 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 133 selfloop transitions, 25 changer transitions 0/160 dead transitions. [2024-06-14 14:53:38,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 160 transitions, 1905 flow [2024-06-14 14:53:38,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:53:38,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:53:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 14:53:38,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-14 14:53:38,643 INFO L175 Difference]: Start difference. First operand has 160 places, 144 transitions, 1469 flow. Second operand 10 states and 107 transitions. [2024-06-14 14:53:38,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 160 transitions, 1905 flow [2024-06-14 14:53:38,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 160 transitions, 1823 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-06-14 14:53:38,685 INFO L231 Difference]: Finished difference. Result has 165 places, 144 transitions, 1444 flow [2024-06-14 14:53:38,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1444, PETRI_PLACES=165, PETRI_TRANSITIONS=144} [2024-06-14 14:53:38,685 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places. [2024-06-14 14:53:38,686 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 144 transitions, 1444 flow [2024-06-14 14:53:38,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:38,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:53:38,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:53:38,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 14:53:38,686 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:53:38,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:53:38,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1018337101, now seen corresponding path program 6 times [2024-06-14 14:53:38,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:53:38,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928733392] [2024-06-14 14:53:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:53:38,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:53:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:53:42,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:53:42,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:53:42,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928733392] [2024-06-14 14:53:42,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928733392] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:53:42,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:53:42,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:53:42,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938604403] [2024-06-14 14:53:42,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:53:42,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:53:42,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:53:42,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:53:42,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:53:42,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:53:42,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 144 transitions, 1444 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:42,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:53:42,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:53:42,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:53:42,602 INFO L124 PetriNetUnfolderBase]: 384/691 cut-off events. [2024-06-14 14:53:42,602 INFO L125 PetriNetUnfolderBase]: For 22919/22919 co-relation queries the response was YES. [2024-06-14 14:53:42,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4400 conditions, 691 events. 384/691 cut-off events. For 22919/22919 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3137 event pairs, 91 based on Foata normal form. 2/692 useless extension candidates. Maximal degree in co-relation 4321. Up to 632 conditions per place. [2024-06-14 14:53:42,607 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 138 selfloop transitions, 23 changer transitions 0/163 dead transitions. [2024-06-14 14:53:42,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 163 transitions, 1848 flow [2024-06-14 14:53:42,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:53:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:53:42,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2024-06-14 14:53:42,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33548387096774196 [2024-06-14 14:53:42,608 INFO L175 Difference]: Start difference. First operand has 165 places, 144 transitions, 1444 flow. Second operand 10 states and 104 transitions. [2024-06-14 14:53:42,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 163 transitions, 1848 flow [2024-06-14 14:53:42,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 163 transitions, 1798 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-14 14:53:42,649 INFO L231 Difference]: Finished difference. Result has 168 places, 147 transitions, 1491 flow [2024-06-14 14:53:42,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1394, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1491, PETRI_PLACES=168, PETRI_TRANSITIONS=147} [2024-06-14 14:53:42,650 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 138 predicate places. [2024-06-14 14:53:42,650 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 147 transitions, 1491 flow [2024-06-14 14:53:42,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:42,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:53:42,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:53:42,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 14:53:42,650 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:53:42,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:53:42,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1793500217, now seen corresponding path program 5 times [2024-06-14 14:53:42,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:53:42,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566017109] [2024-06-14 14:53:42,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:53:42,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:53:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:53:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:53:47,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:53:47,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566017109] [2024-06-14 14:53:47,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566017109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:53:47,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:53:47,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:53:47,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371802024] [2024-06-14 14:53:47,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:53:47,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:53:47,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:53:47,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:53:47,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:53:47,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:53:47,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 147 transitions, 1491 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:47,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:53:47,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:53:47,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:53:47,569 INFO L124 PetriNetUnfolderBase]: 411/736 cut-off events. [2024-06-14 14:53:47,569 INFO L125 PetriNetUnfolderBase]: For 26325/26325 co-relation queries the response was YES. [2024-06-14 14:53:47,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4819 conditions, 736 events. 411/736 cut-off events. For 26325/26325 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3367 event pairs, 65 based on Foata normal form. 2/737 useless extension candidates. Maximal degree in co-relation 4738. Up to 516 conditions per place. [2024-06-14 14:53:47,573 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 118 selfloop transitions, 51 changer transitions 0/171 dead transitions. [2024-06-14 14:53:47,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 171 transitions, 2055 flow [2024-06-14 14:53:47,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:53:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:53:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 14:53:47,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-14 14:53:47,574 INFO L175 Difference]: Start difference. First operand has 168 places, 147 transitions, 1491 flow. Second operand 10 states and 115 transitions. [2024-06-14 14:53:47,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 171 transitions, 2055 flow [2024-06-14 14:53:47,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 171 transitions, 1992 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 14:53:47,619 INFO L231 Difference]: Finished difference. Result has 173 places, 153 transitions, 1659 flow [2024-06-14 14:53:47,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1659, PETRI_PLACES=173, PETRI_TRANSITIONS=153} [2024-06-14 14:53:47,619 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 143 predicate places. [2024-06-14 14:53:47,619 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 153 transitions, 1659 flow [2024-06-14 14:53:47,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:47,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:53:47,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:53:47,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 14:53:47,620 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:53:47,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:53:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash 720903653, now seen corresponding path program 7 times [2024-06-14 14:53:47,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:53:47,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454860774] [2024-06-14 14:53:47,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:53:47,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:53:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:53:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:53:51,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:53:51,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454860774] [2024-06-14 14:53:51,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454860774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:53:51,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:53:51,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:53:51,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010771442] [2024-06-14 14:53:51,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:53:51,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:53:51,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:53:51,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:53:51,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:53:51,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:53:51,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 153 transitions, 1659 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:51,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:53:51,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:53:51,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:53:51,649 INFO L124 PetriNetUnfolderBase]: 415/743 cut-off events. [2024-06-14 14:53:51,649 INFO L125 PetriNetUnfolderBase]: For 27813/27813 co-relation queries the response was YES. [2024-06-14 14:53:51,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5060 conditions, 743 events. 415/743 cut-off events. For 27813/27813 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3408 event pairs, 101 based on Foata normal form. 2/743 useless extension candidates. Maximal degree in co-relation 4976. Up to 680 conditions per place. [2024-06-14 14:53:51,656 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 147 selfloop transitions, 19 changer transitions 0/168 dead transitions. [2024-06-14 14:53:51,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 168 transitions, 2055 flow [2024-06-14 14:53:51,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:53:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:53:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2024-06-14 14:53:51,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3258064516129032 [2024-06-14 14:53:51,658 INFO L175 Difference]: Start difference. First operand has 173 places, 153 transitions, 1659 flow. Second operand 10 states and 101 transitions. [2024-06-14 14:53:51,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 168 transitions, 2055 flow [2024-06-14 14:53:51,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 168 transitions, 1983 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-14 14:53:51,716 INFO L231 Difference]: Finished difference. Result has 178 places, 154 transitions, 1657 flow [2024-06-14 14:53:51,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1657, PETRI_PLACES=178, PETRI_TRANSITIONS=154} [2024-06-14 14:53:51,717 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 148 predicate places. [2024-06-14 14:53:51,717 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 154 transitions, 1657 flow [2024-06-14 14:53:51,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:51,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:53:51,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:53:51,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 14:53:51,718 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:53:51,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:53:51,718 INFO L85 PathProgramCache]: Analyzing trace with hash 720964103, now seen corresponding path program 8 times [2024-06-14 14:53:51,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:53:51,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666380858] [2024-06-14 14:53:51,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:53:51,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:53:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:53:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:53:56,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:53:56,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666380858] [2024-06-14 14:53:56,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666380858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:53:56,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:53:56,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:53:56,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993039086] [2024-06-14 14:53:56,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:53:56,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:53:56,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:53:56,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:53:56,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:53:56,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:53:56,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 154 transitions, 1657 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:56,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:53:56,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:53:56,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:53:56,581 INFO L124 PetriNetUnfolderBase]: 419/751 cut-off events. [2024-06-14 14:53:56,581 INFO L125 PetriNetUnfolderBase]: For 29185/29185 co-relation queries the response was YES. [2024-06-14 14:53:56,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5148 conditions, 751 events. 419/751 cut-off events. For 29185/29185 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3462 event pairs, 81 based on Foata normal form. 2/752 useless extension candidates. Maximal degree in co-relation 5062. Up to 640 conditions per place. [2024-06-14 14:53:56,587 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 131 selfloop transitions, 35 changer transitions 0/168 dead transitions. [2024-06-14 14:53:56,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 168 transitions, 2051 flow [2024-06-14 14:53:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:53:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:53:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-14 14:53:56,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2024-06-14 14:53:56,588 INFO L175 Difference]: Start difference. First operand has 178 places, 154 transitions, 1657 flow. Second operand 8 states and 87 transitions. [2024-06-14 14:53:56,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 168 transitions, 2051 flow [2024-06-14 14:53:56,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 168 transitions, 1955 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-14 14:53:56,646 INFO L231 Difference]: Finished difference. Result has 177 places, 155 transitions, 1672 flow [2024-06-14 14:53:56,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1672, PETRI_PLACES=177, PETRI_TRANSITIONS=155} [2024-06-14 14:53:56,646 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 147 predicate places. [2024-06-14 14:53:56,647 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 155 transitions, 1672 flow [2024-06-14 14:53:56,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:53:56,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:53:56,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:53:56,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 14:53:56,647 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:53:56,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:53:56,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1737515447, now seen corresponding path program 3 times [2024-06-14 14:53:56,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:53:56,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613034989] [2024-06-14 14:53:56,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:53:56,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:53:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:54:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:54:01,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:54:01,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613034989] [2024-06-14 14:54:01,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613034989] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:54:01,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:54:01,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:54:01,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130209916] [2024-06-14 14:54:01,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:54:01,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:54:01,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:54:01,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:54:01,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:54:01,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:54:01,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 155 transitions, 1672 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:01,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:54:01,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:54:01,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:54:01,987 INFO L124 PetriNetUnfolderBase]: 417/748 cut-off events. [2024-06-14 14:54:01,987 INFO L125 PetriNetUnfolderBase]: For 28525/28525 co-relation queries the response was YES. [2024-06-14 14:54:01,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5058 conditions, 748 events. 417/748 cut-off events. For 28525/28525 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3460 event pairs, 78 based on Foata normal form. 1/748 useless extension candidates. Maximal degree in co-relation 4975. Up to 628 conditions per place. [2024-06-14 14:54:01,992 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 122 selfloop transitions, 44 changer transitions 0/168 dead transitions. [2024-06-14 14:54:01,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 168 transitions, 2040 flow [2024-06-14 14:54:01,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:54:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:54:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-14 14:54:01,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-14 14:54:01,993 INFO L175 Difference]: Start difference. First operand has 177 places, 155 transitions, 1672 flow. Second operand 8 states and 88 transitions. [2024-06-14 14:54:01,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 168 transitions, 2040 flow [2024-06-14 14:54:02,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 168 transitions, 1943 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-14 14:54:02,050 INFO L231 Difference]: Finished difference. Result has 179 places, 155 transitions, 1683 flow [2024-06-14 14:54:02,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1683, PETRI_PLACES=179, PETRI_TRANSITIONS=155} [2024-06-14 14:54:02,050 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2024-06-14 14:54:02,050 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 155 transitions, 1683 flow [2024-06-14 14:54:02,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:02,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:54:02,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:54:02,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 14:54:02,051 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:54:02,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:54:02,051 INFO L85 PathProgramCache]: Analyzing trace with hash 723765573, now seen corresponding path program 6 times [2024-06-14 14:54:02,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:54:02,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952278094] [2024-06-14 14:54:02,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:54:02,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:54:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:54:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:54:06,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:54:06,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952278094] [2024-06-14 14:54:06,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952278094] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:54:06,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:54:06,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:54:06,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836005629] [2024-06-14 14:54:06,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:54:06,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:54:06,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:54:06,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:54:06,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:54:06,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:54:06,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 155 transitions, 1683 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:06,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:54:06,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:54:06,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:54:06,523 INFO L124 PetriNetUnfolderBase]: 423/759 cut-off events. [2024-06-14 14:54:06,523 INFO L125 PetriNetUnfolderBase]: For 27876/27876 co-relation queries the response was YES. [2024-06-14 14:54:06,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5104 conditions, 759 events. 423/759 cut-off events. For 27876/27876 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3505 event pairs, 61 based on Foata normal form. 2/760 useless extension candidates. Maximal degree in co-relation 5020. Up to 632 conditions per place. [2024-06-14 14:54:06,528 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 128 selfloop transitions, 42 changer transitions 0/172 dead transitions. [2024-06-14 14:54:06,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 172 transitions, 2107 flow [2024-06-14 14:54:06,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:54:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:54:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 14:54:06,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-14 14:54:06,529 INFO L175 Difference]: Start difference. First operand has 179 places, 155 transitions, 1683 flow. Second operand 9 states and 97 transitions. [2024-06-14 14:54:06,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 172 transitions, 2107 flow [2024-06-14 14:54:06,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 172 transitions, 1953 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 14:54:06,579 INFO L231 Difference]: Finished difference. Result has 180 places, 157 transitions, 1670 flow [2024-06-14 14:54:06,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1529, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1670, PETRI_PLACES=180, PETRI_TRANSITIONS=157} [2024-06-14 14:54:06,579 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 150 predicate places. [2024-06-14 14:54:06,579 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 157 transitions, 1670 flow [2024-06-14 14:54:06,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:06,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:54:06,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:54:06,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 14:54:06,580 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:54:06,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:54:06,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1855603003, now seen corresponding path program 9 times [2024-06-14 14:54:06,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:54:06,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317027395] [2024-06-14 14:54:06,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:54:06,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:54:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:54:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:54:10,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:54:10,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317027395] [2024-06-14 14:54:10,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317027395] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:54:10,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:54:10,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:54:10,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57387898] [2024-06-14 14:54:10,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:54:10,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:54:10,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:54:10,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:54:10,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:54:10,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:54:10,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 157 transitions, 1670 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:10,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:54:10,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:54:10,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:54:10,988 INFO L124 PetriNetUnfolderBase]: 427/766 cut-off events. [2024-06-14 14:54:10,988 INFO L125 PetriNetUnfolderBase]: For 27012/27012 co-relation queries the response was YES. [2024-06-14 14:54:10,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5123 conditions, 766 events. 427/766 cut-off events. For 27012/27012 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3567 event pairs, 74 based on Foata normal form. 2/767 useless extension candidates. Maximal degree in co-relation 5039. Up to 649 conditions per place. [2024-06-14 14:54:10,995 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 129 selfloop transitions, 42 changer transitions 0/173 dead transitions. [2024-06-14 14:54:10,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 173 transitions, 2078 flow [2024-06-14 14:54:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:54:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:54:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 14:54:10,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-14 14:54:10,996 INFO L175 Difference]: Start difference. First operand has 180 places, 157 transitions, 1670 flow. Second operand 9 states and 97 transitions. [2024-06-14 14:54:10,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 173 transitions, 2078 flow [2024-06-14 14:54:11,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 173 transitions, 1975 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 14:54:11,049 INFO L231 Difference]: Finished difference. Result has 182 places, 158 transitions, 1685 flow [2024-06-14 14:54:11,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1685, PETRI_PLACES=182, PETRI_TRANSITIONS=158} [2024-06-14 14:54:11,049 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 152 predicate places. [2024-06-14 14:54:11,049 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 158 transitions, 1685 flow [2024-06-14 14:54:11,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:11,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:54:11,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:54:11,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 14:54:11,050 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:54:11,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:54:11,050 INFO L85 PathProgramCache]: Analyzing trace with hash 839056743, now seen corresponding path program 7 times [2024-06-14 14:54:11,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:54:11,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577018758] [2024-06-14 14:54:11,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:54:11,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:54:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:54:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:54:15,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:54:15,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577018758] [2024-06-14 14:54:15,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577018758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:54:15,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:54:15,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:54:15,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869636632] [2024-06-14 14:54:15,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:54:15,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:54:15,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:54:15,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:54:15,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:54:15,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:54:15,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 158 transitions, 1685 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:15,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:54:15,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:54:15,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:54:15,706 INFO L124 PetriNetUnfolderBase]: 468/833 cut-off events. [2024-06-14 14:54:15,706 INFO L125 PetriNetUnfolderBase]: For 35123/35123 co-relation queries the response was YES. [2024-06-14 14:54:15,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5917 conditions, 833 events. 468/833 cut-off events. For 35123/35123 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3921 event pairs, 73 based on Foata normal form. 2/834 useless extension candidates. Maximal degree in co-relation 5832. Up to 495 conditions per place. [2024-06-14 14:54:15,713 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 111 selfloop transitions, 70 changer transitions 0/183 dead transitions. [2024-06-14 14:54:15,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 183 transitions, 2430 flow [2024-06-14 14:54:15,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:54:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:54:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-14 14:54:15,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-14 14:54:15,714 INFO L175 Difference]: Start difference. First operand has 182 places, 158 transitions, 1685 flow. Second operand 9 states and 105 transitions. [2024-06-14 14:54:15,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 183 transitions, 2430 flow [2024-06-14 14:54:15,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 183 transitions, 2320 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 14:54:15,771 INFO L231 Difference]: Finished difference. Result has 185 places, 165 transitions, 1901 flow [2024-06-14 14:54:15,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1901, PETRI_PLACES=185, PETRI_TRANSITIONS=165} [2024-06-14 14:54:15,772 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 155 predicate places. [2024-06-14 14:54:15,772 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 165 transitions, 1901 flow [2024-06-14 14:54:15,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:15,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:54:15,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:54:15,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 14:54:15,773 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:54:15,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:54:15,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2001108975, now seen corresponding path program 8 times [2024-06-14 14:54:15,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:54:15,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493547037] [2024-06-14 14:54:15,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:54:15,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:54:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:54:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:54:19,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:54:19,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493547037] [2024-06-14 14:54:19,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493547037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:54:19,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:54:19,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:54:19,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363085821] [2024-06-14 14:54:19,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:54:19,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:54:19,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:54:19,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:54:19,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:54:19,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:54:19,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 165 transitions, 1901 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:19,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:54:19,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:54:19,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:54:19,596 INFO L124 PetriNetUnfolderBase]: 480/852 cut-off events. [2024-06-14 14:54:19,596 INFO L125 PetriNetUnfolderBase]: For 36973/36973 co-relation queries the response was YES. [2024-06-14 14:54:19,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6255 conditions, 852 events. 480/852 cut-off events. For 36973/36973 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4020 event pairs, 107 based on Foata normal form. 4/855 useless extension candidates. Maximal degree in co-relation 6168. Up to 716 conditions per place. [2024-06-14 14:54:19,602 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 144 selfloop transitions, 38 changer transitions 0/184 dead transitions. [2024-06-14 14:54:19,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 184 transitions, 2492 flow [2024-06-14 14:54:19,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:54:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:54:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 14:54:19,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-14 14:54:19,604 INFO L175 Difference]: Start difference. First operand has 185 places, 165 transitions, 1901 flow. Second operand 9 states and 98 transitions. [2024-06-14 14:54:19,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 184 transitions, 2492 flow [2024-06-14 14:54:19,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 184 transitions, 2418 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-14 14:54:19,666 INFO L231 Difference]: Finished difference. Result has 191 places, 169 transitions, 2035 flow [2024-06-14 14:54:19,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1829, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2035, PETRI_PLACES=191, PETRI_TRANSITIONS=169} [2024-06-14 14:54:19,667 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 161 predicate places. [2024-06-14 14:54:19,667 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 169 transitions, 2035 flow [2024-06-14 14:54:19,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:19,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:54:19,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:54:19,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 14:54:19,668 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:54:19,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:54:19,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2019549511, now seen corresponding path program 9 times [2024-06-14 14:54:19,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:54:19,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486907756] [2024-06-14 14:54:19,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:54:19,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:54:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:54:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:54:23,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:54:23,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486907756] [2024-06-14 14:54:23,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486907756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:54:23,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:54:23,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:54:23,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577493462] [2024-06-14 14:54:23,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:54:23,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:54:23,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:54:23,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:54:23,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:54:23,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:54:23,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 169 transitions, 2035 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:23,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:54:23,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:54:23,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:54:23,524 INFO L124 PetriNetUnfolderBase]: 476/846 cut-off events. [2024-06-14 14:54:23,524 INFO L125 PetriNetUnfolderBase]: For 34688/34688 co-relation queries the response was YES. [2024-06-14 14:54:23,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6230 conditions, 846 events. 476/846 cut-off events. For 34688/34688 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4000 event pairs, 113 based on Foata normal form. 2/846 useless extension candidates. Maximal degree in co-relation 6140. Up to 768 conditions per place. [2024-06-14 14:54:23,530 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 155 selfloop transitions, 26 changer transitions 0/183 dead transitions. [2024-06-14 14:54:23,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 183 transitions, 2528 flow [2024-06-14 14:54:23,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:54:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:54:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-14 14:54:23,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-14 14:54:23,532 INFO L175 Difference]: Start difference. First operand has 191 places, 169 transitions, 2035 flow. Second operand 10 states and 105 transitions. [2024-06-14 14:54:23,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 183 transitions, 2528 flow [2024-06-14 14:54:23,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 183 transitions, 2395 flow, removed 40 selfloop flow, removed 7 redundant places. [2024-06-14 14:54:23,598 INFO L231 Difference]: Finished difference. Result has 194 places, 169 transitions, 1961 flow [2024-06-14 14:54:23,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1904, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1961, PETRI_PLACES=194, PETRI_TRANSITIONS=169} [2024-06-14 14:54:23,598 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 164 predicate places. [2024-06-14 14:54:23,598 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 169 transitions, 1961 flow [2024-06-14 14:54:23,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:23,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:54:23,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:54:23,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 14:54:23,599 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:54:23,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:54:23,599 INFO L85 PathProgramCache]: Analyzing trace with hash -117905231, now seen corresponding path program 10 times [2024-06-14 14:54:23,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:54:23,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637113691] [2024-06-14 14:54:23,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:54:23,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:54:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:54:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:54:27,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:54:27,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637113691] [2024-06-14 14:54:27,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637113691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:54:27,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:54:27,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:54:27,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215316580] [2024-06-14 14:54:27,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:54:27,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:54:27,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:54:27,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:54:27,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:54:27,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:54:27,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 169 transitions, 1961 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:27,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:54:27,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:54:27,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:54:28,088 INFO L124 PetriNetUnfolderBase]: 473/842 cut-off events. [2024-06-14 14:54:28,088 INFO L125 PetriNetUnfolderBase]: For 32739/32739 co-relation queries the response was YES. [2024-06-14 14:54:28,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5966 conditions, 842 events. 473/842 cut-off events. For 32739/32739 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3997 event pairs, 69 based on Foata normal form. 2/841 useless extension candidates. Maximal degree in co-relation 5876. Up to 718 conditions per place. [2024-06-14 14:54:28,096 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 137 selfloop transitions, 43 changer transitions 0/182 dead transitions. [2024-06-14 14:54:28,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 182 transitions, 2355 flow [2024-06-14 14:54:28,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:54:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:54:28,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-14 14:54:28,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-14 14:54:28,098 INFO L175 Difference]: Start difference. First operand has 194 places, 169 transitions, 1961 flow. Second operand 9 states and 96 transitions. [2024-06-14 14:54:28,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 182 transitions, 2355 flow [2024-06-14 14:54:28,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 182 transitions, 2239 flow, removed 21 selfloop flow, removed 10 redundant places. [2024-06-14 14:54:28,173 INFO L231 Difference]: Finished difference. Result has 193 places, 169 transitions, 1935 flow [2024-06-14 14:54:28,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1935, PETRI_PLACES=193, PETRI_TRANSITIONS=169} [2024-06-14 14:54:28,173 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 163 predicate places. [2024-06-14 14:54:28,173 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 169 transitions, 1935 flow [2024-06-14 14:54:28,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:28,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:54:28,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:54:28,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 14:54:28,174 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:54:28,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:54:28,174 INFO L85 PathProgramCache]: Analyzing trace with hash -117900271, now seen corresponding path program 10 times [2024-06-14 14:54:28,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:54:28,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134816704] [2024-06-14 14:54:28,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:54:28,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:54:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:54:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:54:32,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:54:32,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134816704] [2024-06-14 14:54:32,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134816704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:54:32,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:54:32,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:54:32,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59211977] [2024-06-14 14:54:32,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:54:32,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:54:32,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:54:32,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:54:32,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:54:32,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:54:32,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 169 transitions, 1935 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:32,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:54:32,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:54:32,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:54:33,013 INFO L124 PetriNetUnfolderBase]: 479/852 cut-off events. [2024-06-14 14:54:33,013 INFO L125 PetriNetUnfolderBase]: For 33020/33020 co-relation queries the response was YES. [2024-06-14 14:54:33,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5984 conditions, 852 events. 479/852 cut-off events. For 33020/33020 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4027 event pairs, 72 based on Foata normal form. 2/849 useless extension candidates. Maximal degree in co-relation 5896. Up to 718 conditions per place. [2024-06-14 14:54:33,022 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 138 selfloop transitions, 43 changer transitions 0/183 dead transitions. [2024-06-14 14:54:33,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 183 transitions, 2379 flow [2024-06-14 14:54:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:54:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:54:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-14 14:54:33,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-14 14:54:33,023 INFO L175 Difference]: Start difference. First operand has 193 places, 169 transitions, 1935 flow. Second operand 9 states and 96 transitions. [2024-06-14 14:54:33,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 183 transitions, 2379 flow [2024-06-14 14:54:33,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 183 transitions, 2235 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 14:54:33,089 INFO L231 Difference]: Finished difference. Result has 194 places, 171 transitions, 1934 flow [2024-06-14 14:54:33,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1791, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1934, PETRI_PLACES=194, PETRI_TRANSITIONS=171} [2024-06-14 14:54:33,090 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 164 predicate places. [2024-06-14 14:54:33,090 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 171 transitions, 1934 flow [2024-06-14 14:54:33,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:33,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:54:33,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:54:33,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 14:54:33,091 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:54:33,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:54:33,091 INFO L85 PathProgramCache]: Analyzing trace with hash 110180369, now seen corresponding path program 11 times [2024-06-14 14:54:33,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:54:33,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359856322] [2024-06-14 14:54:33,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:54:33,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:54:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:54:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:54:36,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:54:36,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359856322] [2024-06-14 14:54:36,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359856322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:54:36,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:54:36,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:54:36,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571250255] [2024-06-14 14:54:36,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:54:36,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:54:36,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:54:36,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:54:36,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:54:36,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:54:36,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 171 transitions, 1934 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:36,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:54:36,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:54:36,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:54:36,958 INFO L124 PetriNetUnfolderBase]: 548/964 cut-off events. [2024-06-14 14:54:36,958 INFO L125 PetriNetUnfolderBase]: For 47550/47550 co-relation queries the response was YES. [2024-06-14 14:54:36,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7305 conditions, 964 events. 548/964 cut-off events. For 47550/47550 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4659 event pairs, 121 based on Foata normal form. 4/965 useless extension candidates. Maximal degree in co-relation 7216. Up to 682 conditions per place. [2024-06-14 14:54:36,964 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 149 selfloop transitions, 49 changer transitions 0/200 dead transitions. [2024-06-14 14:54:36,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 200 transitions, 2934 flow [2024-06-14 14:54:36,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:54:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:54:36,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 14:54:36,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-14 14:54:36,965 INFO L175 Difference]: Start difference. First operand has 194 places, 171 transitions, 1934 flow. Second operand 9 states and 106 transitions. [2024-06-14 14:54:36,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 200 transitions, 2934 flow [2024-06-14 14:54:37,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 200 transitions, 2769 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-14 14:54:37,043 INFO L231 Difference]: Finished difference. Result has 196 places, 181 transitions, 2101 flow [2024-06-14 14:54:37,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1777, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2101, PETRI_PLACES=196, PETRI_TRANSITIONS=181} [2024-06-14 14:54:37,044 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 166 predicate places. [2024-06-14 14:54:37,044 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 181 transitions, 2101 flow [2024-06-14 14:54:37,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:37,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:54:37,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:54:37,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 14:54:37,045 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:54:37,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:54:37,045 INFO L85 PathProgramCache]: Analyzing trace with hash 110180617, now seen corresponding path program 1 times [2024-06-14 14:54:37,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:54:37,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017678023] [2024-06-14 14:54:37,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:54:37,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:54:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:54:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:54:41,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:54:41,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017678023] [2024-06-14 14:54:41,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017678023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:54:41,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:54:41,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:54:41,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020438414] [2024-06-14 14:54:41,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:54:41,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:54:41,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:54:41,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:54:41,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:54:41,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:54:41,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 181 transitions, 2101 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:41,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:54:41,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:54:41,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:54:41,784 INFO L124 PetriNetUnfolderBase]: 544/957 cut-off events. [2024-06-14 14:54:41,784 INFO L125 PetriNetUnfolderBase]: For 46044/46044 co-relation queries the response was YES. [2024-06-14 14:54:41,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7229 conditions, 957 events. 544/957 cut-off events. For 46044/46044 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4626 event pairs, 127 based on Foata normal form. 1/955 useless extension candidates. Maximal degree in co-relation 7139. Up to 883 conditions per place. [2024-06-14 14:54:41,792 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 154 selfloop transitions, 34 changer transitions 0/190 dead transitions. [2024-06-14 14:54:41,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 190 transitions, 2510 flow [2024-06-14 14:54:41,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:54:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:54:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2024-06-14 14:54:41,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32974910394265233 [2024-06-14 14:54:41,794 INFO L175 Difference]: Start difference. First operand has 196 places, 181 transitions, 2101 flow. Second operand 9 states and 92 transitions. [2024-06-14 14:54:41,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 190 transitions, 2510 flow [2024-06-14 14:54:41,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 190 transitions, 2423 flow, removed 34 selfloop flow, removed 3 redundant places. [2024-06-14 14:54:41,870 INFO L231 Difference]: Finished difference. Result has 202 places, 182 transitions, 2104 flow [2024-06-14 14:54:41,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2016, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2104, PETRI_PLACES=202, PETRI_TRANSITIONS=182} [2024-06-14 14:54:41,870 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 172 predicate places. [2024-06-14 14:54:41,870 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 182 transitions, 2104 flow [2024-06-14 14:54:41,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:41,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:54:41,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:54:41,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 14:54:41,871 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:54:41,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:54:41,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1823313969, now seen corresponding path program 12 times [2024-06-14 14:54:41,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:54:41,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024107522] [2024-06-14 14:54:41,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:54:41,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:54:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:54:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:54:45,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:54:45,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024107522] [2024-06-14 14:54:45,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024107522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:54:45,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:54:45,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:54:45,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283181699] [2024-06-14 14:54:45,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:54:45,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:54:45,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:54:45,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:54:45,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:54:45,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:54:45,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 182 transitions, 2104 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:45,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:54:45,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:54:45,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:54:46,173 INFO L124 PetriNetUnfolderBase]: 556/977 cut-off events. [2024-06-14 14:54:46,173 INFO L125 PetriNetUnfolderBase]: For 50222/50222 co-relation queries the response was YES. [2024-06-14 14:54:46,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7365 conditions, 977 events. 556/977 cut-off events. For 50222/50222 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4745 event pairs, 129 based on Foata normal form. 4/978 useless extension candidates. Maximal degree in co-relation 7273. Up to 884 conditions per place. [2024-06-14 14:54:46,181 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 170 selfloop transitions, 27 changer transitions 0/199 dead transitions. [2024-06-14 14:54:46,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 199 transitions, 2725 flow [2024-06-14 14:54:46,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:54:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:54:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 14:54:46,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-14 14:54:46,182 INFO L175 Difference]: Start difference. First operand has 202 places, 182 transitions, 2104 flow. Second operand 9 states and 97 transitions. [2024-06-14 14:54:46,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 199 transitions, 2725 flow [2024-06-14 14:54:46,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 199 transitions, 2630 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 14:54:46,291 INFO L231 Difference]: Finished difference. Result has 204 places, 185 transitions, 2142 flow [2024-06-14 14:54:46,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2011, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2142, PETRI_PLACES=204, PETRI_TRANSITIONS=185} [2024-06-14 14:54:46,291 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 174 predicate places. [2024-06-14 14:54:46,291 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 185 transitions, 2142 flow [2024-06-14 14:54:46,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:46,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:54:46,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:54:46,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 14:54:46,292 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:54:46,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:54:46,293 INFO L85 PathProgramCache]: Analyzing trace with hash 280479823, now seen corresponding path program 13 times [2024-06-14 14:54:46,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:54:46,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992085611] [2024-06-14 14:54:46,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:54:46,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:54:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:54:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:54:49,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:54:49,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992085611] [2024-06-14 14:54:49,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992085611] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:54:49,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:54:49,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:54:49,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610832823] [2024-06-14 14:54:49,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:54:49,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:54:49,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:54:49,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:54:49,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:54:49,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:54:49,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 185 transitions, 2142 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:49,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:54:49,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:54:49,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:54:49,989 INFO L124 PetriNetUnfolderBase]: 552/971 cut-off events. [2024-06-14 14:54:49,989 INFO L125 PetriNetUnfolderBase]: For 48009/48009 co-relation queries the response was YES. [2024-06-14 14:54:49,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7277 conditions, 971 events. 552/971 cut-off events. For 48009/48009 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4704 event pairs, 128 based on Foata normal form. 2/970 useless extension candidates. Maximal degree in co-relation 7184. Up to 883 conditions per place. [2024-06-14 14:54:49,998 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 169 selfloop transitions, 29 changer transitions 0/200 dead transitions. [2024-06-14 14:54:49,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 200 transitions, 2731 flow [2024-06-14 14:54:49,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:54:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:54:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 14:54:49,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-14 14:54:49,999 INFO L175 Difference]: Start difference. First operand has 204 places, 185 transitions, 2142 flow. Second operand 9 states and 98 transitions. [2024-06-14 14:54:49,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 200 transitions, 2731 flow [2024-06-14 14:54:50,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 200 transitions, 2592 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-14 14:54:50,087 INFO L231 Difference]: Finished difference. Result has 206 places, 187 transitions, 2126 flow [2024-06-14 14:54:50,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2009, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2126, PETRI_PLACES=206, PETRI_TRANSITIONS=187} [2024-06-14 14:54:50,088 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 176 predicate places. [2024-06-14 14:54:50,088 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 187 transitions, 2126 flow [2024-06-14 14:54:50,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:50,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:54:50,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:54:50,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 14:54:50,088 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:54:50,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:54:50,089 INFO L85 PathProgramCache]: Analyzing trace with hash 508380973, now seen corresponding path program 14 times [2024-06-14 14:54:50,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:54:50,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23499917] [2024-06-14 14:54:50,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:54:50,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:54:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:54:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:54:53,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:54:53,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23499917] [2024-06-14 14:54:53,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23499917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:54:53,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:54:53,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:54:53,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000161605] [2024-06-14 14:54:53,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:54:53,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:54:53,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:54:53,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:54:53,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:54:53,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:54:53,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 187 transitions, 2126 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:53,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:54:53,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:54:53,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:54:54,195 INFO L124 PetriNetUnfolderBase]: 558/981 cut-off events. [2024-06-14 14:54:54,195 INFO L125 PetriNetUnfolderBase]: For 48623/48623 co-relation queries the response was YES. [2024-06-14 14:54:54,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7277 conditions, 981 events. 558/981 cut-off events. For 48623/48623 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4772 event pairs, 123 based on Foata normal form. 2/980 useless extension candidates. Maximal degree in co-relation 7183. Up to 693 conditions per place. [2024-06-14 14:54:54,203 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 146 selfloop transitions, 60 changer transitions 0/208 dead transitions. [2024-06-14 14:54:54,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 208 transitions, 3013 flow [2024-06-14 14:54:54,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:54:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:54:54,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-14 14:54:54,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-14 14:54:54,204 INFO L175 Difference]: Start difference. First operand has 206 places, 187 transitions, 2126 flow. Second operand 9 states and 105 transitions. [2024-06-14 14:54:54,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 208 transitions, 3013 flow [2024-06-14 14:54:54,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 208 transitions, 2917 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-14 14:54:54,294 INFO L231 Difference]: Finished difference. Result has 210 places, 193 transitions, 2322 flow [2024-06-14 14:54:54,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2030, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2322, PETRI_PLACES=210, PETRI_TRANSITIONS=193} [2024-06-14 14:54:54,294 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2024-06-14 14:54:54,294 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 193 transitions, 2322 flow [2024-06-14 14:54:54,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:54,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:54:54,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:54:54,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 14:54:54,295 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:54:54,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:54:54,295 INFO L85 PathProgramCache]: Analyzing trace with hash 516661693, now seen corresponding path program 15 times [2024-06-14 14:54:54,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:54:54,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700651125] [2024-06-14 14:54:54,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:54:54,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:54:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:54:57,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-14 14:54:57,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:54:57,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700651125] [2024-06-14 14:54:57,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700651125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:54:57,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:54:57,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:54:57,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121525069] [2024-06-14 14:54:57,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:54:57,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:54:57,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:54:57,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:54:57,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:54:58,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:54:58,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 193 transitions, 2322 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:58,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:54:58,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:54:58,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:54:58,396 INFO L124 PetriNetUnfolderBase]: 552/972 cut-off events. [2024-06-14 14:54:58,397 INFO L125 PetriNetUnfolderBase]: For 49305/49305 co-relation queries the response was YES. [2024-06-14 14:54:58,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7165 conditions, 972 events. 552/972 cut-off events. For 49305/49305 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4724 event pairs, 167 based on Foata normal form. 4/975 useless extension candidates. Maximal degree in co-relation 7069. Up to 912 conditions per place. [2024-06-14 14:54:58,405 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 183 selfloop transitions, 19 changer transitions 0/204 dead transitions. [2024-06-14 14:54:58,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 204 transitions, 2852 flow [2024-06-14 14:54:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:54:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:54:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-14 14:54:58,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33691756272401435 [2024-06-14 14:54:58,406 INFO L175 Difference]: Start difference. First operand has 210 places, 193 transitions, 2322 flow. Second operand 9 states and 94 transitions. [2024-06-14 14:54:58,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 204 transitions, 2852 flow [2024-06-14 14:54:58,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 204 transitions, 2694 flow, removed 55 selfloop flow, removed 4 redundant places. [2024-06-14 14:54:58,517 INFO L231 Difference]: Finished difference. Result has 215 places, 193 transitions, 2209 flow [2024-06-14 14:54:58,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2164, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2209, PETRI_PLACES=215, PETRI_TRANSITIONS=193} [2024-06-14 14:54:58,518 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 185 predicate places. [2024-06-14 14:54:58,518 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 193 transitions, 2209 flow [2024-06-14 14:54:58,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:54:58,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:54:58,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:54:58,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 14:54:58,519 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:54:58,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:54:58,519 INFO L85 PathProgramCache]: Analyzing trace with hash 516661941, now seen corresponding path program 2 times [2024-06-14 14:54:58,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:54:58,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382176585] [2024-06-14 14:54:58,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:54:58,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:54:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:55:03,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:55:03,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:55:03,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382176585] [2024-06-14 14:55:03,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382176585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:55:03,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:55:03,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:55:03,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591079845] [2024-06-14 14:55:03,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:55:03,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:55:03,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:55:03,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:55:03,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:55:03,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:55:03,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 193 transitions, 2209 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:03,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:55:03,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:55:03,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:55:03,510 INFO L124 PetriNetUnfolderBase]: 548/966 cut-off events. [2024-06-14 14:55:03,510 INFO L125 PetriNetUnfolderBase]: For 45691/45691 co-relation queries the response was YES. [2024-06-14 14:55:03,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6936 conditions, 966 events. 548/966 cut-off events. For 45691/45691 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4690 event pairs, 170 based on Foata normal form. 1/966 useless extension candidates. Maximal degree in co-relation 6838. Up to 931 conditions per place. [2024-06-14 14:55:03,518 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 184 selfloop transitions, 15 changer transitions 0/201 dead transitions. [2024-06-14 14:55:03,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 201 transitions, 2638 flow [2024-06-14 14:55:03,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:55:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:55:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-06-14 14:55:03,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32661290322580644 [2024-06-14 14:55:03,519 INFO L175 Difference]: Start difference. First operand has 215 places, 193 transitions, 2209 flow. Second operand 8 states and 81 transitions. [2024-06-14 14:55:03,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 201 transitions, 2638 flow [2024-06-14 14:55:03,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 201 transitions, 2579 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 14:55:03,627 INFO L231 Difference]: Finished difference. Result has 215 places, 194 transitions, 2204 flow [2024-06-14 14:55:03,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2152, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2204, PETRI_PLACES=215, PETRI_TRANSITIONS=194} [2024-06-14 14:55:03,628 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 185 predicate places. [2024-06-14 14:55:03,628 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 194 transitions, 2204 flow [2024-06-14 14:55:03,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:03,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:55:03,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:55:03,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 14:55:03,632 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:55:03,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:55:03,632 INFO L85 PathProgramCache]: Analyzing trace with hash 406428153, now seen corresponding path program 1 times [2024-06-14 14:55:03,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:55:03,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581406445] [2024-06-14 14:55:03,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:55:03,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:55:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:55:08,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:55:08,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:55:08,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581406445] [2024-06-14 14:55:08,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581406445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:55:08,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:55:08,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:55:08,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037241380] [2024-06-14 14:55:08,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:55:08,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:55:08,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:55:08,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:55:08,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:55:08,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:55:08,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 194 transitions, 2204 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:08,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:55:08,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:55:08,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:55:09,238 INFO L124 PetriNetUnfolderBase]: 552/973 cut-off events. [2024-06-14 14:55:09,238 INFO L125 PetriNetUnfolderBase]: For 49040/49040 co-relation queries the response was YES. [2024-06-14 14:55:09,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6984 conditions, 973 events. 552/973 cut-off events. For 49040/49040 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4748 event pairs, 86 based on Foata normal form. 2/974 useless extension candidates. Maximal degree in co-relation 6885. Up to 852 conditions per place. [2024-06-14 14:55:09,248 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 184 selfloop transitions, 27 changer transitions 0/213 dead transitions. [2024-06-14 14:55:09,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 213 transitions, 2684 flow [2024-06-14 14:55:09,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:55:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:55:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-14 14:55:09,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32903225806451614 [2024-06-14 14:55:09,249 INFO L175 Difference]: Start difference. First operand has 215 places, 194 transitions, 2204 flow. Second operand 10 states and 102 transitions. [2024-06-14 14:55:09,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 213 transitions, 2684 flow [2024-06-14 14:55:09,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 213 transitions, 2630 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 14:55:09,355 INFO L231 Difference]: Finished difference. Result has 218 places, 195 transitions, 2224 flow [2024-06-14 14:55:09,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2150, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2224, PETRI_PLACES=218, PETRI_TRANSITIONS=195} [2024-06-14 14:55:09,355 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 188 predicate places. [2024-06-14 14:55:09,355 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 195 transitions, 2224 flow [2024-06-14 14:55:09,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:09,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:55:09,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:55:09,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 14:55:09,356 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:55:09,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:55:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash -357897663, now seen corresponding path program 2 times [2024-06-14 14:55:09,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:55:09,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58466801] [2024-06-14 14:55:09,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:55:09,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:55:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:55:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:55:14,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:55:14,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58466801] [2024-06-14 14:55:14,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58466801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:55:14,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:55:14,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:55:14,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368519914] [2024-06-14 14:55:14,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:55:14,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:55:14,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:55:14,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:55:14,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:55:14,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:55:14,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 195 transitions, 2224 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:14,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:55:14,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:55:14,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:55:15,080 INFO L124 PetriNetUnfolderBase]: 556/981 cut-off events. [2024-06-14 14:55:15,080 INFO L125 PetriNetUnfolderBase]: For 48594/48594 co-relation queries the response was YES. [2024-06-14 14:55:15,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7055 conditions, 981 events. 556/981 cut-off events. For 48594/48594 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4800 event pairs, 118 based on Foata normal form. 2/982 useless extension candidates. Maximal degree in co-relation 6956. Up to 895 conditions per place. [2024-06-14 14:55:15,088 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 187 selfloop transitions, 25 changer transitions 0/214 dead transitions. [2024-06-14 14:55:15,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 214 transitions, 2710 flow [2024-06-14 14:55:15,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:55:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:55:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-14 14:55:15,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-14 14:55:15,090 INFO L175 Difference]: Start difference. First operand has 218 places, 195 transitions, 2224 flow. Second operand 10 states and 105 transitions. [2024-06-14 14:55:15,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 214 transitions, 2710 flow [2024-06-14 14:55:15,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 214 transitions, 2646 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 14:55:15,216 INFO L231 Difference]: Finished difference. Result has 220 places, 196 transitions, 2232 flow [2024-06-14 14:55:15,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2160, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2232, PETRI_PLACES=220, PETRI_TRANSITIONS=196} [2024-06-14 14:55:15,216 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 190 predicate places. [2024-06-14 14:55:15,217 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 196 transitions, 2232 flow [2024-06-14 14:55:15,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:15,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:55:15,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:55:15,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 14:55:15,217 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:55:15,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:55:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash -300064683, now seen corresponding path program 3 times [2024-06-14 14:55:15,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:55:15,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342090367] [2024-06-14 14:55:15,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:55:15,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:55:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:55:20,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:55:20,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:55:20,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342090367] [2024-06-14 14:55:20,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342090367] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:55:20,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:55:20,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:55:20,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108564528] [2024-06-14 14:55:20,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:55:20,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:55:20,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:55:20,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:55:20,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:55:20,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:55:20,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 196 transitions, 2232 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:20,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:55:20,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:55:20,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:55:20,977 INFO L124 PetriNetUnfolderBase]: 560/989 cut-off events. [2024-06-14 14:55:20,978 INFO L125 PetriNetUnfolderBase]: For 50981/50981 co-relation queries the response was YES. [2024-06-14 14:55:20,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7116 conditions, 989 events. 560/989 cut-off events. For 50981/50981 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4859 event pairs, 115 based on Foata normal form. 2/990 useless extension candidates. Maximal degree in co-relation 7016. Up to 904 conditions per place. [2024-06-14 14:55:20,987 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 184 selfloop transitions, 28 changer transitions 0/214 dead transitions. [2024-06-14 14:55:20,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 214 transitions, 2718 flow [2024-06-14 14:55:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:55:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:55:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-14 14:55:20,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-14 14:55:20,988 INFO L175 Difference]: Start difference. First operand has 220 places, 196 transitions, 2232 flow. Second operand 10 states and 105 transitions. [2024-06-14 14:55:20,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 214 transitions, 2718 flow [2024-06-14 14:55:21,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 214 transitions, 2656 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 14:55:21,093 INFO L231 Difference]: Finished difference. Result has 222 places, 197 transitions, 2250 flow [2024-06-14 14:55:21,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2170, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2250, PETRI_PLACES=222, PETRI_TRANSITIONS=197} [2024-06-14 14:55:21,093 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 192 predicate places. [2024-06-14 14:55:21,093 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 197 transitions, 2250 flow [2024-06-14 14:55:21,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:21,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:55:21,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:55:21,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 14:55:21,094 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:55:21,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:55:21,094 INFO L85 PathProgramCache]: Analyzing trace with hash -299686018, now seen corresponding path program 1 times [2024-06-14 14:55:21,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:55:21,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734986526] [2024-06-14 14:55:21,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:55:21,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:55:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:55:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:55:25,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:55:25,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734986526] [2024-06-14 14:55:25,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734986526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:55:25,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:55:25,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:55:25,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146154965] [2024-06-14 14:55:25,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:55:25,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:55:25,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:55:25,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:55:25,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:55:25,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:55:25,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 197 transitions, 2250 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:25,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:55:25,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:55:25,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:55:26,308 INFO L124 PetriNetUnfolderBase]: 563/994 cut-off events. [2024-06-14 14:55:26,308 INFO L125 PetriNetUnfolderBase]: For 52144/52144 co-relation queries the response was YES. [2024-06-14 14:55:26,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7207 conditions, 994 events. 563/994 cut-off events. For 52144/52144 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4899 event pairs, 113 based on Foata normal form. 1/994 useless extension candidates. Maximal degree in co-relation 7106. Up to 903 conditions per place. [2024-06-14 14:55:26,317 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 180 selfloop transitions, 34 changer transitions 0/216 dead transitions. [2024-06-14 14:55:26,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 216 transitions, 2783 flow [2024-06-14 14:55:26,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:55:26,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:55:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 14:55:26,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-14 14:55:26,318 INFO L175 Difference]: Start difference. First operand has 222 places, 197 transitions, 2250 flow. Second operand 10 states and 107 transitions. [2024-06-14 14:55:26,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 216 transitions, 2783 flow [2024-06-14 14:55:26,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 216 transitions, 2713 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 14:55:26,435 INFO L231 Difference]: Finished difference. Result has 224 places, 199 transitions, 2317 flow [2024-06-14 14:55:26,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2180, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2317, PETRI_PLACES=224, PETRI_TRANSITIONS=199} [2024-06-14 14:55:26,436 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 194 predicate places. [2024-06-14 14:55:26,436 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 199 transitions, 2317 flow [2024-06-14 14:55:26,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:26,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:55:26,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:55:26,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 14:55:26,436 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:55:26,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:55:26,437 INFO L85 PathProgramCache]: Analyzing trace with hash -299677803, now seen corresponding path program 4 times [2024-06-14 14:55:26,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:55:26,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475925850] [2024-06-14 14:55:26,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:55:26,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:55:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:55:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:55:31,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:55:31,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475925850] [2024-06-14 14:55:31,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475925850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:55:31,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:55:31,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:55:31,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741106411] [2024-06-14 14:55:31,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:55:31,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:55:31,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:55:31,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:55:31,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:55:31,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:55:31,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 199 transitions, 2317 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:31,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:55:31,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:55:31,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:55:32,047 INFO L124 PetriNetUnfolderBase]: 567/1002 cut-off events. [2024-06-14 14:55:32,047 INFO L125 PetriNetUnfolderBase]: For 54916/54916 co-relation queries the response was YES. [2024-06-14 14:55:32,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7306 conditions, 1002 events. 567/1002 cut-off events. For 54916/54916 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4946 event pairs, 116 based on Foata normal form. 2/1003 useless extension candidates. Maximal degree in co-relation 7204. Up to 914 conditions per place. [2024-06-14 14:55:32,054 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 184 selfloop transitions, 31 changer transitions 0/217 dead transitions. [2024-06-14 14:55:32,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 217 transitions, 2813 flow [2024-06-14 14:55:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:55:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:55:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 14:55:32,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-14 14:55:32,055 INFO L175 Difference]: Start difference. First operand has 224 places, 199 transitions, 2317 flow. Second operand 10 states and 106 transitions. [2024-06-14 14:55:32,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 217 transitions, 2813 flow [2024-06-14 14:55:32,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 217 transitions, 2709 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-14 14:55:32,167 INFO L231 Difference]: Finished difference. Result has 226 places, 200 transitions, 2302 flow [2024-06-14 14:55:32,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2213, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2302, PETRI_PLACES=226, PETRI_TRANSITIONS=200} [2024-06-14 14:55:32,168 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 196 predicate places. [2024-06-14 14:55:32,168 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 200 transitions, 2302 flow [2024-06-14 14:55:32,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:32,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:55:32,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:55:32,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 14:55:32,168 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:55:32,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:55:32,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1773152855, now seen corresponding path program 1 times [2024-06-14 14:55:32,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:55:32,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146528399] [2024-06-14 14:55:32,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:55:32,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:55:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:55:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:55:36,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:55:36,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146528399] [2024-06-14 14:55:36,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146528399] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:55:36,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:55:36,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:55:36,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21471762] [2024-06-14 14:55:36,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:55:36,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:55:36,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:55:36,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:55:36,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:55:36,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:55:36,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 200 transitions, 2302 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:36,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:55:36,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:55:36,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:55:37,188 INFO L124 PetriNetUnfolderBase]: 573/1013 cut-off events. [2024-06-14 14:55:37,189 INFO L125 PetriNetUnfolderBase]: For 57135/57135 co-relation queries the response was YES. [2024-06-14 14:55:37,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7388 conditions, 1013 events. 573/1013 cut-off events. For 57135/57135 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5006 event pairs, 96 based on Foata normal form. 2/1014 useless extension candidates. Maximal degree in co-relation 7285. Up to 922 conditions per place. [2024-06-14 14:55:37,198 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 186 selfloop transitions, 33 changer transitions 0/221 dead transitions. [2024-06-14 14:55:37,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 221 transitions, 2838 flow [2024-06-14 14:55:37,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:55:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:55:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-14 14:55:37,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077 [2024-06-14 14:55:37,199 INFO L175 Difference]: Start difference. First operand has 226 places, 200 transitions, 2302 flow. Second operand 11 states and 115 transitions. [2024-06-14 14:55:37,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 221 transitions, 2838 flow [2024-06-14 14:55:37,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 221 transitions, 2761 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 14:55:37,324 INFO L231 Difference]: Finished difference. Result has 229 places, 202 transitions, 2344 flow [2024-06-14 14:55:37,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2225, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2344, PETRI_PLACES=229, PETRI_TRANSITIONS=202} [2024-06-14 14:55:37,325 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-14 14:55:37,325 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 202 transitions, 2344 flow [2024-06-14 14:55:37,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:37,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:55:37,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:55:37,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 14:55:37,326 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:55:37,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:55:37,326 INFO L85 PathProgramCache]: Analyzing trace with hash -2062995917, now seen corresponding path program 5 times [2024-06-14 14:55:37,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:55:37,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099640647] [2024-06-14 14:55:37,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:55:37,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:55:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:55:42,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-14 14:55:42,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:55:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099640647] [2024-06-14 14:55:42,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099640647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:55:42,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:55:42,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:55:42,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563511547] [2024-06-14 14:55:42,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:55:42,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:55:42,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:55:42,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:55:42,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:55:42,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:55:42,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 202 transitions, 2344 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:42,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:55:42,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:55:42,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:55:43,136 INFO L124 PetriNetUnfolderBase]: 577/1020 cut-off events. [2024-06-14 14:55:43,136 INFO L125 PetriNetUnfolderBase]: For 59028/59028 co-relation queries the response was YES. [2024-06-14 14:55:43,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7474 conditions, 1020 events. 577/1020 cut-off events. For 59028/59028 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5066 event pairs, 97 based on Foata normal form. 2/1021 useless extension candidates. Maximal degree in co-relation 7370. Up to 934 conditions per place. [2024-06-14 14:55:43,144 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 194 selfloop transitions, 24 changer transitions 0/220 dead transitions. [2024-06-14 14:55:43,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 220 transitions, 2846 flow [2024-06-14 14:55:43,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:55:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:55:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 14:55:43,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-14 14:55:43,145 INFO L175 Difference]: Start difference. First operand has 229 places, 202 transitions, 2344 flow. Second operand 10 states and 106 transitions. [2024-06-14 14:55:43,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 220 transitions, 2846 flow [2024-06-14 14:55:43,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 220 transitions, 2753 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-14 14:55:43,264 INFO L231 Difference]: Finished difference. Result has 230 places, 203 transitions, 2327 flow [2024-06-14 14:55:43,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2327, PETRI_PLACES=230, PETRI_TRANSITIONS=203} [2024-06-14 14:55:43,264 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 200 predicate places. [2024-06-14 14:55:43,264 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 203 transitions, 2327 flow [2024-06-14 14:55:43,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:43,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:55:43,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:55:43,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 14:55:43,265 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:55:43,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:55:43,265 INFO L85 PathProgramCache]: Analyzing trace with hash -869428911, now seen corresponding path program 6 times [2024-06-14 14:55:43,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:55:43,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694581692] [2024-06-14 14:55:43,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:55:43,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:55:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:55:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:55:48,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:55:48,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694581692] [2024-06-14 14:55:48,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694581692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:55:48,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:55:48,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:55:48,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748081985] [2024-06-14 14:55:48,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:55:48,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:55:48,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:55:48,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:55:48,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:55:48,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:55:48,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 203 transitions, 2327 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:48,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:55:48,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:55:48,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:55:48,489 INFO L124 PetriNetUnfolderBase]: 581/1028 cut-off events. [2024-06-14 14:55:48,489 INFO L125 PetriNetUnfolderBase]: For 61323/61323 co-relation queries the response was YES. [2024-06-14 14:55:48,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7519 conditions, 1028 events. 581/1028 cut-off events. For 61323/61323 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5108 event pairs, 97 based on Foata normal form. 2/1029 useless extension candidates. Maximal degree in co-relation 7414. Up to 943 conditions per place. [2024-06-14 14:55:48,499 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 191 selfloop transitions, 27 changer transitions 0/220 dead transitions. [2024-06-14 14:55:48,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 220 transitions, 2829 flow [2024-06-14 14:55:48,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:55:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:55:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 14:55:48,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-14 14:55:48,501 INFO L175 Difference]: Start difference. First operand has 230 places, 203 transitions, 2327 flow. Second operand 10 states and 106 transitions. [2024-06-14 14:55:48,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 220 transitions, 2829 flow [2024-06-14 14:55:48,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 220 transitions, 2763 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 14:55:48,622 INFO L231 Difference]: Finished difference. Result has 232 places, 204 transitions, 2345 flow [2024-06-14 14:55:48,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2261, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2345, PETRI_PLACES=232, PETRI_TRANSITIONS=204} [2024-06-14 14:55:48,623 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 202 predicate places. [2024-06-14 14:55:48,623 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 204 transitions, 2345 flow [2024-06-14 14:55:48,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:48,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:55:48,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:55:48,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 14:55:48,624 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:55:48,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:55:48,624 INFO L85 PathProgramCache]: Analyzing trace with hash -869425191, now seen corresponding path program 7 times [2024-06-14 14:55:48,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:55:48,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327854839] [2024-06-14 14:55:48,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:55:48,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:55:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:55:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:55:53,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:55:53,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327854839] [2024-06-14 14:55:53,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327854839] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:55:53,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:55:53,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:55:53,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67462065] [2024-06-14 14:55:53,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:55:53,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:55:53,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:55:53,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:55:53,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:55:53,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:55:53,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 204 transitions, 2345 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:53,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:55:53,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:55:53,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:55:53,648 INFO L124 PetriNetUnfolderBase]: 585/1036 cut-off events. [2024-06-14 14:55:53,648 INFO L125 PetriNetUnfolderBase]: For 63522/63522 co-relation queries the response was YES. [2024-06-14 14:55:53,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7598 conditions, 1036 events. 585/1036 cut-off events. For 63522/63522 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5219 event pairs, 97 based on Foata normal form. 2/1037 useless extension candidates. Maximal degree in co-relation 7492. Up to 948 conditions per place. [2024-06-14 14:55:53,658 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 189 selfloop transitions, 30 changer transitions 0/221 dead transitions. [2024-06-14 14:55:53,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 221 transitions, 2853 flow [2024-06-14 14:55:53,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:55:53,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:55:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 14:55:53,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-14 14:55:53,680 INFO L175 Difference]: Start difference. First operand has 232 places, 204 transitions, 2345 flow. Second operand 10 states and 107 transitions. [2024-06-14 14:55:53,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 221 transitions, 2853 flow [2024-06-14 14:55:53,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 221 transitions, 2779 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 14:55:53,815 INFO L231 Difference]: Finished difference. Result has 234 places, 205 transitions, 2364 flow [2024-06-14 14:55:53,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2271, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2364, PETRI_PLACES=234, PETRI_TRANSITIONS=205} [2024-06-14 14:55:53,815 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places. [2024-06-14 14:55:53,815 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 205 transitions, 2364 flow [2024-06-14 14:55:53,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:53,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:55:53,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:55:53,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 14:55:53,816 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:55:53,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:55:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash -869425036, now seen corresponding path program 2 times [2024-06-14 14:55:53,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:55:53,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302944427] [2024-06-14 14:55:53,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:55:53,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:55:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:55:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:55:58,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:55:58,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302944427] [2024-06-14 14:55:58,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302944427] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:55:58,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:55:58,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:55:58,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760521009] [2024-06-14 14:55:58,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:55:58,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:55:58,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:55:58,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:55:58,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:55:58,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:55:58,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 205 transitions, 2364 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:58,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:55:58,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:55:58,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:55:58,685 INFO L124 PetriNetUnfolderBase]: 583/1033 cut-off events. [2024-06-14 14:55:58,685 INFO L125 PetriNetUnfolderBase]: For 61979/61979 co-relation queries the response was YES. [2024-06-14 14:55:58,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7514 conditions, 1033 events. 583/1033 cut-off events. For 61979/61979 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5183 event pairs, 97 based on Foata normal form. 1/1033 useless extension candidates. Maximal degree in co-relation 7407. Up to 942 conditions per place. [2024-06-14 14:55:58,694 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 188 selfloop transitions, 33 changer transitions 0/223 dead transitions. [2024-06-14 14:55:58,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 223 transitions, 2915 flow [2024-06-14 14:55:58,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:55:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:55:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-14 14:55:58,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-14 14:55:58,696 INFO L175 Difference]: Start difference. First operand has 234 places, 205 transitions, 2364 flow. Second operand 10 states and 108 transitions. [2024-06-14 14:55:58,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 223 transitions, 2915 flow [2024-06-14 14:55:58,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 223 transitions, 2834 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 14:55:58,823 INFO L231 Difference]: Finished difference. Result has 236 places, 207 transitions, 2424 flow [2024-06-14 14:55:58,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2283, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2424, PETRI_PLACES=236, PETRI_TRANSITIONS=207} [2024-06-14 14:55:58,824 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 206 predicate places. [2024-06-14 14:55:58,824 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 207 transitions, 2424 flow [2024-06-14 14:55:58,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:55:58,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:55:58,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:55:58,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 14:55:58,824 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:55:58,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:55:58,825 INFO L85 PathProgramCache]: Analyzing trace with hash -782583279, now seen corresponding path program 2 times [2024-06-14 14:55:58,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:55:58,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235117417] [2024-06-14 14:55:58,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:55:58,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:55:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:56:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:56:02,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:56:02,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235117417] [2024-06-14 14:56:02,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235117417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:56:02,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:56:02,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:56:02,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11094475] [2024-06-14 14:56:02,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:56:02,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:56:02,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:56:02,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:56:02,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:56:02,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:56:02,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 207 transitions, 2424 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:02,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:56:02,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:56:02,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:56:03,324 INFO L124 PetriNetUnfolderBase]: 589/1044 cut-off events. [2024-06-14 14:56:03,324 INFO L125 PetriNetUnfolderBase]: For 65586/65586 co-relation queries the response was YES. [2024-06-14 14:56:03,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7619 conditions, 1044 events. 589/1044 cut-off events. For 65586/65586 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5251 event pairs, 99 based on Foata normal form. 2/1045 useless extension candidates. Maximal degree in co-relation 7511. Up to 953 conditions per place. [2024-06-14 14:56:03,334 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 195 selfloop transitions, 30 changer transitions 0/227 dead transitions. [2024-06-14 14:56:03,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 227 transitions, 2976 flow [2024-06-14 14:56:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:56:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:56:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-14 14:56:03,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-14 14:56:03,335 INFO L175 Difference]: Start difference. First operand has 236 places, 207 transitions, 2424 flow. Second operand 11 states and 116 transitions. [2024-06-14 14:56:03,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 227 transitions, 2976 flow [2024-06-14 14:56:03,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 227 transitions, 2868 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-14 14:56:03,483 INFO L231 Difference]: Finished difference. Result has 239 places, 209 transitions, 2435 flow [2024-06-14 14:56:03,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2316, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2435, PETRI_PLACES=239, PETRI_TRANSITIONS=209} [2024-06-14 14:56:03,483 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 209 predicate places. [2024-06-14 14:56:03,483 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 209 transitions, 2435 flow [2024-06-14 14:56:03,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:03,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:56:03,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:56:03,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 14:56:03,484 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:56:03,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:56:03,484 INFO L85 PathProgramCache]: Analyzing trace with hash -679729275, now seen corresponding path program 8 times [2024-06-14 14:56:03,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:56:03,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226435160] [2024-06-14 14:56:03,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:56:03,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:56:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:56:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:56:07,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:56:07,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226435160] [2024-06-14 14:56:07,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226435160] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:56:07,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:56:07,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:56:07,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088622241] [2024-06-14 14:56:07,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:56:07,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:56:07,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:56:07,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:56:07,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:56:07,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:56:07,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 209 transitions, 2435 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:07,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:56:07,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:56:07,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:56:08,290 INFO L124 PetriNetUnfolderBase]: 593/1051 cut-off events. [2024-06-14 14:56:08,290 INFO L125 PetriNetUnfolderBase]: For 67887/67887 co-relation queries the response was YES. [2024-06-14 14:56:08,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7690 conditions, 1051 events. 593/1051 cut-off events. For 67887/67887 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5326 event pairs, 139 based on Foata normal form. 2/1052 useless extension candidates. Maximal degree in co-relation 7581. Up to 1008 conditions per place. [2024-06-14 14:56:08,298 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 204 selfloop transitions, 18 changer transitions 0/224 dead transitions. [2024-06-14 14:56:08,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 224 transitions, 2943 flow [2024-06-14 14:56:08,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:56:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:56:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2024-06-14 14:56:08,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-14 14:56:08,300 INFO L175 Difference]: Start difference. First operand has 239 places, 209 transitions, 2435 flow. Second operand 10 states and 100 transitions. [2024-06-14 14:56:08,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 224 transitions, 2943 flow [2024-06-14 14:56:08,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 224 transitions, 2850 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-14 14:56:08,443 INFO L231 Difference]: Finished difference. Result has 240 places, 210 transitions, 2412 flow [2024-06-14 14:56:08,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2342, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2412, PETRI_PLACES=240, PETRI_TRANSITIONS=210} [2024-06-14 14:56:08,444 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 210 predicate places. [2024-06-14 14:56:08,444 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 210 transitions, 2412 flow [2024-06-14 14:56:08,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:08,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:56:08,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:56:08,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 14:56:08,444 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:56:08,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:56:08,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1497960115, now seen corresponding path program 3 times [2024-06-14 14:56:08,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:56:08,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72972100] [2024-06-14 14:56:08,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:56:08,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:56:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:56:12,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:56:12,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:56:12,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72972100] [2024-06-14 14:56:12,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72972100] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:56:12,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:56:12,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:56:12,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137038003] [2024-06-14 14:56:12,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:56:12,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:56:12,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:56:12,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:56:12,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:56:13,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:56:13,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 210 transitions, 2412 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:13,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:56:13,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:56:13,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:56:13,389 INFO L124 PetriNetUnfolderBase]: 605/1071 cut-off events. [2024-06-14 14:56:13,389 INFO L125 PetriNetUnfolderBase]: For 73958/73958 co-relation queries the response was YES. [2024-06-14 14:56:13,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7831 conditions, 1071 events. 605/1071 cut-off events. For 73958/73958 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5446 event pairs, 133 based on Foata normal form. 4/1074 useless extension candidates. Maximal degree in co-relation 7721. Up to 972 conditions per place. [2024-06-14 14:56:13,399 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 194 selfloop transitions, 36 changer transitions 0/232 dead transitions. [2024-06-14 14:56:13,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 232 transitions, 3035 flow [2024-06-14 14:56:13,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:56:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:56:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-14 14:56:13,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2024-06-14 14:56:13,400 INFO L175 Difference]: Start difference. First operand has 240 places, 210 transitions, 2412 flow. Second operand 10 states and 114 transitions. [2024-06-14 14:56:13,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 232 transitions, 3035 flow [2024-06-14 14:56:13,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 232 transitions, 2975 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 14:56:13,552 INFO L231 Difference]: Finished difference. Result has 244 places, 217 transitions, 2585 flow [2024-06-14 14:56:13,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2352, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2585, PETRI_PLACES=244, PETRI_TRANSITIONS=217} [2024-06-14 14:56:13,552 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2024-06-14 14:56:13,552 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 217 transitions, 2585 flow [2024-06-14 14:56:13,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:13,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:56:13,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:56:13,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 14:56:13,553 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:56:13,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:56:13,553 INFO L85 PathProgramCache]: Analyzing trace with hash -230495218, now seen corresponding path program 1 times [2024-06-14 14:56:13,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:56:13,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930298707] [2024-06-14 14:56:13,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:56:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:56:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:56:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:56:18,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:56:18,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930298707] [2024-06-14 14:56:18,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930298707] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:56:18,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:56:18,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:56:18,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619844094] [2024-06-14 14:56:18,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:56:18,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:56:18,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:56:18,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:56:18,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:56:18,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:56:18,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 217 transitions, 2585 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:18,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:56:18,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:56:18,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:56:18,885 INFO L124 PetriNetUnfolderBase]: 609/1079 cut-off events. [2024-06-14 14:56:18,885 INFO L125 PetriNetUnfolderBase]: For 72300/72300 co-relation queries the response was YES. [2024-06-14 14:56:18,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7998 conditions, 1079 events. 609/1079 cut-off events. For 72300/72300 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5491 event pairs, 145 based on Foata normal form. 2/1080 useless extension candidates. Maximal degree in co-relation 7885. Up to 1036 conditions per place. [2024-06-14 14:56:18,896 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 210 selfloop transitions, 20 changer transitions 0/232 dead transitions. [2024-06-14 14:56:18,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 232 transitions, 3105 flow [2024-06-14 14:56:18,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:56:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:56:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2024-06-14 14:56:18,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31378299120234604 [2024-06-14 14:56:18,898 INFO L175 Difference]: Start difference. First operand has 244 places, 217 transitions, 2585 flow. Second operand 11 states and 107 transitions. [2024-06-14 14:56:18,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 232 transitions, 3105 flow [2024-06-14 14:56:19,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 232 transitions, 3009 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-14 14:56:19,093 INFO L231 Difference]: Finished difference. Result has 249 places, 218 transitions, 2561 flow [2024-06-14 14:56:19,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2489, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2561, PETRI_PLACES=249, PETRI_TRANSITIONS=218} [2024-06-14 14:56:19,094 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 219 predicate places. [2024-06-14 14:56:19,094 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 218 transitions, 2561 flow [2024-06-14 14:56:19,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:19,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:56:19,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:56:19,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 14:56:19,094 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:56:19,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:56:19,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1498161925, now seen corresponding path program 4 times [2024-06-14 14:56:19,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:56:19,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826648551] [2024-06-14 14:56:19,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:56:19,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:56:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:56:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:56:23,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:56:23,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826648551] [2024-06-14 14:56:23,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826648551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:56:23,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:56:23,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:56:23,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227266663] [2024-06-14 14:56:23,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:56:23,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:56:23,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:56:23,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:56:23,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:56:23,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:56:23,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 218 transitions, 2561 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:23,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:56:23,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:56:23,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:56:24,433 INFO L124 PetriNetUnfolderBase]: 605/1073 cut-off events. [2024-06-14 14:56:24,433 INFO L125 PetriNetUnfolderBase]: For 70167/70167 co-relation queries the response was YES. [2024-06-14 14:56:24,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7780 conditions, 1073 events. 605/1073 cut-off events. For 70167/70167 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5464 event pairs, 138 based on Foata normal form. 2/1074 useless extension candidates. Maximal degree in co-relation 7666. Up to 994 conditions per place. [2024-06-14 14:56:24,444 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 204 selfloop transitions, 29 changer transitions 0/235 dead transitions. [2024-06-14 14:56:24,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 235 transitions, 3075 flow [2024-06-14 14:56:24,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:56:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:56:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-14 14:56:24,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-14 14:56:24,446 INFO L175 Difference]: Start difference. First operand has 249 places, 218 transitions, 2561 flow. Second operand 11 states and 116 transitions. [2024-06-14 14:56:24,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 235 transitions, 3075 flow [2024-06-14 14:56:24,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 235 transitions, 2992 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-14 14:56:24,646 INFO L231 Difference]: Finished difference. Result has 252 places, 218 transitions, 2541 flow [2024-06-14 14:56:24,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2478, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2541, PETRI_PLACES=252, PETRI_TRANSITIONS=218} [2024-06-14 14:56:24,647 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places. [2024-06-14 14:56:24,647 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 218 transitions, 2541 flow [2024-06-14 14:56:24,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:24,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:56:24,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:56:24,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 14:56:24,648 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:56:24,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:56:24,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1503674407, now seen corresponding path program 9 times [2024-06-14 14:56:24,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:56:24,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17921863] [2024-06-14 14:56:24,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:56:24,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:56:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:56:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:56:29,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:56:29,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17921863] [2024-06-14 14:56:29,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17921863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:56:29,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:56:29,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:56:29,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643786609] [2024-06-14 14:56:29,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:56:29,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:56:29,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:56:29,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:56:29,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:56:29,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:56:29,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 218 transitions, 2541 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:29,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:56:29,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:56:29,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:56:29,619 INFO L124 PetriNetUnfolderBase]: 609/1082 cut-off events. [2024-06-14 14:56:29,619 INFO L125 PetriNetUnfolderBase]: For 72257/72257 co-relation queries the response was YES. [2024-06-14 14:56:29,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7847 conditions, 1082 events. 609/1082 cut-off events. For 72257/72257 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5519 event pairs, 96 based on Foata normal form. 2/1083 useless extension candidates. Maximal degree in co-relation 7732. Up to 980 conditions per place. [2024-06-14 14:56:29,629 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 198 selfloop transitions, 35 changer transitions 0/235 dead transitions. [2024-06-14 14:56:29,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 235 transitions, 3081 flow [2024-06-14 14:56:29,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:56:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:56:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 14:56:29,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-14 14:56:29,631 INFO L175 Difference]: Start difference. First operand has 252 places, 218 transitions, 2541 flow. Second operand 10 states and 107 transitions. [2024-06-14 14:56:29,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 235 transitions, 3081 flow [2024-06-14 14:56:29,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 235 transitions, 3017 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 14:56:29,806 INFO L231 Difference]: Finished difference. Result has 253 places, 219 transitions, 2583 flow [2024-06-14 14:56:29,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2477, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2583, PETRI_PLACES=253, PETRI_TRANSITIONS=219} [2024-06-14 14:56:29,807 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 223 predicate places. [2024-06-14 14:56:29,807 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 219 transitions, 2583 flow [2024-06-14 14:56:29,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:29,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:56:29,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:56:29,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 14:56:29,807 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:56:29,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:56:29,808 INFO L85 PathProgramCache]: Analyzing trace with hash -685239525, now seen corresponding path program 10 times [2024-06-14 14:56:29,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:56:29,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114644319] [2024-06-14 14:56:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:56:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:56:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:56:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:56:34,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:56:34,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114644319] [2024-06-14 14:56:34,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114644319] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:56:34,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:56:34,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:56:34,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512117522] [2024-06-14 14:56:34,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:56:34,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:56:34,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:56:34,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:56:34,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:56:34,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:56:34,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 219 transitions, 2583 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:34,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:56:34,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:56:34,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:56:34,928 INFO L124 PetriNetUnfolderBase]: 613/1090 cut-off events. [2024-06-14 14:56:34,928 INFO L125 PetriNetUnfolderBase]: For 74852/74852 co-relation queries the response was YES. [2024-06-14 14:56:34,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7964 conditions, 1090 events. 613/1090 cut-off events. For 74852/74852 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5583 event pairs, 96 based on Foata normal form. 2/1091 useless extension candidates. Maximal degree in co-relation 7848. Up to 988 conditions per place. [2024-06-14 14:56:34,939 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 200 selfloop transitions, 34 changer transitions 0/236 dead transitions. [2024-06-14 14:56:34,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 236 transitions, 3125 flow [2024-06-14 14:56:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:56:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:56:34,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 14:56:34,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-14 14:56:34,940 INFO L175 Difference]: Start difference. First operand has 253 places, 219 transitions, 2583 flow. Second operand 10 states and 106 transitions. [2024-06-14 14:56:34,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 236 transitions, 3125 flow [2024-06-14 14:56:35,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 236 transitions, 3029 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-14 14:56:35,143 INFO L231 Difference]: Finished difference. Result has 255 places, 220 transitions, 2593 flow [2024-06-14 14:56:35,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2593, PETRI_PLACES=255, PETRI_TRANSITIONS=220} [2024-06-14 14:56:35,143 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places. [2024-06-14 14:56:35,144 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 220 transitions, 2593 flow [2024-06-14 14:56:35,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:35,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:56:35,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:56:35,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 14:56:35,144 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:56:35,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:56:35,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1503524305, now seen corresponding path program 5 times [2024-06-14 14:56:35,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:56:35,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854489006] [2024-06-14 14:56:35,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:56:35,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:56:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:56:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:56:39,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:56:39,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854489006] [2024-06-14 14:56:39,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854489006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:56:39,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:56:39,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:56:39,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372756130] [2024-06-14 14:56:39,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:56:39,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:56:39,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:56:39,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:56:39,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:56:39,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:56:39,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 220 transitions, 2593 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:39,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:56:39,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:56:39,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:56:40,030 INFO L124 PetriNetUnfolderBase]: 614/1092 cut-off events. [2024-06-14 14:56:40,030 INFO L125 PetriNetUnfolderBase]: For 74687/74687 co-relation queries the response was YES. [2024-06-14 14:56:40,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7929 conditions, 1092 events. 614/1092 cut-off events. For 74687/74687 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5588 event pairs, 98 based on Foata normal form. 2/1093 useless extension candidates. Maximal degree in co-relation 7812. Up to 980 conditions per place. [2024-06-14 14:56:40,044 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 200 selfloop transitions, 38 changer transitions 0/240 dead transitions. [2024-06-14 14:56:40,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 240 transitions, 3175 flow [2024-06-14 14:56:40,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:56:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:56:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-14 14:56:40,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-14 14:56:40,045 INFO L175 Difference]: Start difference. First operand has 255 places, 220 transitions, 2593 flow. Second operand 11 states and 117 transitions. [2024-06-14 14:56:40,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 240 transitions, 3175 flow [2024-06-14 14:56:40,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 240 transitions, 3079 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 14:56:40,267 INFO L231 Difference]: Finished difference. Result has 258 places, 222 transitions, 2636 flow [2024-06-14 14:56:40,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2497, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2636, PETRI_PLACES=258, PETRI_TRANSITIONS=222} [2024-06-14 14:56:40,267 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 228 predicate places. [2024-06-14 14:56:40,267 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 222 transitions, 2636 flow [2024-06-14 14:56:40,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:40,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:56:40,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:56:40,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 14:56:40,268 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:56:40,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:56:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1577409179, now seen corresponding path program 11 times [2024-06-14 14:56:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:56:40,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657657422] [2024-06-14 14:56:40,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:56:40,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:56:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:56:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:56:45,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:56:45,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657657422] [2024-06-14 14:56:45,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657657422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:56:45,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:56:45,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:56:45,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861195715] [2024-06-14 14:56:45,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:56:45,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:56:45,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:56:45,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:56:45,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:56:45,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:56:45,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 222 transitions, 2636 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:45,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:56:45,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:56:45,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:56:45,647 INFO L124 PetriNetUnfolderBase]: 618/1099 cut-off events. [2024-06-14 14:56:45,647 INFO L125 PetriNetUnfolderBase]: For 76908/76908 co-relation queries the response was YES. [2024-06-14 14:56:45,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8005 conditions, 1099 events. 618/1099 cut-off events. For 76908/76908 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5653 event pairs, 106 based on Foata normal form. 2/1100 useless extension candidates. Maximal degree in co-relation 7887. Up to 930 conditions per place. [2024-06-14 14:56:45,657 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 204 selfloop transitions, 32 changer transitions 0/238 dead transitions. [2024-06-14 14:56:45,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 238 transitions, 3178 flow [2024-06-14 14:56:45,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:56:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:56:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2024-06-14 14:56:45,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-14 14:56:45,658 INFO L175 Difference]: Start difference. First operand has 258 places, 222 transitions, 2636 flow. Second operand 9 states and 93 transitions. [2024-06-14 14:56:45,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 238 transitions, 3178 flow [2024-06-14 14:56:45,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 238 transitions, 3065 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-14 14:56:45,891 INFO L231 Difference]: Finished difference. Result has 258 places, 223 transitions, 2633 flow [2024-06-14 14:56:45,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2523, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2633, PETRI_PLACES=258, PETRI_TRANSITIONS=223} [2024-06-14 14:56:45,891 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 228 predicate places. [2024-06-14 14:56:45,892 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 223 transitions, 2633 flow [2024-06-14 14:56:45,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:45,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:56:45,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:56:45,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 14:56:45,892 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:56:45,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:56:45,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1575531509, now seen corresponding path program 12 times [2024-06-14 14:56:45,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:56:45,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32349948] [2024-06-14 14:56:45,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:56:45,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:56:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:56:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:56:49,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:56:49,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32349948] [2024-06-14 14:56:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32349948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:56:49,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:56:49,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:56:49,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691983096] [2024-06-14 14:56:49,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:56:49,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:56:49,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:56:49,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:56:49,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:56:50,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:56:50,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 223 transitions, 2633 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:50,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:56:50,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:56:50,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:56:50,547 INFO L124 PetriNetUnfolderBase]: 622/1107 cut-off events. [2024-06-14 14:56:50,547 INFO L125 PetriNetUnfolderBase]: For 79155/79155 co-relation queries the response was YES. [2024-06-14 14:56:50,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8099 conditions, 1107 events. 622/1107 cut-off events. For 79155/79155 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5699 event pairs, 121 based on Foata normal form. 2/1108 useless extension candidates. Maximal degree in co-relation 7980. Up to 963 conditions per place. [2024-06-14 14:56:50,556 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 190 selfloop transitions, 47 changer transitions 0/239 dead transitions. [2024-06-14 14:56:50,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 239 transitions, 3183 flow [2024-06-14 14:56:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:56:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:56:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-14 14:56:50,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-14 14:56:50,557 INFO L175 Difference]: Start difference. First operand has 258 places, 223 transitions, 2633 flow. Second operand 9 states and 96 transitions. [2024-06-14 14:56:50,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 239 transitions, 3183 flow [2024-06-14 14:56:50,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 239 transitions, 3083 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-14 14:56:50,769 INFO L231 Difference]: Finished difference. Result has 260 places, 224 transitions, 2676 flow [2024-06-14 14:56:50,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2539, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2676, PETRI_PLACES=260, PETRI_TRANSITIONS=224} [2024-06-14 14:56:50,769 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 230 predicate places. [2024-06-14 14:56:50,769 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 224 transitions, 2676 flow [2024-06-14 14:56:50,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:50,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:56:50,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:56:50,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 14:56:50,770 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:56:50,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:56:50,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1492414464, now seen corresponding path program 3 times [2024-06-14 14:56:50,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:56:50,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281859869] [2024-06-14 14:56:50,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:56:50,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:56:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:56:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:56:55,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:56:55,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281859869] [2024-06-14 14:56:55,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281859869] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:56:55,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:56:55,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:56:55,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4345401] [2024-06-14 14:56:55,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:56:55,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:56:55,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:56:55,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:56:55,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:56:55,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:56:55,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 224 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-14 14:56:55,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:56:55,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:56:55,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:56:56,038 INFO L124 PetriNetUnfolderBase]: 620/1104 cut-off events. [2024-06-14 14:56:56,038 INFO L125 PetriNetUnfolderBase]: For 70093/70093 co-relation queries the response was YES. [2024-06-14 14:56:56,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7913 conditions, 1104 events. 620/1104 cut-off events. For 70093/70093 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5689 event pairs, 118 based on Foata normal form. 1/1104 useless extension candidates. Maximal degree in co-relation 7793. Up to 951 conditions per place. [2024-06-14 14:56:56,051 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 183 selfloop transitions, 56 changer transitions 0/241 dead transitions. [2024-06-14 14:56:56,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 241 transitions, 3260 flow [2024-06-14 14:56:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:56:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:56:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 14:56:56,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-14 14:56:56,053 INFO L175 Difference]: Start difference. First operand has 260 places, 224 transitions, 2676 flow. Second operand 9 states and 97 transitions. [2024-06-14 14:56:56,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 241 transitions, 3260 flow [2024-06-14 14:56:56,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 241 transitions, 3143 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 14:56:56,269 INFO L231 Difference]: Finished difference. Result has 262 places, 226 transitions, 2759 flow [2024-06-14 14:56:56,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2559, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2759, PETRI_PLACES=262, PETRI_TRANSITIONS=226} [2024-06-14 14:56:56,269 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 232 predicate places. [2024-06-14 14:56:56,270 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 226 transitions, 2759 flow [2024-06-14 14:56:56,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:56:56,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:56:56,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:56:56,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 14:56:56,270 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:56:56,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:56:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1575535229, now seen corresponding path program 13 times [2024-06-14 14:56:56,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:56:56,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447175697] [2024-06-14 14:56:56,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:56:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:56:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:57:01,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-14 14:57:01,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:57:01,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447175697] [2024-06-14 14:57:01,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447175697] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:57:01,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:57:01,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:57:01,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487737674] [2024-06-14 14:57:01,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:57:01,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:57:01,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:57:01,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:57:01,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:57:01,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:57:01,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 226 transitions, 2759 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:01,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:57:01,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:57:01,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:57:02,008 INFO L124 PetriNetUnfolderBase]: 624/1112 cut-off events. [2024-06-14 14:57:02,008 INFO L125 PetriNetUnfolderBase]: For 70010/70010 co-relation queries the response was YES. [2024-06-14 14:57:02,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7962 conditions, 1112 events. 624/1112 cut-off events. For 70010/70010 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5776 event pairs, 116 based on Foata normal form. 2/1113 useless extension candidates. Maximal degree in co-relation 7841. Up to 977 conditions per place. [2024-06-14 14:57:02,020 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 202 selfloop transitions, 38 changer transitions 0/242 dead transitions. [2024-06-14 14:57:02,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 242 transitions, 3305 flow [2024-06-14 14:57:02,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:57:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:57:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-06-14 14:57:02,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34050179211469533 [2024-06-14 14:57:02,022 INFO L175 Difference]: Start difference. First operand has 262 places, 226 transitions, 2759 flow. Second operand 9 states and 95 transitions. [2024-06-14 14:57:02,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 242 transitions, 3305 flow [2024-06-14 14:57:02,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 242 transitions, 3171 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-14 14:57:02,238 INFO L231 Difference]: Finished difference. Result has 264 places, 227 transitions, 2739 flow [2024-06-14 14:57:02,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2625, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2739, PETRI_PLACES=264, PETRI_TRANSITIONS=227} [2024-06-14 14:57:02,239 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 234 predicate places. [2024-06-14 14:57:02,239 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 227 transitions, 2739 flow [2024-06-14 14:57:02,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:02,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:57:02,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:57:02,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 14:57:02,239 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:57:02,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:57:02,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1884753271, now seen corresponding path program 6 times [2024-06-14 14:57:02,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:57:02,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952076495] [2024-06-14 14:57:02,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:57:02,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:57:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:57:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:57:07,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:57:07,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952076495] [2024-06-14 14:57:07,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952076495] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:57:07,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:57:07,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:57:07,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238989079] [2024-06-14 14:57:07,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:57:07,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:57:07,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:57:07,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:57:07,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:57:07,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:57:07,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 227 transitions, 2739 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:07,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:57:07,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:57:07,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:57:07,784 INFO L124 PetriNetUnfolderBase]: 630/1123 cut-off events. [2024-06-14 14:57:07,785 INFO L125 PetriNetUnfolderBase]: For 72138/72138 co-relation queries the response was YES. [2024-06-14 14:57:07,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8033 conditions, 1123 events. 630/1123 cut-off events. For 72138/72138 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5846 event pairs, 100 based on Foata normal form. 2/1124 useless extension candidates. Maximal degree in co-relation 7911. Up to 972 conditions per place. [2024-06-14 14:57:07,795 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 196 selfloop transitions, 48 changer transitions 0/246 dead transitions. [2024-06-14 14:57:07,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 246 transitions, 3323 flow [2024-06-14 14:57:07,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:57:07,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:57:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 14:57:07,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-14 14:57:07,796 INFO L175 Difference]: Start difference. First operand has 264 places, 227 transitions, 2739 flow. Second operand 10 states and 106 transitions. [2024-06-14 14:57:07,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 246 transitions, 3323 flow [2024-06-14 14:57:07,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 246 transitions, 3223 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 14:57:07,994 INFO L231 Difference]: Finished difference. Result has 267 places, 229 transitions, 2798 flow [2024-06-14 14:57:07,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2639, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2798, PETRI_PLACES=267, PETRI_TRANSITIONS=229} [2024-06-14 14:57:07,994 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 237 predicate places. [2024-06-14 14:57:07,994 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 229 transitions, 2798 flow [2024-06-14 14:57:07,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:07,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:57:07,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:57:07,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 14:57:07,995 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:57:07,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:57:07,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1694629427, now seen corresponding path program 14 times [2024-06-14 14:57:07,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:57:07,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473722804] [2024-06-14 14:57:07,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:57:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:57:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:57:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:57:12,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:57:12,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473722804] [2024-06-14 14:57:12,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473722804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:57:12,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:57:12,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:57:12,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714426043] [2024-06-14 14:57:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:57:12,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:57:12,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:57:12,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:57:12,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:57:12,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:57:12,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 229 transitions, 2798 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:12,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:57:12,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:57:12,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:57:12,632 INFO L124 PetriNetUnfolderBase]: 634/1130 cut-off events. [2024-06-14 14:57:12,633 INFO L125 PetriNetUnfolderBase]: For 70395/70395 co-relation queries the response was YES. [2024-06-14 14:57:12,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8080 conditions, 1130 events. 634/1130 cut-off events. For 70395/70395 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5882 event pairs, 149 based on Foata normal form. 2/1131 useless extension candidates. Maximal degree in co-relation 7957. Up to 1069 conditions per place. [2024-06-14 14:57:12,644 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 216 selfloop transitions, 24 changer transitions 0/242 dead transitions. [2024-06-14 14:57:12,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 242 transitions, 3334 flow [2024-06-14 14:57:12,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:57:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:57:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-14 14:57:12,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32616487455197135 [2024-06-14 14:57:12,646 INFO L175 Difference]: Start difference. First operand has 267 places, 229 transitions, 2798 flow. Second operand 9 states and 91 transitions. [2024-06-14 14:57:12,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 242 transitions, 3334 flow [2024-06-14 14:57:12,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 242 transitions, 3211 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-14 14:57:12,863 INFO L231 Difference]: Finished difference. Result has 268 places, 230 transitions, 2757 flow [2024-06-14 14:57:12,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2675, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2757, PETRI_PLACES=268, PETRI_TRANSITIONS=230} [2024-06-14 14:57:12,863 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 238 predicate places. [2024-06-14 14:57:12,863 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 230 transitions, 2757 flow [2024-06-14 14:57:12,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:12,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:57:12,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:57:12,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 14:57:12,864 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:57:12,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:57:12,864 INFO L85 PathProgramCache]: Analyzing trace with hash 246318631, now seen corresponding path program 7 times [2024-06-14 14:57:12,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:57:12,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417568655] [2024-06-14 14:57:12,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:57:12,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:57:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:57:17,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-14 14:57:17,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:57:17,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417568655] [2024-06-14 14:57:17,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417568655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:57:17,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:57:17,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:57:17,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407233632] [2024-06-14 14:57:17,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:57:17,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:57:17,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:57:17,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:57:17,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:57:18,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:57:18,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 230 transitions, 2757 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:18,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:57:18,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:57:18,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:57:18,434 INFO L124 PetriNetUnfolderBase]: 630/1124 cut-off events. [2024-06-14 14:57:18,434 INFO L125 PetriNetUnfolderBase]: For 67764/67764 co-relation queries the response was YES. [2024-06-14 14:57:18,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7843 conditions, 1124 events. 630/1124 cut-off events. For 67764/67764 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5879 event pairs, 140 based on Foata normal form. 2/1125 useless extension candidates. Maximal degree in co-relation 7719. Up to 1025 conditions per place. [2024-06-14 14:57:18,445 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 206 selfloop transitions, 36 changer transitions 0/244 dead transitions. [2024-06-14 14:57:18,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 244 transitions, 3279 flow [2024-06-14 14:57:18,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:57:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:57:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-14 14:57:18,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33225806451612905 [2024-06-14 14:57:18,446 INFO L175 Difference]: Start difference. First operand has 268 places, 230 transitions, 2757 flow. Second operand 10 states and 103 transitions. [2024-06-14 14:57:18,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 244 transitions, 3279 flow [2024-06-14 14:57:18,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 244 transitions, 3187 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-14 14:57:18,665 INFO L231 Difference]: Finished difference. Result has 271 places, 230 transitions, 2745 flow [2024-06-14 14:57:18,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2665, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2745, PETRI_PLACES=271, PETRI_TRANSITIONS=230} [2024-06-14 14:57:18,665 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 241 predicate places. [2024-06-14 14:57:18,665 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 230 transitions, 2745 flow [2024-06-14 14:57:18,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:18,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:57:18,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:57:18,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 14:57:18,666 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:57:18,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:57:18,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1910549379, now seen corresponding path program 15 times [2024-06-14 14:57:18,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:57:18,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436579742] [2024-06-14 14:57:18,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:57:18,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:57:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:57:23,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-14 14:57:23,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:57:23,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436579742] [2024-06-14 14:57:23,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436579742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:57:23,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:57:23,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:57:23,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651681991] [2024-06-14 14:57:23,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:57:23,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:57:23,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:57:23,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:57:23,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:57:23,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:57:23,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 230 transitions, 2745 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:23,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:57:23,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:57:23,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:57:23,941 INFO L124 PetriNetUnfolderBase]: 634/1133 cut-off events. [2024-06-14 14:57:23,941 INFO L125 PetriNetUnfolderBase]: For 67542/67542 co-relation queries the response was YES. [2024-06-14 14:57:23,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7881 conditions, 1133 events. 634/1133 cut-off events. For 67542/67542 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 5926 event pairs, 92 based on Foata normal form. 2/1134 useless extension candidates. Maximal degree in co-relation 7756. Up to 999 conditions per place. [2024-06-14 14:57:23,952 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 200 selfloop transitions, 43 changer transitions 0/245 dead transitions. [2024-06-14 14:57:23,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 245 transitions, 3295 flow [2024-06-14 14:57:23,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:57:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:57:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-14 14:57:23,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-14 14:57:23,954 INFO L175 Difference]: Start difference. First operand has 271 places, 230 transitions, 2745 flow. Second operand 9 states and 96 transitions. [2024-06-14 14:57:23,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 245 transitions, 3295 flow [2024-06-14 14:57:24,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 245 transitions, 3204 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 14:57:24,147 INFO L231 Difference]: Finished difference. Result has 271 places, 231 transitions, 2774 flow [2024-06-14 14:57:24,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2654, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2774, PETRI_PLACES=271, PETRI_TRANSITIONS=231} [2024-06-14 14:57:24,147 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 241 predicate places. [2024-06-14 14:57:24,147 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 231 transitions, 2774 flow [2024-06-14 14:57:24,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:24,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:57:24,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-14 14:57:24,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 14:57:24,148 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:57:24,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:57:24,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1689119177, now seen corresponding path program 16 times [2024-06-14 14:57:24,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:57:24,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257808206] [2024-06-14 14:57:24,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:57:24,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:57:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:57:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:57:29,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:57:29,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257808206] [2024-06-14 14:57:29,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257808206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:57:29,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:57:29,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:57:29,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194414193] [2024-06-14 14:57:29,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:57:29,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:57:29,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:57:29,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:57:29,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:57:29,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:57:29,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 231 transitions, 2774 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-14 14:57:29,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:57:29,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:57:29,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:57:29,803 INFO L124 PetriNetUnfolderBase]: 638/1141 cut-off events. [2024-06-14 14:57:29,803 INFO L125 PetriNetUnfolderBase]: For 68065/68065 co-relation queries the response was YES. [2024-06-14 14:57:29,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7956 conditions, 1141 events. 638/1141 cut-off events. For 68065/68065 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 5979 event pairs, 86 based on Foata normal form. 2/1142 useless extension candidates. Maximal degree in co-relation 7831. Up to 928 conditions per place. [2024-06-14 14:57:29,814 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 185 selfloop transitions, 59 changer transitions 0/246 dead transitions. [2024-06-14 14:57:29,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 246 transitions, 3326 flow [2024-06-14 14:57:29,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:57:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:57:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 14:57:29,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-14 14:57:29,814 INFO L175 Difference]: Start difference. First operand has 271 places, 231 transitions, 2774 flow. Second operand 9 states and 98 transitions. [2024-06-14 14:57:29,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 246 transitions, 3326 flow [2024-06-14 14:57:30,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 246 transitions, 3216 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 14:57:30,053 INFO L231 Difference]: Finished difference. Result has 273 places, 232 transitions, 2818 flow [2024-06-14 14:57:30,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2666, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2818, PETRI_PLACES=273, PETRI_TRANSITIONS=232} [2024-06-14 14:57:30,053 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 243 predicate places. [2024-06-14 14:57:30,053 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 232 transitions, 2818 flow [2024-06-14 14:57:30,054 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-14 14:57:30,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:57:30,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:57:30,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 14:57:30,054 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:57:30,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:57:30,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1689272999, now seen corresponding path program 8 times [2024-06-14 14:57:30,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:57:30,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607672965] [2024-06-14 14:57:30,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:57:30,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:57:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:57:34,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:57:34,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:57:34,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607672965] [2024-06-14 14:57:34,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607672965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:57:34,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:57:34,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:57:34,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255965696] [2024-06-14 14:57:34,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:57:34,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:57:34,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:57:34,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:57:34,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:57:34,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:57:34,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 232 transitions, 2818 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:34,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:57:34,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:57:34,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:57:35,446 INFO L124 PetriNetUnfolderBase]: 639/1142 cut-off events. [2024-06-14 14:57:35,446 INFO L125 PetriNetUnfolderBase]: For 65906/65906 co-relation queries the response was YES. [2024-06-14 14:57:35,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7940 conditions, 1142 events. 639/1142 cut-off events. For 65906/65906 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6004 event pairs, 117 based on Foata normal form. 2/1140 useless extension candidates. Maximal degree in co-relation 7814. Up to 1040 conditions per place. [2024-06-14 14:57:35,458 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 213 selfloop transitions, 34 changer transitions 0/249 dead transitions. [2024-06-14 14:57:35,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 249 transitions, 3408 flow [2024-06-14 14:57:35,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:57:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:57:35,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-14 14:57:35,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-14 14:57:35,459 INFO L175 Difference]: Start difference. First operand has 273 places, 232 transitions, 2818 flow. Second operand 11 states and 116 transitions. [2024-06-14 14:57:35,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 249 transitions, 3408 flow [2024-06-14 14:57:35,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 249 transitions, 3268 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 14:57:35,657 INFO L231 Difference]: Finished difference. Result has 277 places, 234 transitions, 2807 flow [2024-06-14 14:57:35,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2678, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2807, PETRI_PLACES=277, PETRI_TRANSITIONS=234} [2024-06-14 14:57:35,657 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 247 predicate places. [2024-06-14 14:57:35,657 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 234 transitions, 2807 flow [2024-06-14 14:57:35,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:35,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:57:35,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:57:35,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 14:57:35,658 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:57:35,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:57:35,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1694844908, now seen corresponding path program 2 times [2024-06-14 14:57:35,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:57:35,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915750557] [2024-06-14 14:57:35,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:57:35,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:57:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:57:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:57:41,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:57:41,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915750557] [2024-06-14 14:57:41,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915750557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:57:41,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:57:41,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:57:41,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005090166] [2024-06-14 14:57:41,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:57:41,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:57:41,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:57:41,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:57:41,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:57:41,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:57:41,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 234 transitions, 2807 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:41,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:57:41,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:57:41,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:57:41,925 INFO L124 PetriNetUnfolderBase]: 643/1150 cut-off events. [2024-06-14 14:57:41,925 INFO L125 PetriNetUnfolderBase]: For 65797/65797 co-relation queries the response was YES. [2024-06-14 14:57:41,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7905 conditions, 1150 events. 643/1150 cut-off events. For 65797/65797 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6060 event pairs, 157 based on Foata normal form. 2/1150 useless extension candidates. Maximal degree in co-relation 7778. Up to 1107 conditions per place. [2024-06-14 14:57:41,937 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 224 selfloop transitions, 20 changer transitions 0/246 dead transitions. [2024-06-14 14:57:41,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 246 transitions, 3349 flow [2024-06-14 14:57:41,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:57:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:57:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2024-06-14 14:57:41,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30498533724340177 [2024-06-14 14:57:41,938 INFO L175 Difference]: Start difference. First operand has 277 places, 234 transitions, 2807 flow. Second operand 11 states and 104 transitions. [2024-06-14 14:57:41,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 246 transitions, 3349 flow [2024-06-14 14:57:42,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 246 transitions, 3199 flow, removed 32 selfloop flow, removed 13 redundant places. [2024-06-14 14:57:42,153 INFO L231 Difference]: Finished difference. Result has 275 places, 235 transitions, 2731 flow [2024-06-14 14:57:42,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2731, PETRI_PLACES=275, PETRI_TRANSITIONS=235} [2024-06-14 14:57:42,154 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 245 predicate places. [2024-06-14 14:57:42,154 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 235 transitions, 2731 flow [2024-06-14 14:57:42,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:42,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:57:42,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:57:42,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 14:57:42,154 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:57:42,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:57:42,154 INFO L85 PathProgramCache]: Analyzing trace with hash 639909787, now seen corresponding path program 17 times [2024-06-14 14:57:42,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:57:42,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059507001] [2024-06-14 14:57:42,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:57:42,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:57:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:57:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:57:46,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:57:46,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059507001] [2024-06-14 14:57:46,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059507001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:57:46,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:57:46,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:57:46,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874861846] [2024-06-14 14:57:46,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:57:46,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:57:46,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:57:46,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:57:46,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:57:46,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:57:46,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 235 transitions, 2731 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:46,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:57:46,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:57:46,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:57:46,912 INFO L124 PetriNetUnfolderBase]: 647/1159 cut-off events. [2024-06-14 14:57:46,912 INFO L125 PetriNetUnfolderBase]: For 67447/67447 co-relation queries the response was YES. [2024-06-14 14:57:46,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7845 conditions, 1159 events. 647/1159 cut-off events. For 67447/67447 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6115 event pairs, 96 based on Foata normal form. 2/1156 useless extension candidates. Maximal degree in co-relation 7722. Up to 1027 conditions per place. [2024-06-14 14:57:46,925 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 204 selfloop transitions, 42 changer transitions 0/248 dead transitions. [2024-06-14 14:57:46,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 248 transitions, 3281 flow [2024-06-14 14:57:46,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:57:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:57:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-06-14 14:57:46,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34050179211469533 [2024-06-14 14:57:46,926 INFO L175 Difference]: Start difference. First operand has 275 places, 235 transitions, 2731 flow. Second operand 9 states and 95 transitions. [2024-06-14 14:57:46,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 248 transitions, 3281 flow [2024-06-14 14:57:47,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 248 transitions, 3161 flow, removed 19 selfloop flow, removed 12 redundant places. [2024-06-14 14:57:47,137 INFO L231 Difference]: Finished difference. Result has 272 places, 236 transitions, 2727 flow [2024-06-14 14:57:47,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2611, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2727, PETRI_PLACES=272, PETRI_TRANSITIONS=236} [2024-06-14 14:57:47,137 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 242 predicate places. [2024-06-14 14:57:47,138 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 236 transitions, 2727 flow [2024-06-14 14:57:47,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:47,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:57:47,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:57:47,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 14:57:47,138 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:57:47,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:57:47,138 INFO L85 PathProgramCache]: Analyzing trace with hash 99424713, now seen corresponding path program 18 times [2024-06-14 14:57:47,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:57:47,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498779570] [2024-06-14 14:57:47,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:57:47,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:57:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:57:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:57:51,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:57:51,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498779570] [2024-06-14 14:57:51,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498779570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:57:51,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:57:51,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:57:51,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403235342] [2024-06-14 14:57:51,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:57:51,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:57:51,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:57:51,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:57:51,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:57:51,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:57:51,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 236 transitions, 2727 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:51,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:57:51,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:57:51,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:57:51,643 INFO L124 PetriNetUnfolderBase]: 651/1167 cut-off events. [2024-06-14 14:57:51,643 INFO L125 PetriNetUnfolderBase]: For 69355/69355 co-relation queries the response was YES. [2024-06-14 14:57:51,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7900 conditions, 1167 events. 651/1167 cut-off events. For 69355/69355 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6164 event pairs, 94 based on Foata normal form. 2/1164 useless extension candidates. Maximal degree in co-relation 7778. Up to 1035 conditions per place. [2024-06-14 14:57:51,654 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 206 selfloop transitions, 41 changer transitions 0/249 dead transitions. [2024-06-14 14:57:51,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 249 transitions, 3279 flow [2024-06-14 14:57:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:57:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:57:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-14 14:57:51,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36917562724014336 [2024-06-14 14:57:51,655 INFO L175 Difference]: Start difference. First operand has 272 places, 236 transitions, 2727 flow. Second operand 9 states and 103 transitions. [2024-06-14 14:57:51,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 249 transitions, 3279 flow [2024-06-14 14:57:51,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 249 transitions, 3173 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-14 14:57:51,853 INFO L231 Difference]: Finished difference. Result has 274 places, 237 transitions, 2737 flow [2024-06-14 14:57:51,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2621, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2737, PETRI_PLACES=274, PETRI_TRANSITIONS=237} [2024-06-14 14:57:51,854 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 244 predicate places. [2024-06-14 14:57:51,854 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 237 transitions, 2737 flow [2024-06-14 14:57:51,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:57:51,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:57:51,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:57:51,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 14:57:51,854 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:57:51,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:57:51,854 INFO L85 PathProgramCache]: Analyzing trace with hash -879582625, now seen corresponding path program 19 times [2024-06-14 14:57:51,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:57:51,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467653975] [2024-06-14 14:57:51,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:57:51,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:57:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:57:55,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:57:55,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:57:55,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467653975] [2024-06-14 14:57:55,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467653975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:57:55,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:57:55,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:57:55,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29467243] [2024-06-14 14:57:55,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:57:55,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:57:55,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:57:55,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:57:55,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:57:56,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:57:56,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 237 transitions, 2737 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-14 14:57:56,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:57:56,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:57:56,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:57:56,445 INFO L124 PetriNetUnfolderBase]: 655/1175 cut-off events. [2024-06-14 14:57:56,446 INFO L125 PetriNetUnfolderBase]: For 71557/71557 co-relation queries the response was YES. [2024-06-14 14:57:56,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7961 conditions, 1175 events. 655/1175 cut-off events. For 71557/71557 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6248 event pairs, 153 based on Foata normal form. 2/1174 useless extension candidates. Maximal degree in co-relation 7838. Up to 1092 conditions per place. [2024-06-14 14:57:56,458 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 216 selfloop transitions, 31 changer transitions 0/249 dead transitions. [2024-06-14 14:57:56,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 249 transitions, 3289 flow [2024-06-14 14:57:56,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:57:56,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:57:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2024-06-14 14:57:56,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-14 14:57:56,459 INFO L175 Difference]: Start difference. First operand has 274 places, 237 transitions, 2737 flow. Second operand 9 states and 93 transitions. [2024-06-14 14:57:56,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 249 transitions, 3289 flow [2024-06-14 14:57:56,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 249 transitions, 3183 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 14:57:56,685 INFO L231 Difference]: Finished difference. Result has 276 places, 238 transitions, 2729 flow [2024-06-14 14:57:56,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2631, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2729, PETRI_PLACES=276, PETRI_TRANSITIONS=238} [2024-06-14 14:57:56,685 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 246 predicate places. [2024-06-14 14:57:56,685 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 238 transitions, 2729 flow [2024-06-14 14:57:56,685 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-14 14:57:56,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:57:56,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:57:56,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 14:57:56,686 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:57:56,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:57:56,686 INFO L85 PathProgramCache]: Analyzing trace with hash -879576673, now seen corresponding path program 9 times [2024-06-14 14:57:56,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:57:56,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481763635] [2024-06-14 14:57:56,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:57:56,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:57:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:01,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:01,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481763635] [2024-06-14 14:58:01,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481763635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:01,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:01,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:58:01,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951748286] [2024-06-14 14:58:01,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:01,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:58:01,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:01,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:58:01,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:58:01,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:58:01,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 238 transitions, 2729 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:01,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:01,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:58:01,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:02,095 INFO L124 PetriNetUnfolderBase]: 661/1185 cut-off events. [2024-06-14 14:58:02,095 INFO L125 PetriNetUnfolderBase]: For 73709/73709 co-relation queries the response was YES. [2024-06-14 14:58:02,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8005 conditions, 1185 events. 661/1185 cut-off events. For 73709/73709 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6338 event pairs, 145 based on Foata normal form. 2/1184 useless extension candidates. Maximal degree in co-relation 7881. Up to 1020 conditions per place. [2024-06-14 14:58:02,109 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 201 selfloop transitions, 53 changer transitions 0/256 dead transitions. [2024-06-14 14:58:02,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 256 transitions, 3335 flow [2024-06-14 14:58:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:58:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:58:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2024-06-14 14:58:02,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3313782991202346 [2024-06-14 14:58:02,110 INFO L175 Difference]: Start difference. First operand has 276 places, 238 transitions, 2729 flow. Second operand 11 states and 113 transitions. [2024-06-14 14:58:02,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 256 transitions, 3335 flow [2024-06-14 14:58:02,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 256 transitions, 3247 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 14:58:02,356 INFO L231 Difference]: Finished difference. Result has 282 places, 243 transitions, 2858 flow [2024-06-14 14:58:02,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2641, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2858, PETRI_PLACES=282, PETRI_TRANSITIONS=243} [2024-06-14 14:58:02,357 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 252 predicate places. [2024-06-14 14:58:02,357 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 243 transitions, 2858 flow [2024-06-14 14:58:02,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-14 14:58:02,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:02,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-14 14:58:02,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 14:58:02,357 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:58:02,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:02,358 INFO L85 PathProgramCache]: Analyzing trace with hash 105150444, now seen corresponding path program 3 times [2024-06-14 14:58:02,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:02,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974969533] [2024-06-14 14:58:02,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:02,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:07,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:07,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:07,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974969533] [2024-06-14 14:58:07,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974969533] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:07,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:07,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:58:07,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042760333] [2024-06-14 14:58:07,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:07,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:58:07,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:07,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:58:07,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:58:07,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:58:07,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 243 transitions, 2858 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:07,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:07,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:58:07,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:08,067 INFO L124 PetriNetUnfolderBase]: 665/1193 cut-off events. [2024-06-14 14:58:08,067 INFO L125 PetriNetUnfolderBase]: For 75376/75376 co-relation queries the response was YES. [2024-06-14 14:58:08,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8199 conditions, 1193 events. 665/1193 cut-off events. For 75376/75376 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6361 event pairs, 163 based on Foata normal form. 2/1192 useless extension candidates. Maximal degree in co-relation 8072. Up to 1140 conditions per place. [2024-06-14 14:58:08,078 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 229 selfloop transitions, 22 changer transitions 0/253 dead transitions. [2024-06-14 14:58:08,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 253 transitions, 3410 flow [2024-06-14 14:58:08,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:58:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:58:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2024-06-14 14:58:08,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-14 14:58:08,079 INFO L175 Difference]: Start difference. First operand has 282 places, 243 transitions, 2858 flow. Second operand 9 states and 90 transitions. [2024-06-14 14:58:08,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 253 transitions, 3410 flow [2024-06-14 14:58:08,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 253 transitions, 3313 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 14:58:08,303 INFO L231 Difference]: Finished difference. Result has 284 places, 244 transitions, 2841 flow [2024-06-14 14:58:08,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2761, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2841, PETRI_PLACES=284, PETRI_TRANSITIONS=244} [2024-06-14 14:58:08,303 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 254 predicate places. [2024-06-14 14:58:08,303 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 244 transitions, 2841 flow [2024-06-14 14:58:08,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:08,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:08,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:58:08,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 14:58:08,304 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:58:08,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:08,305 INFO L85 PathProgramCache]: Analyzing trace with hash 645416317, now seen corresponding path program 20 times [2024-06-14 14:58:08,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:08,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025989588] [2024-06-14 14:58:08,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:08,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:13,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:13,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025989588] [2024-06-14 14:58:13,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025989588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:13,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:13,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:58:13,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778461200] [2024-06-14 14:58:13,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:13,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:58:13,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:13,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:58:13,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:58:13,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:58:13,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 244 transitions, 2841 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:13,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:13,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:58:13,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:13,608 INFO L124 PetriNetUnfolderBase]: 662/1188 cut-off events. [2024-06-14 14:58:13,608 INFO L125 PetriNetUnfolderBase]: For 71958/71958 co-relation queries the response was YES. [2024-06-14 14:58:13,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7952 conditions, 1188 events. 662/1188 cut-off events. For 71958/71958 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6351 event pairs, 160 based on Foata normal form. 2/1187 useless extension candidates. Maximal degree in co-relation 7824. Up to 1135 conditions per place. [2024-06-14 14:58:13,619 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 231 selfloop transitions, 21 changer transitions 0/254 dead transitions. [2024-06-14 14:58:13,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 254 transitions, 3369 flow [2024-06-14 14:58:13,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:58:13,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:58:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2024-06-14 14:58:13,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-14 14:58:13,621 INFO L175 Difference]: Start difference. First operand has 284 places, 244 transitions, 2841 flow. Second operand 9 states and 90 transitions. [2024-06-14 14:58:13,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 254 transitions, 3369 flow [2024-06-14 14:58:13,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 254 transitions, 3299 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 14:58:13,863 INFO L231 Difference]: Finished difference. Result has 286 places, 244 transitions, 2817 flow [2024-06-14 14:58:13,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2771, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2817, PETRI_PLACES=286, PETRI_TRANSITIONS=244} [2024-06-14 14:58:13,864 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 256 predicate places. [2024-06-14 14:58:13,864 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 244 transitions, 2817 flow [2024-06-14 14:58:13,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:13,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:13,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:58:13,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 14:58:13,864 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:58:13,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1086164489, now seen corresponding path program 10 times [2024-06-14 14:58:13,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:13,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053540523] [2024-06-14 14:58:13,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:13,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:18,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:18,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053540523] [2024-06-14 14:58:18,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053540523] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:18,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:18,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:58:18,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10574233] [2024-06-14 14:58:18,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:18,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:58:18,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:18,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:58:18,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:58:18,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:58:18,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 244 transitions, 2817 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:18,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:18,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:58:18,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:19,362 INFO L124 PetriNetUnfolderBase]: 668/1198 cut-off events. [2024-06-14 14:58:19,362 INFO L125 PetriNetUnfolderBase]: For 73470/73470 co-relation queries the response was YES. [2024-06-14 14:58:19,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7993 conditions, 1198 events. 668/1198 cut-off events. For 73470/73470 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 6422 event pairs, 157 based on Foata normal form. 2/1197 useless extension candidates. Maximal degree in co-relation 7864. Up to 1106 conditions per place. [2024-06-14 14:58:19,373 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 226 selfloop transitions, 32 changer transitions 0/260 dead transitions. [2024-06-14 14:58:19,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 260 transitions, 3557 flow [2024-06-14 14:58:19,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:58:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:58:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 14:58:19,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-14 14:58:19,375 INFO L175 Difference]: Start difference. First operand has 286 places, 244 transitions, 2817 flow. Second operand 10 states and 107 transitions. [2024-06-14 14:58:19,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 260 transitions, 3557 flow [2024-06-14 14:58:19,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 260 transitions, 3426 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 14:58:19,627 INFO L231 Difference]: Finished difference. Result has 288 places, 246 transitions, 2793 flow [2024-06-14 14:58:19,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2686, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2793, PETRI_PLACES=288, PETRI_TRANSITIONS=246} [2024-06-14 14:58:19,627 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 258 predicate places. [2024-06-14 14:58:19,627 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 246 transitions, 2793 flow [2024-06-14 14:58:19,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:19,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:19,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:58:19,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 14:58:19,628 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:58:19,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:19,628 INFO L85 PathProgramCache]: Analyzing trace with hash 889248435, now seen corresponding path program 11 times [2024-06-14 14:58:19,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:19,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680335800] [2024-06-14 14:58:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:19,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:25,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:25,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680335800] [2024-06-14 14:58:25,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680335800] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:25,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:25,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:58:25,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398428753] [2024-06-14 14:58:25,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:25,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:58:25,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:25,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:58:25,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:58:25,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:58:25,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 246 transitions, 2793 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:25,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:25,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:58:25,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:25,630 INFO L124 PetriNetUnfolderBase]: 664/1192 cut-off events. [2024-06-14 14:58:25,630 INFO L125 PetriNetUnfolderBase]: For 69255/69255 co-relation queries the response was YES. [2024-06-14 14:58:25,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7731 conditions, 1192 events. 664/1192 cut-off events. For 69255/69255 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 6380 event pairs, 221 based on Foata normal form. 2/1193 useless extension candidates. Maximal degree in co-relation 7601. Up to 1137 conditions per place. [2024-06-14 14:58:25,642 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 233 selfloop transitions, 22 changer transitions 0/257 dead transitions. [2024-06-14 14:58:25,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 257 transitions, 3331 flow [2024-06-14 14:58:25,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:58:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:58:25,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2024-06-14 14:58:25,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31085043988269795 [2024-06-14 14:58:25,643 INFO L175 Difference]: Start difference. First operand has 288 places, 246 transitions, 2793 flow. Second operand 11 states and 106 transitions. [2024-06-14 14:58:25,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 257 transitions, 3331 flow [2024-06-14 14:58:25,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 257 transitions, 3215 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-14 14:58:25,890 INFO L231 Difference]: Finished difference. Result has 291 places, 246 transitions, 2726 flow [2024-06-14 14:58:25,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2677, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2726, PETRI_PLACES=291, PETRI_TRANSITIONS=246} [2024-06-14 14:58:25,891 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 261 predicate places. [2024-06-14 14:58:25,891 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 246 transitions, 2726 flow [2024-06-14 14:58:25,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:25,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:25,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:58:25,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-14 14:58:25,892 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:58:25,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:25,892 INFO L85 PathProgramCache]: Analyzing trace with hash -622866634, now seen corresponding path program 4 times [2024-06-14 14:58:25,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:25,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967377292] [2024-06-14 14:58:25,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:25,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:31,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:31,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967377292] [2024-06-14 14:58:31,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967377292] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:31,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:31,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:58:31,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931832552] [2024-06-14 14:58:31,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:31,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:58:31,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:31,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:58:31,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:58:31,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:58:31,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 246 transitions, 2726 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:31,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:31,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:58:31,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:31,831 INFO L124 PetriNetUnfolderBase]: 671/1205 cut-off events. [2024-06-14 14:58:31,832 INFO L125 PetriNetUnfolderBase]: For 71211/71211 co-relation queries the response was YES. [2024-06-14 14:58:31,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7771 conditions, 1205 events. 671/1205 cut-off events. For 71211/71211 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 6454 event pairs, 225 based on Foata normal form. 2/1206 useless extension candidates. Maximal degree in co-relation 7640. Up to 1169 conditions per place. [2024-06-14 14:58:31,845 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 241 selfloop transitions, 16 changer transitions 0/259 dead transitions. [2024-06-14 14:58:31,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 259 transitions, 3318 flow [2024-06-14 14:58:31,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:58:31,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:58:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2024-06-14 14:58:31,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3064516129032258 [2024-06-14 14:58:31,846 INFO L175 Difference]: Start difference. First operand has 291 places, 246 transitions, 2726 flow. Second operand 10 states and 95 transitions. [2024-06-14 14:58:31,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 259 transitions, 3318 flow [2024-06-14 14:58:32,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 259 transitions, 3234 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-14 14:58:32,081 INFO L231 Difference]: Finished difference. Result has 290 places, 249 transitions, 2743 flow [2024-06-14 14:58:32,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2648, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2743, PETRI_PLACES=290, PETRI_TRANSITIONS=249} [2024-06-14 14:58:32,081 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 260 predicate places. [2024-06-14 14:58:32,081 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 249 transitions, 2743 flow [2024-06-14 14:58:32,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:32,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:32,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:58:32,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-14 14:58:32,082 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:58:32,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:32,082 INFO L85 PathProgramCache]: Analyzing trace with hash -613343434, now seen corresponding path program 5 times [2024-06-14 14:58:32,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:32,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368498807] [2024-06-14 14:58:32,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:32,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:36,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:36,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:36,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368498807] [2024-06-14 14:58:36,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368498807] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:36,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:36,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:58:36,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144820362] [2024-06-14 14:58:36,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:36,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:58:36,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:36,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:58:36,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:58:36,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:58:36,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 249 transitions, 2743 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:36,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:36,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:58:36,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:37,161 INFO L124 PetriNetUnfolderBase]: 682/1226 cut-off events. [2024-06-14 14:58:37,161 INFO L125 PetriNetUnfolderBase]: For 79795/79795 co-relation queries the response was YES. [2024-06-14 14:58:37,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8107 conditions, 1226 events. 682/1226 cut-off events. For 79795/79795 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6622 event pairs, 224 based on Foata normal form. 2/1227 useless extension candidates. Maximal degree in co-relation 7976. Up to 1161 conditions per place. [2024-06-14 14:58:37,170 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 240 selfloop transitions, 22 changer transitions 0/264 dead transitions. [2024-06-14 14:58:37,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 264 transitions, 3517 flow [2024-06-14 14:58:37,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:58:37,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:58:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-14 14:58:37,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-14 14:58:37,172 INFO L175 Difference]: Start difference. First operand has 290 places, 249 transitions, 2743 flow. Second operand 11 states and 116 transitions. [2024-06-14 14:58:37,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 264 transitions, 3517 flow [2024-06-14 14:58:37,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 264 transitions, 3458 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 14:58:37,466 INFO L231 Difference]: Finished difference. Result has 294 places, 251 transitions, 2802 flow [2024-06-14 14:58:37,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2684, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2802, PETRI_PLACES=294, PETRI_TRANSITIONS=251} [2024-06-14 14:58:37,466 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 264 predicate places. [2024-06-14 14:58:37,466 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 251 transitions, 2802 flow [2024-06-14 14:58:37,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:37,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:37,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:58:37,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-14 14:58:37,467 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:58:37,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash 99578535, now seen corresponding path program 12 times [2024-06-14 14:58:37,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:37,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453964949] [2024-06-14 14:58:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:41,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:41,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:41,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453964949] [2024-06-14 14:58:41,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453964949] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:41,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:41,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:58:41,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537748593] [2024-06-14 14:58:41,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:41,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:58:41,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:41,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:58:41,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:58:42,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:58:42,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 251 transitions, 2802 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:42,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:42,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:58:42,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:42,536 INFO L124 PetriNetUnfolderBase]: 678/1220 cut-off events. [2024-06-14 14:58:42,536 INFO L125 PetriNetUnfolderBase]: For 75419/75419 co-relation queries the response was YES. [2024-06-14 14:58:42,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7909 conditions, 1220 events. 678/1220 cut-off events. For 75419/75419 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6580 event pairs, 101 based on Foata normal form. 2/1217 useless extension candidates. Maximal degree in co-relation 7777. Up to 1078 conditions per place. [2024-06-14 14:58:42,548 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 216 selfloop transitions, 49 changer transitions 0/267 dead transitions. [2024-06-14 14:58:42,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 267 transitions, 3416 flow [2024-06-14 14:58:42,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:58:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:58:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-14 14:58:42,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3343108504398827 [2024-06-14 14:58:42,550 INFO L175 Difference]: Start difference. First operand has 294 places, 251 transitions, 2802 flow. Second operand 11 states and 114 transitions. [2024-06-14 14:58:42,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 267 transitions, 3416 flow [2024-06-14 14:58:42,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 267 transitions, 3358 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-14 14:58:42,814 INFO L231 Difference]: Finished difference. Result has 299 places, 253 transitions, 2895 flow [2024-06-14 14:58:42,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2744, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2895, PETRI_PLACES=299, PETRI_TRANSITIONS=253} [2024-06-14 14:58:42,815 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 269 predicate places. [2024-06-14 14:58:42,815 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 253 transitions, 2895 flow [2024-06-14 14:58:42,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:42,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:42,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:58:42,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-14 14:58:42,816 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:58:42,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:42,816 INFO L85 PathProgramCache]: Analyzing trace with hash 105142725, now seen corresponding path program 13 times [2024-06-14 14:58:42,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:42,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047604865] [2024-06-14 14:58:42,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:42,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:47,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:47,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047604865] [2024-06-14 14:58:47,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047604865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:47,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:47,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:58:47,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427421295] [2024-06-14 14:58:47,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:47,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:58:47,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:47,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:58:47,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:58:47,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:58:47,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 253 transitions, 2895 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:47,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:47,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:58:47,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:48,167 INFO L124 PetriNetUnfolderBase]: 674/1214 cut-off events. [2024-06-14 14:58:48,167 INFO L125 PetriNetUnfolderBase]: For 70569/70569 co-relation queries the response was YES. [2024-06-14 14:58:48,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7777 conditions, 1214 events. 674/1214 cut-off events. For 70569/70569 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6565 event pairs, 158 based on Foata normal form. 2/1213 useless extension candidates. Maximal degree in co-relation 7643. Up to 1142 conditions per place. [2024-06-14 14:58:48,179 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 235 selfloop transitions, 29 changer transitions 0/266 dead transitions. [2024-06-14 14:58:48,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 266 transitions, 3459 flow [2024-06-14 14:58:48,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:58:48,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:58:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-14 14:58:48,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-14 14:58:48,182 INFO L175 Difference]: Start difference. First operand has 299 places, 253 transitions, 2895 flow. Second operand 11 states and 110 transitions. [2024-06-14 14:58:48,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 266 transitions, 3459 flow [2024-06-14 14:58:48,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 266 transitions, 3300 flow, removed 32 selfloop flow, removed 9 redundant places. [2024-06-14 14:58:48,402 INFO L231 Difference]: Finished difference. Result has 301 places, 253 transitions, 2799 flow [2024-06-14 14:58:48,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2736, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2799, PETRI_PLACES=301, PETRI_TRANSITIONS=253} [2024-06-14 14:58:48,403 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 271 predicate places. [2024-06-14 14:58:48,403 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 253 transitions, 2799 flow [2024-06-14 14:58:48,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:48,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:48,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:58:48,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-14 14:58:48,404 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:58:48,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:48,404 INFO L85 PathProgramCache]: Analyzing trace with hash -613669864, now seen corresponding path program 6 times [2024-06-14 14:58:48,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:48,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546297360] [2024-06-14 14:58:48,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:48,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:53,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:53,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546297360] [2024-06-14 14:58:53,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546297360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:53,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:53,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:58:53,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664626901] [2024-06-14 14:58:53,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:53,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:58:53,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:53,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:58:53,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:58:53,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:58:53,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 253 transitions, 2799 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:53,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:53,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:58:53,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:54,033 INFO L124 PetriNetUnfolderBase]: 671/1209 cut-off events. [2024-06-14 14:58:54,033 INFO L125 PetriNetUnfolderBase]: For 65417/65417 co-relation queries the response was YES. [2024-06-14 14:58:54,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7481 conditions, 1209 events. 671/1209 cut-off events. For 65417/65417 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6530 event pairs, 223 based on Foata normal form. 2/1210 useless extension candidates. Maximal degree in co-relation 7346. Up to 1167 conditions per place. [2024-06-14 14:58:54,046 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 242 selfloop transitions, 20 changer transitions 0/264 dead transitions. [2024-06-14 14:58:54,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 264 transitions, 3347 flow [2024-06-14 14:58:54,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:58:54,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:58:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2024-06-14 14:58:54,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30498533724340177 [2024-06-14 14:58:54,047 INFO L175 Difference]: Start difference. First operand has 301 places, 253 transitions, 2799 flow. Second operand 11 states and 104 transitions. [2024-06-14 14:58:54,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 264 transitions, 3347 flow [2024-06-14 14:58:54,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 264 transitions, 3211 flow, removed 17 selfloop flow, removed 11 redundant places. [2024-06-14 14:58:54,268 INFO L231 Difference]: Finished difference. Result has 301 places, 253 transitions, 2707 flow [2024-06-14 14:58:54,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2663, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2707, PETRI_PLACES=301, PETRI_TRANSITIONS=253} [2024-06-14 14:58:54,268 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 271 predicate places. [2024-06-14 14:58:54,268 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 253 transitions, 2707 flow [2024-06-14 14:58:54,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:54,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:54,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:58:54,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-14 14:58:54,269 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:58:54,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:54,269 INFO L85 PathProgramCache]: Analyzing trace with hash -879367144, now seen corresponding path program 7 times [2024-06-14 14:58:54,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:54,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967928194] [2024-06-14 14:58:54,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:54,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:59,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:59,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967928194] [2024-06-14 14:58:59,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967928194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:59,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:59,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:58:59,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061244260] [2024-06-14 14:58:59,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:59,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:58:59,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:59,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:58:59,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:58:59,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:58:59,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 253 transitions, 2707 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:59,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:59,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:58:59,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:00,222 INFO L124 PetriNetUnfolderBase]: 668/1204 cut-off events. [2024-06-14 14:59:00,222 INFO L125 PetriNetUnfolderBase]: For 59771/59771 co-relation queries the response was YES. [2024-06-14 14:59:00,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7182 conditions, 1204 events. 668/1204 cut-off events. For 59771/59771 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6526 event pairs, 162 based on Foata normal form. 2/1203 useless extension candidates. Maximal degree in co-relation 7047. Up to 1124 conditions per place. [2024-06-14 14:59:00,234 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 225 selfloop transitions, 36 changer transitions 0/263 dead transitions. [2024-06-14 14:59:00,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 263 transitions, 3251 flow [2024-06-14 14:59:00,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:59:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:59:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2024-06-14 14:59:00,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-14 14:59:00,236 INFO L175 Difference]: Start difference. First operand has 301 places, 253 transitions, 2707 flow. Second operand 10 states and 100 transitions. [2024-06-14 14:59:00,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 263 transitions, 3251 flow [2024-06-14 14:59:00,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 263 transitions, 3185 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-14 14:59:00,449 INFO L231 Difference]: Finished difference. Result has 299 places, 253 transitions, 2717 flow [2024-06-14 14:59:00,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2641, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2717, PETRI_PLACES=299, PETRI_TRANSITIONS=253} [2024-06-14 14:59:00,449 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 269 predicate places. [2024-06-14 14:59:00,449 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 253 transitions, 2717 flow [2024-06-14 14:59:00,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:59:00,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:00,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:00,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-14 14:59:00,450 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:59:00,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1419856217, now seen corresponding path program 14 times [2024-06-14 14:59:00,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:00,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739146814] [2024-06-14 14:59:00,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:00,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:59:04,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:04,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739146814] [2024-06-14 14:59:04,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739146814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:04,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:04,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:59:04,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228765540] [2024-06-14 14:59:04,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:04,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:59:04,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:04,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:59:04,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:59:04,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:59:04,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 253 transitions, 2717 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:59:04,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:04,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:59:04,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:05,139 INFO L124 PetriNetUnfolderBase]: 664/1198 cut-off events. [2024-06-14 14:59:05,139 INFO L125 PetriNetUnfolderBase]: For 54551/54551 co-relation queries the response was YES. [2024-06-14 14:59:05,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7001 conditions, 1198 events. 664/1198 cut-off events. For 54551/54551 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6490 event pairs, 155 based on Foata normal form. 2/1197 useless extension candidates. Maximal degree in co-relation 6866. Up to 916 conditions per place. [2024-06-14 14:59:05,151 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 194 selfloop transitions, 71 changer transitions 0/267 dead transitions. [2024-06-14 14:59:05,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 267 transitions, 3287 flow [2024-06-14 14:59:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:59:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:59:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-14 14:59:05,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36129032258064514 [2024-06-14 14:59:05,153 INFO L175 Difference]: Start difference. First operand has 299 places, 253 transitions, 2717 flow. Second operand 10 states and 112 transitions. [2024-06-14 14:59:05,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 267 transitions, 3287 flow [2024-06-14 14:59:05,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 267 transitions, 3079 flow, removed 30 selfloop flow, removed 12 redundant places. [2024-06-14 14:59:05,352 INFO L231 Difference]: Finished difference. Result has 297 places, 253 transitions, 2656 flow [2024-06-14 14:59:05,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2509, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2656, PETRI_PLACES=297, PETRI_TRANSITIONS=253} [2024-06-14 14:59:05,352 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 267 predicate places. [2024-06-14 14:59:05,352 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 253 transitions, 2656 flow [2024-06-14 14:59:05,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:59:05,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:05,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:05,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-14 14:59:05,353 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:59:05,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:05,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1975571086, now seen corresponding path program 1 times [2024-06-14 14:59:05,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:05,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134604757] [2024-06-14 14:59:05,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:05,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:59:10,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:10,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134604757] [2024-06-14 14:59:10,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134604757] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:10,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:10,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:59:10,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396641372] [2024-06-14 14:59:10,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:10,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:59:10,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:10,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:59:10,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:59:10,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:59:10,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 253 transitions, 2656 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-14 14:59:10,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:10,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:59:10,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:10,921 INFO L124 PetriNetUnfolderBase]: 668/1205 cut-off events. [2024-06-14 14:59:10,921 INFO L125 PetriNetUnfolderBase]: For 57359/57359 co-relation queries the response was YES. [2024-06-14 14:59:10,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7004 conditions, 1205 events. 668/1205 cut-off events. For 57359/57359 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6542 event pairs, 111 based on Foata normal form. 2/1206 useless extension candidates. Maximal degree in co-relation 6871. Up to 1076 conditions per place. [2024-06-14 14:59:10,935 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 244 selfloop transitions, 28 changer transitions 0/274 dead transitions. [2024-06-14 14:59:10,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 274 transitions, 3284 flow [2024-06-14 14:59:10,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:59:10,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:59:10,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-14 14:59:10,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-14 14:59:10,936 INFO L175 Difference]: Start difference. First operand has 297 places, 253 transitions, 2656 flow. Second operand 11 states and 110 transitions. [2024-06-14 14:59:10,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 274 transitions, 3284 flow [2024-06-14 14:59:11,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 274 transitions, 3103 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 14:59:11,171 INFO L231 Difference]: Finished difference. Result has 298 places, 254 transitions, 2573 flow [2024-06-14 14:59:11,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2477, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2573, PETRI_PLACES=298, PETRI_TRANSITIONS=254} [2024-06-14 14:59:11,172 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 268 predicate places. [2024-06-14 14:59:11,172 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 254 transitions, 2573 flow [2024-06-14 14:59:11,172 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-14 14:59:11,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:11,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:11,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-14 14:59:11,172 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:59:11,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:11,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1790075298, now seen corresponding path program 2 times [2024-06-14 14:59:11,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:11,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765150725] [2024-06-14 14:59:11,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:11,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:59:16,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:16,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765150725] [2024-06-14 14:59:16,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765150725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:16,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:16,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:59:16,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708393829] [2024-06-14 14:59:16,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:16,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:59:16,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:16,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:59:16,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:59:16,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:59:16,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 254 transitions, 2573 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-14 14:59:16,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:16,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:59:16,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:17,040 INFO L124 PetriNetUnfolderBase]: 672/1213 cut-off events. [2024-06-14 14:59:17,040 INFO L125 PetriNetUnfolderBase]: For 56990/56990 co-relation queries the response was YES. [2024-06-14 14:59:17,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6969 conditions, 1213 events. 672/1213 cut-off events. For 56990/56990 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6614 event pairs, 146 based on Foata normal form. 2/1214 useless extension candidates. Maximal degree in co-relation 6835. Up to 1119 conditions per place. [2024-06-14 14:59:17,053 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 247 selfloop transitions, 26 changer transitions 0/275 dead transitions. [2024-06-14 14:59:17,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 275 transitions, 3205 flow [2024-06-14 14:59:17,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:59:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:59:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2024-06-14 14:59:17,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3313782991202346 [2024-06-14 14:59:17,054 INFO L175 Difference]: Start difference. First operand has 298 places, 254 transitions, 2573 flow. Second operand 11 states and 113 transitions. [2024-06-14 14:59:17,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 275 transitions, 3205 flow [2024-06-14 14:59:17,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 275 transitions, 3119 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-14 14:59:17,280 INFO L231 Difference]: Finished difference. Result has 300 places, 255 transitions, 2581 flow [2024-06-14 14:59:17,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2581, PETRI_PLACES=300, PETRI_TRANSITIONS=255} [2024-06-14 14:59:17,280 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 270 predicate places. [2024-06-14 14:59:17,280 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 255 transitions, 2581 flow [2024-06-14 14:59:17,280 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-14 14:59:17,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:17,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:17,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-14 14:59:17,281 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:59:17,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:17,281 INFO L85 PathProgramCache]: Analyzing trace with hash -712069618, now seen corresponding path program 3 times [2024-06-14 14:59:17,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:17,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084645494] [2024-06-14 14:59:17,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:17,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:59:22,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:22,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084645494] [2024-06-14 14:59:22,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084645494] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:22,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:22,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:59:22,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812753121] [2024-06-14 14:59:22,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:22,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:59:22,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:22,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:59:22,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:59:22,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:59:22,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 255 transitions, 2581 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-14 14:59:22,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:22,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:59:22,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:22,877 INFO L124 PetriNetUnfolderBase]: 676/1221 cut-off events. [2024-06-14 14:59:22,877 INFO L125 PetriNetUnfolderBase]: For 60596/60596 co-relation queries the response was YES. [2024-06-14 14:59:22,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7010 conditions, 1221 events. 676/1221 cut-off events. For 60596/60596 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6670 event pairs, 143 based on Foata normal form. 2/1222 useless extension candidates. Maximal degree in co-relation 6875. Up to 1128 conditions per place. [2024-06-14 14:59:22,889 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 244 selfloop transitions, 29 changer transitions 0/275 dead transitions. [2024-06-14 14:59:22,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 275 transitions, 3213 flow [2024-06-14 14:59:22,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:59:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:59:22,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2024-06-14 14:59:22,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3313782991202346 [2024-06-14 14:59:22,890 INFO L175 Difference]: Start difference. First operand has 300 places, 255 transitions, 2581 flow. Second operand 11 states and 113 transitions. [2024-06-14 14:59:22,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 275 transitions, 3213 flow [2024-06-14 14:59:23,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 275 transitions, 3129 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-14 14:59:23,150 INFO L231 Difference]: Finished difference. Result has 302 places, 256 transitions, 2599 flow [2024-06-14 14:59:23,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2497, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2599, PETRI_PLACES=302, PETRI_TRANSITIONS=256} [2024-06-14 14:59:23,151 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 272 predicate places. [2024-06-14 14:59:23,151 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 256 transitions, 2599 flow [2024-06-14 14:59:23,151 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-14 14:59:23,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:23,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:23,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-14 14:59:23,151 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:59:23,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:23,152 INFO L85 PathProgramCache]: Analyzing trace with hash -700335808, now seen corresponding path program 4 times [2024-06-14 14:59:23,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:23,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165294475] [2024-06-14 14:59:23,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:23,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:59:28,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:28,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165294475] [2024-06-14 14:59:28,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165294475] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:28,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:28,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:59:28,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864683864] [2024-06-14 14:59:28,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:28,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:59:28,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:28,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:59:28,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:59:28,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:59:28,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 256 transitions, 2599 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-14 14:59:28,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:28,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:59:28,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:29,314 INFO L124 PetriNetUnfolderBase]: 687/1242 cut-off events. [2024-06-14 14:59:29,314 INFO L125 PetriNetUnfolderBase]: For 70325/70325 co-relation queries the response was YES. [2024-06-14 14:59:29,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7381 conditions, 1242 events. 687/1242 cut-off events. For 70325/70325 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6817 event pairs, 143 based on Foata normal form. 2/1243 useless extension candidates. Maximal degree in co-relation 7245. Up to 1124 conditions per place. [2024-06-14 14:59:29,327 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 241 selfloop transitions, 35 changer transitions 0/278 dead transitions. [2024-06-14 14:59:29,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 278 transitions, 3455 flow [2024-06-14 14:59:29,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:59:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:59:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-14 14:59:29,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-14 14:59:29,329 INFO L175 Difference]: Start difference. First operand has 302 places, 256 transitions, 2599 flow. Second operand 11 states and 117 transitions. [2024-06-14 14:59:29,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 278 transitions, 3455 flow [2024-06-14 14:59:29,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 278 transitions, 3363 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-14 14:59:29,620 INFO L231 Difference]: Finished difference. Result has 304 places, 258 transitions, 2663 flow [2024-06-14 14:59:29,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2507, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2663, PETRI_PLACES=304, PETRI_TRANSITIONS=258} [2024-06-14 14:59:29,621 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 274 predicate places. [2024-06-14 14:59:29,621 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 258 transitions, 2663 flow [2024-06-14 14:59:29,621 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-14 14:59:29,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:29,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:29,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-14 14:59:29,621 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:59:29,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:29,621 INFO L85 PathProgramCache]: Analyzing trace with hash -699913402, now seen corresponding path program 1 times [2024-06-14 14:59:29,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:29,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465576557] [2024-06-14 14:59:29,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:29,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:59:35,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:35,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465576557] [2024-06-14 14:59:35,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465576557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:35,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:35,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:59:35,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666448851] [2024-06-14 14:59:35,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:35,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:59:35,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:35,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:59:35,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:59:35,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:59:35,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 258 transitions, 2663 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-14 14:59:35,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:35,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:59:35,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:35,660 INFO L124 PetriNetUnfolderBase]: 690/1247 cut-off events. [2024-06-14 14:59:35,660 INFO L125 PetriNetUnfolderBase]: For 68096/68096 co-relation queries the response was YES. [2024-06-14 14:59:35,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7422 conditions, 1247 events. 690/1247 cut-off events. For 68096/68096 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 6853 event pairs, 146 based on Foata normal form. 1/1247 useless extension candidates. Maximal degree in co-relation 7285. Up to 1145 conditions per place. [2024-06-14 14:59:35,673 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 239 selfloop transitions, 38 changer transitions 0/279 dead transitions. [2024-06-14 14:59:35,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 279 transitions, 3329 flow [2024-06-14 14:59:35,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:59:35,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:59:35,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-14 14:59:35,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-14 14:59:35,675 INFO L175 Difference]: Start difference. First operand has 304 places, 258 transitions, 2663 flow. Second operand 11 states and 116 transitions. [2024-06-14 14:59:35,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 279 transitions, 3329 flow [2024-06-14 14:59:35,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 279 transitions, 3241 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-14 14:59:35,962 INFO L231 Difference]: Finished difference. Result has 308 places, 260 transitions, 2721 flow [2024-06-14 14:59:35,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2575, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2721, PETRI_PLACES=308, PETRI_TRANSITIONS=260} [2024-06-14 14:59:35,963 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 278 predicate places. [2024-06-14 14:59:35,963 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 260 transitions, 2721 flow [2024-06-14 14:59:35,963 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-14 14:59:35,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:35,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:35,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-14 14:59:35,963 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:59:35,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:35,964 INFO L85 PathProgramCache]: Analyzing trace with hash -699919168, now seen corresponding path program 5 times [2024-06-14 14:59:35,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:35,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219397711] [2024-06-14 14:59:35,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:35,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:59:40,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:40,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219397711] [2024-06-14 14:59:40,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219397711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:40,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:40,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:59:40,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019984338] [2024-06-14 14:59:40,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:40,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:59:40,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:40,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:59:40,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:59:40,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:59:40,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 260 transitions, 2721 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-14 14:59:40,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:40,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:59:40,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:41,316 INFO L124 PetriNetUnfolderBase]: 687/1242 cut-off events. [2024-06-14 14:59:41,316 INFO L125 PetriNetUnfolderBase]: For 64362/64362 co-relation queries the response was YES. [2024-06-14 14:59:41,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7201 conditions, 1242 events. 687/1242 cut-off events. For 64362/64362 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 6840 event pairs, 146 based on Foata normal form. 2/1243 useless extension candidates. Maximal degree in co-relation 7062. Up to 1143 conditions per place. [2024-06-14 14:59:41,327 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 242 selfloop transitions, 35 changer transitions 0/279 dead transitions. [2024-06-14 14:59:41,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 279 transitions, 3327 flow [2024-06-14 14:59:41,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:59:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:59:41,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-14 14:59:41,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077 [2024-06-14 14:59:41,328 INFO L175 Difference]: Start difference. First operand has 308 places, 260 transitions, 2721 flow. Second operand 11 states and 115 transitions. [2024-06-14 14:59:41,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 279 transitions, 3327 flow [2024-06-14 14:59:41,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 279 transitions, 3179 flow, removed 39 selfloop flow, removed 9 redundant places. [2024-06-14 14:59:41,594 INFO L231 Difference]: Finished difference. Result has 310 places, 260 transitions, 2648 flow [2024-06-14 14:59:41,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2573, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2648, PETRI_PLACES=310, PETRI_TRANSITIONS=260} [2024-06-14 14:59:41,595 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 280 predicate places. [2024-06-14 14:59:41,595 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 260 transitions, 2648 flow [2024-06-14 14:59:41,595 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-14 14:59:41,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:41,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:41,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-14 14:59:41,595 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:59:41,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:41,596 INFO L85 PathProgramCache]: Analyzing trace with hash -866402868, now seen corresponding path program 1 times [2024-06-14 14:59:41,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:41,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137029836] [2024-06-14 14:59:41,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:41,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:46,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-14 14:59:46,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:46,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137029836] [2024-06-14 14:59:46,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137029836] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:46,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:46,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:59:46,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363263419] [2024-06-14 14:59:46,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:46,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:59:46,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:46,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:59:46,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:59:46,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:59:46,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 260 transitions, 2648 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-14 14:59:46,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:46,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:59:46,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:47,243 INFO L124 PetriNetUnfolderBase]: 703/1279 cut-off events. [2024-06-14 14:59:47,243 INFO L125 PetriNetUnfolderBase]: For 93881/93881 co-relation queries the response was YES. [2024-06-14 14:59:47,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7261 conditions, 1279 events. 703/1279 cut-off events. For 93881/93881 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 7056 event pairs, 127 based on Foata normal form. 10/1288 useless extension candidates. Maximal degree in co-relation 7121. Up to 1146 conditions per place. [2024-06-14 14:59:47,255 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 242 selfloop transitions, 30 changer transitions 11/285 dead transitions. [2024-06-14 14:59:47,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 285 transitions, 3326 flow [2024-06-14 14:59:47,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:59:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:59:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2024-06-14 14:59:47,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-14 14:59:47,257 INFO L175 Difference]: Start difference. First operand has 310 places, 260 transitions, 2648 flow. Second operand 12 states and 126 transitions. [2024-06-14 14:59:47,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 285 transitions, 3326 flow [2024-06-14 14:59:47,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 285 transitions, 3253 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-14 14:59:47,542 INFO L231 Difference]: Finished difference. Result has 312 places, 257 transitions, 2594 flow [2024-06-14 14:59:47,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2575, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2594, PETRI_PLACES=312, PETRI_TRANSITIONS=257} [2024-06-14 14:59:47,542 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 282 predicate places. [2024-06-14 14:59:47,543 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 257 transitions, 2594 flow [2024-06-14 14:59:47,543 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-14 14:59:47,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:47,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:47,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-14 14:59:47,543 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:59:47,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:47,544 INFO L85 PathProgramCache]: Analyzing trace with hash 471636976, now seen corresponding path program 6 times [2024-06-14 14:59:47,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:47,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31016146] [2024-06-14 14:59:47,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:47,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:59:51,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:51,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31016146] [2024-06-14 14:59:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31016146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:51,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:51,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:59:51,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553107469] [2024-06-14 14:59:51,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:51,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:59:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:51,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:59:51,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:59:52,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:59:52,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 257 transitions, 2594 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-14 14:59:52,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:52,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:59:52,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:52,443 INFO L124 PetriNetUnfolderBase]: 681/1236 cut-off events. [2024-06-14 14:59:52,443 INFO L125 PetriNetUnfolderBase]: For 66120/66120 co-relation queries the response was YES. [2024-06-14 14:59:52,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7095 conditions, 1236 events. 681/1236 cut-off events. For 66120/66120 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6808 event pairs, 119 based on Foata normal form. 2/1237 useless extension candidates. Maximal degree in co-relation 6954. Up to 1142 conditions per place. [2024-06-14 14:59:52,456 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 250 selfloop transitions, 25 changer transitions 0/277 dead transitions. [2024-06-14 14:59:52,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 277 transitions, 3234 flow [2024-06-14 14:59:52,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:59:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:59:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-14 14:59:52,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3343108504398827 [2024-06-14 14:59:52,457 INFO L175 Difference]: Start difference. First operand has 312 places, 257 transitions, 2594 flow. Second operand 11 states and 114 transitions. [2024-06-14 14:59:52,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 277 transitions, 3234 flow [2024-06-14 14:59:52,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 277 transitions, 3168 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-14 14:59:52,729 INFO L231 Difference]: Finished difference. Result has 309 places, 258 transitions, 2626 flow [2024-06-14 14:59:52,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2528, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2626, PETRI_PLACES=309, PETRI_TRANSITIONS=258} [2024-06-14 14:59:52,730 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 279 predicate places. [2024-06-14 14:59:52,730 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 258 transitions, 2626 flow [2024-06-14 14:59:52,730 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-14 14:59:52,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:52,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:52,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-14 14:59:52,731 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:59:52,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:52,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1182371346, now seen corresponding path program 2 times [2024-06-14 14:59:52,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:52,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864204248] [2024-06-14 14:59:52,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:52,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:59:57,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:57,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864204248] [2024-06-14 14:59:57,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864204248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:57,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:57,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:59:57,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117923369] [2024-06-14 14:59:57,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:57,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:59:57,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:57,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:59:57,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:59:57,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:59:57,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 258 transitions, 2626 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-14 14:59:57,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:57,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:59:57,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:58,355 INFO L124 PetriNetUnfolderBase]: 679/1233 cut-off events. [2024-06-14 14:59:58,355 INFO L125 PetriNetUnfolderBase]: For 58290/58290 co-relation queries the response was YES. [2024-06-14 14:59:58,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6965 conditions, 1233 events. 679/1233 cut-off events. For 58290/58290 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6799 event pairs, 119 based on Foata normal form. 1/1233 useless extension candidates. Maximal degree in co-relation 6825. Up to 1131 conditions per place. [2024-06-14 14:59:58,368 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 237 selfloop transitions, 37 changer transitions 0/276 dead transitions. [2024-06-14 14:59:58,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 276 transitions, 3226 flow [2024-06-14 14:59:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:59:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:59:58,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-14 14:59:58,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-14 14:59:58,369 INFO L175 Difference]: Start difference. First operand has 309 places, 258 transitions, 2626 flow. Second operand 11 states and 117 transitions. [2024-06-14 14:59:58,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 276 transitions, 3226 flow [2024-06-14 14:59:58,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 276 transitions, 3126 flow, removed 26 selfloop flow, removed 9 redundant places. [2024-06-14 14:59:58,670 INFO L231 Difference]: Finished difference. Result has 311 places, 258 transitions, 2608 flow [2024-06-14 14:59:58,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2526, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2608, PETRI_PLACES=311, PETRI_TRANSITIONS=258} [2024-06-14 14:59:58,671 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 281 predicate places. [2024-06-14 14:59:58,671 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 258 transitions, 2608 flow [2024-06-14 14:59:58,671 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-14 14:59:58,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:58,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:58,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-14 14:59:58,671 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:59:58,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1182371532, now seen corresponding path program 7 times [2024-06-14 14:59:58,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:58,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654402322] [2024-06-14 14:59:58,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:58,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:03,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:03,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654402322] [2024-06-14 15:00:03,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654402322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:03,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:03,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:00:03,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621451742] [2024-06-14 15:00:03,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:03,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:00:03,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:03,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:00:03,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:00:03,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:00:03,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 258 transitions, 2608 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-14 15:00:03,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:03,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:00:03,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:00:04,213 INFO L124 PetriNetUnfolderBase]: 683/1241 cut-off events. [2024-06-14 15:00:04,213 INFO L125 PetriNetUnfolderBase]: For 63719/63719 co-relation queries the response was YES. [2024-06-14 15:00:04,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7025 conditions, 1241 events. 683/1241 cut-off events. For 63719/63719 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 6838 event pairs, 121 based on Foata normal form. 2/1242 useless extension candidates. Maximal degree in co-relation 6884. Up to 1142 conditions per place. [2024-06-14 15:00:04,222 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 241 selfloop transitions, 34 changer transitions 0/277 dead transitions. [2024-06-14 15:00:04,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 277 transitions, 3252 flow [2024-06-14 15:00:04,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:00:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:00:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-14 15:00:04,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-14 15:00:04,223 INFO L175 Difference]: Start difference. First operand has 311 places, 258 transitions, 2608 flow. Second operand 11 states and 116 transitions. [2024-06-14 15:00:04,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 277 transitions, 3252 flow [2024-06-14 15:00:04,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 277 transitions, 3117 flow, removed 15 selfloop flow, removed 10 redundant places. [2024-06-14 15:00:04,516 INFO L231 Difference]: Finished difference. Result has 312 places, 259 transitions, 2592 flow [2024-06-14 15:00:04,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2473, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2592, PETRI_PLACES=312, PETRI_TRANSITIONS=259} [2024-06-14 15:00:04,517 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 282 predicate places. [2024-06-14 15:00:04,517 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 259 transitions, 2592 flow [2024-06-14 15:00:04,517 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-14 15:00:04,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:00:04,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:00:04,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-14 15:00:04,517 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:00:04,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:00:04,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1182491502, now seen corresponding path program 8 times [2024-06-14 15:00:04,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:00:04,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137825715] [2024-06-14 15:00:04,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:00:04,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:00:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:09,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:09,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137825715] [2024-06-14 15:00:09,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137825715] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:09,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:09,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:00:09,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129711534] [2024-06-14 15:00:09,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:09,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:00:09,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:09,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:00:09,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:00:09,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:00:09,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 259 transitions, 2592 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-14 15:00:09,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:09,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:00:09,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:00:09,690 INFO L124 PetriNetUnfolderBase]: 687/1249 cut-off events. [2024-06-14 15:00:09,691 INFO L125 PetriNetUnfolderBase]: For 64686/64686 co-relation queries the response was YES. [2024-06-14 15:00:09,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7090 conditions, 1249 events. 687/1249 cut-off events. For 64686/64686 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 6912 event pairs, 123 based on Foata normal form. 2/1250 useless extension candidates. Maximal degree in co-relation 6948. Up to 1156 conditions per place. [2024-06-14 15:00:09,704 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 248 selfloop transitions, 28 changer transitions 0/278 dead transitions. [2024-06-14 15:00:09,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 278 transitions, 3236 flow [2024-06-14 15:00:09,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:00:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:00:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-14 15:00:09,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3343108504398827 [2024-06-14 15:00:09,705 INFO L175 Difference]: Start difference. First operand has 312 places, 259 transitions, 2592 flow. Second operand 11 states and 114 transitions. [2024-06-14 15:00:09,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 278 transitions, 3236 flow [2024-06-14 15:00:09,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 278 transitions, 3117 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-14 15:00:09,981 INFO L231 Difference]: Finished difference. Result has 314 places, 260 transitions, 2581 flow [2024-06-14 15:00:09,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2477, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2581, PETRI_PLACES=314, PETRI_TRANSITIONS=260} [2024-06-14 15:00:09,982 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 284 predicate places. [2024-06-14 15:00:09,982 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 260 transitions, 2581 flow [2024-06-14 15:00:09,982 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-14 15:00:09,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:00:09,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:00:09,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-14 15:00:09,983 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:00:09,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:00:09,983 INFO L85 PathProgramCache]: Analyzing trace with hash -545909328, now seen corresponding path program 9 times [2024-06-14 15:00:09,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:00:09,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379988805] [2024-06-14 15:00:09,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:00:09,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:00:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:14,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:14,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379988805] [2024-06-14 15:00:14,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379988805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:14,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:14,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:00:14,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27658854] [2024-06-14 15:00:14,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:14,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:00:14,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:14,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:00:14,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:00:14,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:00:14,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 260 transitions, 2581 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-14 15:00:14,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:14,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:00:14,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:00:15,254 INFO L124 PetriNetUnfolderBase]: 691/1257 cut-off events. [2024-06-14 15:00:15,254 INFO L125 PetriNetUnfolderBase]: For 63369/63369 co-relation queries the response was YES. [2024-06-14 15:00:15,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7076 conditions, 1257 events. 691/1257 cut-off events. For 63369/63369 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 6978 event pairs, 121 based on Foata normal form. 2/1258 useless extension candidates. Maximal degree in co-relation 6933. Up to 1142 conditions per place. [2024-06-14 15:00:15,267 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 243 selfloop transitions, 34 changer transitions 0/279 dead transitions. [2024-06-14 15:00:15,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 279 transitions, 3227 flow [2024-06-14 15:00:15,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:00:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:00:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-14 15:00:15,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-14 15:00:15,268 INFO L175 Difference]: Start difference. First operand has 314 places, 260 transitions, 2581 flow. Second operand 11 states and 117 transitions. [2024-06-14 15:00:15,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 279 transitions, 3227 flow [2024-06-14 15:00:15,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 279 transitions, 3133 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-14 15:00:15,546 INFO L231 Difference]: Finished difference. Result has 316 places, 261 transitions, 2605 flow [2024-06-14 15:00:15,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2605, PETRI_PLACES=316, PETRI_TRANSITIONS=261} [2024-06-14 15:00:15,546 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 286 predicate places. [2024-06-14 15:00:15,546 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 261 transitions, 2605 flow [2024-06-14 15:00:15,546 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-14 15:00:15,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:00:15,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:00:15,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-14 15:00:15,547 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:00:15,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:00:15,547 INFO L85 PathProgramCache]: Analyzing trace with hash 874242212, now seen corresponding path program 2 times [2024-06-14 15:00:15,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:00:15,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746208090] [2024-06-14 15:00:15,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:00:15,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:00:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:20,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:20,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746208090] [2024-06-14 15:00:20,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746208090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:20,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:20,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:00:20,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754513624] [2024-06-14 15:00:20,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:20,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:00:20,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:20,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:00:20,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:00:20,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:00:20,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 261 transitions, 2605 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-14 15:00:20,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:20,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:00:20,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:00:20,954 INFO L124 PetriNetUnfolderBase]: 707/1294 cut-off events. [2024-06-14 15:00:20,954 INFO L125 PetriNetUnfolderBase]: For 95253/95253 co-relation queries the response was YES. [2024-06-14 15:00:20,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7203 conditions, 1294 events. 707/1294 cut-off events. For 95253/95253 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 7214 event pairs, 129 based on Foata normal form. 10/1303 useless extension candidates. Maximal degree in co-relation 7059. Up to 1161 conditions per place. [2024-06-14 15:00:20,969 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 245 selfloop transitions, 27 changer transitions 11/285 dead transitions. [2024-06-14 15:00:20,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 285 transitions, 3281 flow [2024-06-14 15:00:20,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:00:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:00:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 127 transitions. [2024-06-14 15:00:20,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34139784946236557 [2024-06-14 15:00:20,970 INFO L175 Difference]: Start difference. First operand has 316 places, 261 transitions, 2605 flow. Second operand 12 states and 127 transitions. [2024-06-14 15:00:20,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 285 transitions, 3281 flow [2024-06-14 15:00:21,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 285 transitions, 3173 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-14 15:00:21,270 INFO L231 Difference]: Finished difference. Result has 319 places, 258 transitions, 2513 flow [2024-06-14 15:00:21,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2497, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2513, PETRI_PLACES=319, PETRI_TRANSITIONS=258} [2024-06-14 15:00:21,270 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 289 predicate places. [2024-06-14 15:00:21,270 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 258 transitions, 2513 flow [2024-06-14 15:00:21,270 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-14 15:00:21,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:00:21,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:00:21,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-14 15:00:21,271 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:00:21,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:00:21,271 INFO L85 PathProgramCache]: Analyzing trace with hash 232532138, now seen corresponding path program 10 times [2024-06-14 15:00:21,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:00:21,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502040153] [2024-06-14 15:00:21,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:00:21,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:00:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:25,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:25,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502040153] [2024-06-14 15:00:25,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502040153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:25,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:25,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:00:25,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6571928] [2024-06-14 15:00:25,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:25,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:00:25,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:25,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:00:25,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:00:26,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:00:26,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 258 transitions, 2513 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-14 15:00:26,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:26,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:00:26,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:00:26,560 INFO L124 PetriNetUnfolderBase]: 685/1251 cut-off events. [2024-06-14 15:00:26,561 INFO L125 PetriNetUnfolderBase]: For 65524/65524 co-relation queries the response was YES. [2024-06-14 15:00:26,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6963 conditions, 1251 events. 685/1251 cut-off events. For 65524/65524 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 6950 event pairs, 119 based on Foata normal form. 2/1252 useless extension candidates. Maximal degree in co-relation 6818. Up to 1142 conditions per place. [2024-06-14 15:00:26,574 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 238 selfloop transitions, 37 changer transitions 0/277 dead transitions. [2024-06-14 15:00:26,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 277 transitions, 3159 flow [2024-06-14 15:00:26,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:00:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:00:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-14 15:00:26,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-14 15:00:26,575 INFO L175 Difference]: Start difference. First operand has 319 places, 258 transitions, 2513 flow. Second operand 11 states and 116 transitions. [2024-06-14 15:00:26,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 277 transitions, 3159 flow [2024-06-14 15:00:26,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 277 transitions, 3095 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-14 15:00:26,837 INFO L231 Difference]: Finished difference. Result has 316 places, 259 transitions, 2575 flow [2024-06-14 15:00:26,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2449, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2575, PETRI_PLACES=316, PETRI_TRANSITIONS=259} [2024-06-14 15:00:26,837 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 286 predicate places. [2024-06-14 15:00:26,837 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 259 transitions, 2575 flow [2024-06-14 15:00:26,837 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-14 15:00:26,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:00:26,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:00:26,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-14 15:00:26,838 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:00:26,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:00:26,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1267201456, now seen corresponding path program 11 times [2024-06-14 15:00:26,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:00:26,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236517701] [2024-06-14 15:00:26,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:00:26,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:00:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:31,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:31,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236517701] [2024-06-14 15:00:31,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236517701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:31,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:31,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:00:31,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047385047] [2024-06-14 15:00:31,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:31,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:00:31,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:31,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:00:31,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:00:32,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:00:32,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 259 transitions, 2575 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-14 15:00:32,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:32,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:00:32,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:00:32,422 INFO L124 PetriNetUnfolderBase]: 689/1260 cut-off events. [2024-06-14 15:00:32,422 INFO L125 PetriNetUnfolderBase]: For 66650/66650 co-relation queries the response was YES. [2024-06-14 15:00:32,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7097 conditions, 1260 events. 689/1260 cut-off events. For 66650/66650 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 7021 event pairs, 119 based on Foata normal form. 2/1261 useless extension candidates. Maximal degree in co-relation 6953. Up to 1136 conditions per place. [2024-06-14 15:00:32,435 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 238 selfloop transitions, 38 changer transitions 0/278 dead transitions. [2024-06-14 15:00:32,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 278 transitions, 3223 flow [2024-06-14 15:00:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:00:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:00:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-14 15:00:32,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-14 15:00:32,436 INFO L175 Difference]: Start difference. First operand has 316 places, 259 transitions, 2575 flow. Second operand 11 states and 117 transitions. [2024-06-14 15:00:32,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 278 transitions, 3223 flow [2024-06-14 15:00:32,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 278 transitions, 3107 flow, removed 22 selfloop flow, removed 9 redundant places. [2024-06-14 15:00:32,709 INFO L231 Difference]: Finished difference. Result has 318 places, 260 transitions, 2589 flow [2024-06-14 15:00:32,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2459, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2589, PETRI_PLACES=318, PETRI_TRANSITIONS=260} [2024-06-14 15:00:32,710 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 288 predicate places. [2024-06-14 15:00:32,710 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 260 transitions, 2589 flow [2024-06-14 15:00:32,710 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-14 15:00:32,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:00:32,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:00:32,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-14 15:00:32,710 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:00:32,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:00:32,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1271854680, now seen corresponding path program 3 times [2024-06-14 15:00:32,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:00:32,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21909084] [2024-06-14 15:00:32,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:00:32,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:00:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:37,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:37,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21909084] [2024-06-14 15:00:37,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21909084] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:37,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:37,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:00:37,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102380823] [2024-06-14 15:00:37,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:37,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:00:37,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:37,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:00:37,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:00:38,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:00:38,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 260 transitions, 2589 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-14 15:00:38,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:38,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:00:38,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:00:38,635 INFO L124 PetriNetUnfolderBase]: 705/1296 cut-off events. [2024-06-14 15:00:38,636 INFO L125 PetriNetUnfolderBase]: For 99936/99936 co-relation queries the response was YES. [2024-06-14 15:00:38,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7203 conditions, 1296 events. 705/1296 cut-off events. For 99936/99936 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 7248 event pairs, 123 based on Foata normal form. 10/1305 useless extension candidates. Maximal degree in co-relation 7058. Up to 1142 conditions per place. [2024-06-14 15:00:38,646 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 236 selfloop transitions, 35 changer transitions 11/284 dead transitions. [2024-06-14 15:00:38,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 284 transitions, 3263 flow [2024-06-14 15:00:38,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:00:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:00:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-14 15:00:38,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-14 15:00:38,647 INFO L175 Difference]: Start difference. First operand has 318 places, 260 transitions, 2589 flow. Second operand 12 states and 128 transitions. [2024-06-14 15:00:38,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 284 transitions, 3263 flow [2024-06-14 15:00:38,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 284 transitions, 3143 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-14 15:00:38,942 INFO L231 Difference]: Finished difference. Result has 321 places, 257 transitions, 2517 flow [2024-06-14 15:00:38,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2469, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2517, PETRI_PLACES=321, PETRI_TRANSITIONS=257} [2024-06-14 15:00:38,943 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 291 predicate places. [2024-06-14 15:00:38,943 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 257 transitions, 2517 flow [2024-06-14 15:00:38,943 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-14 15:00:38,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:00:38,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:00:38,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-14 15:00:38,943 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-14 15:00:38,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:00:38,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1444337626, now seen corresponding path program 12 times [2024-06-14 15:00:38,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:00:38,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005594853] [2024-06-14 15:00:38,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:00:38,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:00:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:42,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:42,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005594853] [2024-06-14 15:00:42,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005594853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:42,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:42,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:00:42,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619620868] [2024-06-14 15:00:42,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:42,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:00:42,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:42,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:00:42,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:00:42,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:00:42,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 257 transitions, 2517 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-14 15:00:42,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:42,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:00:42,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:00:43,338 INFO L124 PetriNetUnfolderBase]: 699/1289 cut-off events. [2024-06-14 15:00:43,338 INFO L125 PetriNetUnfolderBase]: For 110600/110600 co-relation queries the response was YES. [2024-06-14 15:00:43,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7162 conditions, 1289 events. 699/1289 cut-off events. For 110600/110600 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 7257 event pairs, 165 based on Foata normal form. 12/1300 useless extension candidates. Maximal degree in co-relation 7016. Up to 1162 conditions per place. [2024-06-14 15:00:43,352 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 244 selfloop transitions, 26 changer transitions 7/279 dead transitions. [2024-06-14 15:00:43,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 279 transitions, 3221 flow [2024-06-14 15:00:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:00:43,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:00:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-14 15:00:43,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2024-06-14 15:00:43,354 INFO L175 Difference]: Start difference. First operand has 321 places, 257 transitions, 2517 flow. Second operand 11 states and 118 transitions. [2024-06-14 15:00:43,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 279 transitions, 3221 flow [2024-06-14 15:00:43,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 279 transitions, 3147 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-14 15:00:43,635 INFO L231 Difference]: Finished difference. Result has 318 places, 255 transitions, 2515 flow [2024-06-14 15:00:43,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2443, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2515, PETRI_PLACES=318, PETRI_TRANSITIONS=255} [2024-06-14 15:00:43,635 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 288 predicate places. [2024-06-14 15:00:43,635 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 255 transitions, 2515 flow [2024-06-14 15:00:43,635 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-14 15:00:43,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:00:43,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:00:43,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-14 15:00:43,636 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-14 15:00:43,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:00:43,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1444344570, now seen corresponding path program 4 times [2024-06-14 15:00:43,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:00:43,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203386916] [2024-06-14 15:00:43,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:00:43,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:00:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:48,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:48,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:48,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203386916] [2024-06-14 15:00:48,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203386916] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:48,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:48,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:00:48,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120003423] [2024-06-14 15:00:48,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:48,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:00:48,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:48,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:00:48,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:00:48,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:00:48,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 255 transitions, 2515 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-14 15:00:48,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:48,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:00:48,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:00:48,892 INFO L124 PetriNetUnfolderBase]: 691/1277 cut-off events. [2024-06-14 15:00:48,892 INFO L125 PetriNetUnfolderBase]: For 99819/99819 co-relation queries the response was YES. [2024-06-14 15:00:48,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7063 conditions, 1277 events. 691/1277 cut-off events. For 99819/99819 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 7165 event pairs, 167 based on Foata normal form. 10/1286 useless extension candidates. Maximal degree in co-relation 6918. Up to 1152 conditions per place. [2024-06-14 15:00:48,906 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 240 selfloop transitions, 20 changer transitions 16/278 dead transitions. [2024-06-14 15:00:48,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 278 transitions, 3173 flow [2024-06-14 15:00:48,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:00:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:00:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2024-06-14 15:00:48,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-14 15:00:48,907 INFO L175 Difference]: Start difference. First operand has 318 places, 255 transitions, 2515 flow. Second operand 12 states and 126 transitions. [2024-06-14 15:00:48,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 278 transitions, 3173 flow [2024-06-14 15:00:49,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 278 transitions, 3075 flow, removed 24 selfloop flow, removed 9 redundant places. [2024-06-14 15:00:49,173 INFO L231 Difference]: Finished difference. Result has 321 places, 249 transitions, 2378 flow [2024-06-14 15:00:49,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2417, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2378, PETRI_PLACES=321, PETRI_TRANSITIONS=249} [2024-06-14 15:00:49,173 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 291 predicate places. [2024-06-14 15:00:49,173 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 249 transitions, 2378 flow [2024-06-14 15:00:49,173 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-14 15:00:49,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:00:49,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:00:49,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-14 15:00:49,174 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-14 15:00:49,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:00:49,174 INFO L85 PathProgramCache]: Analyzing trace with hash 232412168, now seen corresponding path program 13 times [2024-06-14 15:00:49,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:00:49,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373544343] [2024-06-14 15:00:49,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:00:49,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:00:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:54,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:54,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373544343] [2024-06-14 15:00:54,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373544343] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:54,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:54,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:00:54,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725447870] [2024-06-14 15:00:54,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:54,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:00:54,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:54,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:00:54,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:00:54,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:00:54,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 249 transitions, 2378 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:00:54,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:54,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:00:54,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:00:54,736 INFO L124 PetriNetUnfolderBase]: 661/1220 cut-off events. [2024-06-14 15:00:54,736 INFO L125 PetriNetUnfolderBase]: For 68546/68546 co-relation queries the response was YES. [2024-06-14 15:00:54,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6734 conditions, 1220 events. 661/1220 cut-off events. For 68546/68546 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6796 event pairs, 101 based on Foata normal form. 2/1221 useless extension candidates. Maximal degree in co-relation 6588. Up to 1074 conditions per place. [2024-06-14 15:00:54,748 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 222 selfloop transitions, 42 changer transitions 0/266 dead transitions. [2024-06-14 15:00:54,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 266 transitions, 2998 flow [2024-06-14 15:00:54,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:00:54,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:00:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-14 15:00:54,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36451612903225805 [2024-06-14 15:00:54,749 INFO L175 Difference]: Start difference. First operand has 321 places, 249 transitions, 2378 flow. Second operand 10 states and 113 transitions. [2024-06-14 15:00:54,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 266 transitions, 2998 flow [2024-06-14 15:00:55,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 266 transitions, 2941 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-14 15:00:55,041 INFO L231 Difference]: Finished difference. Result has 314 places, 250 transitions, 2464 flow [2024-06-14 15:00:55,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2323, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2464, PETRI_PLACES=314, PETRI_TRANSITIONS=250} [2024-06-14 15:00:55,041 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 284 predicate places. [2024-06-14 15:00:55,041 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 250 transitions, 2464 flow [2024-06-14 15:00:55,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:00:55,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:00:55,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-14 15:00:55,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-14 15:00:55,042 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-14 15:00:55,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:00:55,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1039701422, now seen corresponding path program 14 times [2024-06-14 15:00:55,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:00:55,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779786324] [2024-06-14 15:00:55,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:00:55,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:00:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:59,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:59,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779786324] [2024-06-14 15:00:59,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779786324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:59,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:59,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:00:59,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820850460] [2024-06-14 15:00:59,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:59,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:00:59,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:59,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:00:59,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:00:59,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:00:59,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 250 transitions, 2464 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-14 15:00:59,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:59,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:00:59,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:00,042 INFO L124 PetriNetUnfolderBase]: 665/1227 cut-off events. [2024-06-14 15:01:00,042 INFO L125 PetriNetUnfolderBase]: For 68364/68364 co-relation queries the response was YES. [2024-06-14 15:01:00,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6889 conditions, 1227 events. 665/1227 cut-off events. For 68364/68364 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6865 event pairs, 167 based on Foata normal form. 2/1228 useless extension candidates. Maximal degree in co-relation 6744. Up to 1162 conditions per place. [2024-06-14 15:01:00,056 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 244 selfloop transitions, 22 changer transitions 0/268 dead transitions. [2024-06-14 15:01:00,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 268 transitions, 3094 flow [2024-06-14 15:01:00,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:01:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:01:00,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2024-06-14 15:01:00,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3313782991202346 [2024-06-14 15:01:00,057 INFO L175 Difference]: Start difference. First operand has 314 places, 250 transitions, 2464 flow. Second operand 11 states and 113 transitions. [2024-06-14 15:01:00,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 268 transitions, 3094 flow [2024-06-14 15:01:00,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 268 transitions, 2965 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-14 15:01:00,339 INFO L231 Difference]: Finished difference. Result has 317 places, 251 transitions, 2437 flow [2024-06-14 15:01:00,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2335, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2437, PETRI_PLACES=317, PETRI_TRANSITIONS=251} [2024-06-14 15:01:00,339 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 287 predicate places. [2024-06-14 15:01:00,339 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 251 transitions, 2437 flow [2024-06-14 15:01:00,339 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-14 15:01:00,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:00,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:00,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-14 15:01:00,339 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-14 15:01:00,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:00,340 INFO L85 PathProgramCache]: Analyzing trace with hash 808116726, now seen corresponding path program 5 times [2024-06-14 15:01:00,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:00,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105170591] [2024-06-14 15:01:00,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:00,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:01:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:01:04,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:01:04,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105170591] [2024-06-14 15:01:04,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105170591] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:01:04,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:01:04,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:01:04,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866949521] [2024-06-14 15:01:04,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:01:04,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:01:04,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:01:04,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:01:04,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:01:04,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:01:04,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 251 transitions, 2437 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-14 15:01:04,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:01:04,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:01:04,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:05,017 INFO L124 PetriNetUnfolderBase]: 706/1314 cut-off events. [2024-06-14 15:01:05,017 INFO L125 PetriNetUnfolderBase]: For 135279/135279 co-relation queries the response was YES. [2024-06-14 15:01:05,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8077 conditions, 1314 events. 706/1314 cut-off events. For 135279/135279 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7399 event pairs, 178 based on Foata normal form. 8/1321 useless extension candidates. Maximal degree in co-relation 7931. Up to 1142 conditions per place. [2024-06-14 15:01:05,031 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 247 selfloop transitions, 18 changer transitions 9/276 dead transitions. [2024-06-14 15:01:05,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 276 transitions, 3309 flow [2024-06-14 15:01:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:01:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:01:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-14 15:01:05,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489736070381232 [2024-06-14 15:01:05,032 INFO L175 Difference]: Start difference. First operand has 317 places, 251 transitions, 2437 flow. Second operand 11 states and 119 transitions. [2024-06-14 15:01:05,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 276 transitions, 3309 flow [2024-06-14 15:01:05,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 276 transitions, 3217 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-06-14 15:01:05,481 INFO L231 Difference]: Finished difference. Result has 319 places, 247 transitions, 2350 flow [2024-06-14 15:01:05,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2345, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2350, PETRI_PLACES=319, PETRI_TRANSITIONS=247} [2024-06-14 15:01:05,481 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 289 predicate places. [2024-06-14 15:01:05,481 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 247 transitions, 2350 flow [2024-06-14 15:01:05,482 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-14 15:01:05,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:05,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:05,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-14 15:01:05,482 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-14 15:01:05,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:05,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1039881346, now seen corresponding path program 6 times [2024-06-14 15:01:05,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:05,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355117669] [2024-06-14 15:01:05,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:05,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:01:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:01:10,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:01:10,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355117669] [2024-06-14 15:01:10,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355117669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:01:10,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:01:10,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:01:10,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987457325] [2024-06-14 15:01:10,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:01:10,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:01:10,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:01:10,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:01:10,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:01:10,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:01:10,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 247 transitions, 2350 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-14 15:01:10,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:01:10,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:01:10,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:11,286 INFO L124 PetriNetUnfolderBase]: 688/1280 cut-off events. [2024-06-14 15:01:11,286 INFO L125 PetriNetUnfolderBase]: For 128952/128952 co-relation queries the response was YES. [2024-06-14 15:01:11,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7443 conditions, 1280 events. 688/1280 cut-off events. For 128952/128952 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 7156 event pairs, 180 based on Foata normal form. 10/1289 useless extension candidates. Maximal degree in co-relation 7296. Up to 1179 conditions per place. [2024-06-14 15:01:11,299 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 240 selfloop transitions, 18 changer transitions 9/269 dead transitions. [2024-06-14 15:01:11,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 269 transitions, 2986 flow [2024-06-14 15:01:11,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:01:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:01:11,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2024-06-14 15:01:11,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32526881720430106 [2024-06-14 15:01:11,300 INFO L175 Difference]: Start difference. First operand has 319 places, 247 transitions, 2350 flow. Second operand 12 states and 121 transitions. [2024-06-14 15:01:11,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 269 transitions, 2986 flow [2024-06-14 15:01:11,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 269 transitions, 2945 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-14 15:01:11,710 INFO L231 Difference]: Finished difference. Result has 316 places, 244 transitions, 2310 flow [2024-06-14 15:01:11,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2309, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2310, PETRI_PLACES=316, PETRI_TRANSITIONS=244} [2024-06-14 15:01:11,710 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 286 predicate places. [2024-06-14 15:01:11,710 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 244 transitions, 2310 flow [2024-06-14 15:01:11,710 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-14 15:01:11,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:11,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:11,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-14 15:01:11,712 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-14 15:01:11,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1039696772, now seen corresponding path program 15 times [2024-06-14 15:01:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:11,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88496437] [2024-06-14 15:01:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:11,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:01:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:01:16,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:01:16,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88496437] [2024-06-14 15:01:16,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88496437] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:01:16,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:01:16,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:01:16,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046267978] [2024-06-14 15:01:16,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:01:16,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:01:16,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:01:16,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:01:16,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:01:16,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:01:16,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 244 transitions, 2310 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-14 15:01:16,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:01:16,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:01:16,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:16,591 INFO L124 PetriNetUnfolderBase]: 666/1238 cut-off events. [2024-06-14 15:01:16,591 INFO L125 PetriNetUnfolderBase]: For 91944/91944 co-relation queries the response was YES. [2024-06-14 15:01:16,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7253 conditions, 1238 events. 666/1238 cut-off events. For 91944/91944 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6908 event pairs, 178 based on Foata normal form. 2/1239 useless extension candidates. Maximal degree in co-relation 7108. Up to 1173 conditions per place. [2024-06-14 15:01:16,604 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 240 selfloop transitions, 19 changer transitions 0/261 dead transitions. [2024-06-14 15:01:16,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 261 transitions, 2920 flow [2024-06-14 15:01:16,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:01:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:01:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2024-06-14 15:01:16,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31671554252199413 [2024-06-14 15:01:16,606 INFO L175 Difference]: Start difference. First operand has 316 places, 244 transitions, 2310 flow. Second operand 11 states and 108 transitions. [2024-06-14 15:01:16,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 261 transitions, 2920 flow [2024-06-14 15:01:16,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 261 transitions, 2869 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-14 15:01:16,979 INFO L231 Difference]: Finished difference. Result has 313 places, 245 transitions, 2355 flow [2024-06-14 15:01:16,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2259, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2355, PETRI_PLACES=313, PETRI_TRANSITIONS=245} [2024-06-14 15:01:16,979 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 283 predicate places. [2024-06-14 15:01:16,980 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 245 transitions, 2355 flow [2024-06-14 15:01:16,980 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-14 15:01:16,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:16,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:16,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-14 15:01:16,980 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-14 15:01:16,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash 789487974, now seen corresponding path program 16 times [2024-06-14 15:01:16,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:16,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785084360] [2024-06-14 15:01:16,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:16,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:01:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:01:21,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:01:21,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785084360] [2024-06-14 15:01:21,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785084360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:01:21,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:01:21,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:01:21,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640975773] [2024-06-14 15:01:21,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:01:21,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:01:21,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:01:21,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:01:21,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:01:21,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:01:21,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 245 transitions, 2355 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-14 15:01:21,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:01:21,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:01:21,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:22,078 INFO L124 PetriNetUnfolderBase]: 670/1246 cut-off events. [2024-06-14 15:01:22,078 INFO L125 PetriNetUnfolderBase]: For 93327/93327 co-relation queries the response was YES. [2024-06-14 15:01:22,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7373 conditions, 1246 events. 670/1246 cut-off events. For 93327/93327 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6934 event pairs, 131 based on Foata normal form. 2/1247 useless extension candidates. Maximal degree in co-relation 7228. Up to 1045 conditions per place. [2024-06-14 15:01:22,093 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 225 selfloop transitions, 36 changer transitions 0/263 dead transitions. [2024-06-14 15:01:22,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 263 transitions, 2971 flow [2024-06-14 15:01:22,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:01:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:01:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2024-06-14 15:01:22,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3258064516129032 [2024-06-14 15:01:22,095 INFO L175 Difference]: Start difference. First operand has 313 places, 245 transitions, 2355 flow. Second operand 10 states and 101 transitions. [2024-06-14 15:01:22,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 263 transitions, 2971 flow [2024-06-14 15:01:22,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 263 transitions, 2885 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-06-14 15:01:22,493 INFO L231 Difference]: Finished difference. Result has 314 places, 246 transitions, 2407 flow [2024-06-14 15:01:22,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2269, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2407, PETRI_PLACES=314, PETRI_TRANSITIONS=246} [2024-06-14 15:01:22,493 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 284 predicate places. [2024-06-14 15:01:22,493 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 246 transitions, 2407 flow [2024-06-14 15:01:22,493 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-14 15:01:22,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:22,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:22,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-14 15:01:22,494 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-14 15:01:22,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:22,494 INFO L85 PathProgramCache]: Analyzing trace with hash -989907566, now seen corresponding path program 17 times [2024-06-14 15:01:22,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:22,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030448338] [2024-06-14 15:01:22,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:22,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:01:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:01:27,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:01:27,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030448338] [2024-06-14 15:01:27,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030448338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:01:27,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:01:27,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:01:27,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627046089] [2024-06-14 15:01:27,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:01:27,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:01:27,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:01:27,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:01:27,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:01:28,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:01:28,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 246 transitions, 2407 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-14 15:01:28,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:01:28,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:01:28,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:28,722 INFO L124 PetriNetUnfolderBase]: 681/1267 cut-off events. [2024-06-14 15:01:28,722 INFO L125 PetriNetUnfolderBase]: For 105173/105173 co-relation queries the response was YES. [2024-06-14 15:01:28,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7881 conditions, 1267 events. 681/1267 cut-off events. For 105173/105173 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 7064 event pairs, 147 based on Foata normal form. 2/1268 useless extension candidates. Maximal degree in co-relation 7735. Up to 1039 conditions per place. [2024-06-14 15:01:28,733 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 207 selfloop transitions, 57 changer transitions 0/266 dead transitions. [2024-06-14 15:01:28,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 266 transitions, 3279 flow [2024-06-14 15:01:28,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:01:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:01:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 15:01:28,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-14 15:01:28,735 INFO L175 Difference]: Start difference. First operand has 314 places, 246 transitions, 2407 flow. Second operand 10 states and 107 transitions. [2024-06-14 15:01:28,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 266 transitions, 3279 flow [2024-06-14 15:01:29,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 266 transitions, 3139 flow, removed 38 selfloop flow, removed 8 redundant places. [2024-06-14 15:01:29,186 INFO L231 Difference]: Finished difference. Result has 316 places, 248 transitions, 2509 flow [2024-06-14 15:01:29,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2285, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2509, PETRI_PLACES=316, PETRI_TRANSITIONS=248} [2024-06-14 15:01:29,187 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 286 predicate places. [2024-06-14 15:01:29,187 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 248 transitions, 2509 flow [2024-06-14 15:01:29,187 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-14 15:01:29,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:29,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:29,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-14 15:01:29,187 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-14 15:01:29,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:29,187 INFO L85 PathProgramCache]: Analyzing trace with hash 712979994, now seen corresponding path program 18 times [2024-06-14 15:01:29,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:29,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898942243] [2024-06-14 15:01:29,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:29,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:01:34,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:01:34,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:01:34,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898942243] [2024-06-14 15:01:34,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898942243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:01:34,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:01:34,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:01:34,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869670570] [2024-06-14 15:01:34,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:01:34,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:01:34,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:01:34,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:01:34,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:01:34,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:01:34,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 248 transitions, 2509 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-14 15:01:34,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:01:34,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:01:34,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:35,205 INFO L124 PetriNetUnfolderBase]: 678/1262 cut-off events. [2024-06-14 15:01:35,205 INFO L125 PetriNetUnfolderBase]: For 91113/91113 co-relation queries the response was YES. [2024-06-14 15:01:35,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7530 conditions, 1262 events. 678/1262 cut-off events. For 91113/91113 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 7048 event pairs, 155 based on Foata normal form. 2/1263 useless extension candidates. Maximal degree in co-relation 7383. Up to 1085 conditions per place. [2024-06-14 15:01:35,217 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 206 selfloop transitions, 57 changer transitions 0/265 dead transitions. [2024-06-14 15:01:35,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 265 transitions, 3081 flow [2024-06-14 15:01:35,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:01:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:01:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-14 15:01:35,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-14 15:01:35,218 INFO L175 Difference]: Start difference. First operand has 316 places, 248 transitions, 2509 flow. Second operand 10 states and 105 transitions. [2024-06-14 15:01:35,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 265 transitions, 3081 flow [2024-06-14 15:01:35,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 265 transitions, 2921 flow, removed 46 selfloop flow, removed 7 redundant places. [2024-06-14 15:01:35,599 INFO L231 Difference]: Finished difference. Result has 319 places, 248 transitions, 2474 flow [2024-06-14 15:01:35,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2349, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2474, PETRI_PLACES=319, PETRI_TRANSITIONS=248} [2024-06-14 15:01:35,600 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 289 predicate places. [2024-06-14 15:01:35,600 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 248 transitions, 2474 flow [2024-06-14 15:01:35,600 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-14 15:01:35,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:35,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:35,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-14 15:01:35,600 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-14 15:01:35,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:35,601 INFO L85 PathProgramCache]: Analyzing trace with hash -990022886, now seen corresponding path program 19 times [2024-06-14 15:01:35,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:35,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335982428] [2024-06-14 15:01:35,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:35,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:01:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:01:40,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:01:40,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335982428] [2024-06-14 15:01:40,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335982428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:01:40,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:01:40,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:01:40,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900774110] [2024-06-14 15:01:40,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:01:40,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:01:40,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:01:40,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:01:40,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:01:40,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:01:40,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 248 transitions, 2474 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-14 15:01:40,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:01:40,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:01:40,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:41,235 INFO L124 PetriNetUnfolderBase]: 682/1270 cut-off events. [2024-06-14 15:01:41,235 INFO L125 PetriNetUnfolderBase]: For 90281/90281 co-relation queries the response was YES. [2024-06-14 15:01:41,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7562 conditions, 1270 events. 682/1270 cut-off events. For 90281/90281 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7133 event pairs, 145 based on Foata normal form. 2/1271 useless extension candidates. Maximal degree in co-relation 7414. Up to 1111 conditions per place. [2024-06-14 15:01:41,245 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 223 selfloop transitions, 41 changer transitions 0/266 dead transitions. [2024-06-14 15:01:41,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 266 transitions, 3094 flow [2024-06-14 15:01:41,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:01:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:01:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-14 15:01:41,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33225806451612905 [2024-06-14 15:01:41,246 INFO L175 Difference]: Start difference. First operand has 319 places, 248 transitions, 2474 flow. Second operand 10 states and 103 transitions. [2024-06-14 15:01:41,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 266 transitions, 3094 flow [2024-06-14 15:01:41,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 266 transitions, 2966 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-14 15:01:41,622 INFO L231 Difference]: Finished difference. Result has 319 places, 249 transitions, 2488 flow [2024-06-14 15:01:41,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2346, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2488, PETRI_PLACES=319, PETRI_TRANSITIONS=249} [2024-06-14 15:01:41,622 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 289 predicate places. [2024-06-14 15:01:41,622 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 249 transitions, 2488 flow [2024-06-14 15:01:41,622 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-14 15:01:41,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:41,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:41,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-14 15:01:41,623 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-14 15:01:41,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:41,623 INFO L85 PathProgramCache]: Analyzing trace with hash -989902730, now seen corresponding path program 3 times [2024-06-14 15:01:41,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:41,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884582079] [2024-06-14 15:01:41,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:41,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:01:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:01:46,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:01:46,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884582079] [2024-06-14 15:01:46,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884582079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:01:46,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:01:46,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:01:46,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563723748] [2024-06-14 15:01:46,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:01:46,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:01:46,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:01:46,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:01:46,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:01:46,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:01:46,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 249 transitions, 2488 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-14 15:01:46,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:01:46,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:01:46,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:47,231 INFO L124 PetriNetUnfolderBase]: 680/1267 cut-off events. [2024-06-14 15:01:47,231 INFO L125 PetriNetUnfolderBase]: For 82080/82080 co-relation queries the response was YES. [2024-06-14 15:01:47,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7413 conditions, 1267 events. 680/1267 cut-off events. For 82080/82080 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7107 event pairs, 155 based on Foata normal form. 1/1267 useless extension candidates. Maximal degree in co-relation 7265. Up to 1097 conditions per place. [2024-06-14 15:01:47,277 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 202 selfloop transitions, 62 changer transitions 0/266 dead transitions. [2024-06-14 15:01:47,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 266 transitions, 3064 flow [2024-06-14 15:01:47,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:01:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:01:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 15:01:47,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-14 15:01:47,278 INFO L175 Difference]: Start difference. First operand has 319 places, 249 transitions, 2488 flow. Second operand 10 states and 106 transitions. [2024-06-14 15:01:47,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 266 transitions, 3064 flow [2024-06-14 15:01:47,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 266 transitions, 2924 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-14 15:01:47,662 INFO L231 Difference]: Finished difference. Result has 321 places, 249 transitions, 2486 flow [2024-06-14 15:01:47,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2348, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2486, PETRI_PLACES=321, PETRI_TRANSITIONS=249} [2024-06-14 15:01:47,663 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 291 predicate places. [2024-06-14 15:01:47,663 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 249 transitions, 2486 flow [2024-06-14 15:01:47,663 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-14 15:01:47,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:47,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:47,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-14 15:01:47,663 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-14 15:01:47,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:47,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1702191768, now seen corresponding path program 7 times [2024-06-14 15:01:47,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:47,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909479289] [2024-06-14 15:01:47,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:47,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:01:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:01:52,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:01:52,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909479289] [2024-06-14 15:01:52,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909479289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:01:52,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:01:52,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:01:52,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784462884] [2024-06-14 15:01:52,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:01:52,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:01:52,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:01:52,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:01:52,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:01:52,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:01:52,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 249 transitions, 2486 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-14 15:01:52,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:01:52,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:01:52,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:52,982 INFO L124 PetriNetUnfolderBase]: 696/1304 cut-off events. [2024-06-14 15:01:52,983 INFO L125 PetriNetUnfolderBase]: For 114254/114254 co-relation queries the response was YES. [2024-06-14 15:01:52,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7513 conditions, 1304 events. 696/1304 cut-off events. For 114254/114254 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7366 event pairs, 138 based on Foata normal form. 10/1313 useless extension candidates. Maximal degree in co-relation 7364. Up to 1127 conditions per place. [2024-06-14 15:01:52,997 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 220 selfloop transitions, 39 changer transitions 11/272 dead transitions. [2024-06-14 15:01:52,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 272 transitions, 3132 flow [2024-06-14 15:01:52,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:01:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:01:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-14 15:01:52,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-14 15:01:52,998 INFO L175 Difference]: Start difference. First operand has 321 places, 249 transitions, 2486 flow. Second operand 11 states and 117 transitions. [2024-06-14 15:01:52,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 272 transitions, 3132 flow [2024-06-14 15:01:53,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 272 transitions, 2917 flow, removed 17 selfloop flow, removed 12 redundant places. [2024-06-14 15:01:53,378 INFO L231 Difference]: Finished difference. Result has 320 places, 246 transitions, 2322 flow [2024-06-14 15:01:53,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2271, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2322, PETRI_PLACES=320, PETRI_TRANSITIONS=246} [2024-06-14 15:01:53,379 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 290 predicate places. [2024-06-14 15:01:53,379 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 246 transitions, 2322 flow [2024-06-14 15:01:53,379 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-14 15:01:53,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:53,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:53,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-14 15:01:53,379 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-14 15:01:53,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:53,380 INFO L85 PathProgramCache]: Analyzing trace with hash 393411394, now seen corresponding path program 20 times [2024-06-14 15:01:53,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:53,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182043781] [2024-06-14 15:01:53,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:53,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:01:57,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-14 15:01:57,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:01:57,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182043781] [2024-06-14 15:01:57,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182043781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:01:57,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:01:57,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:01:57,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533389293] [2024-06-14 15:01:57,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:01:57,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:01:57,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:01:57,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:01:57,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:01:57,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:01:57,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 246 transitions, 2322 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-14 15:01:57,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:01:57,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:01:57,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:58,240 INFO L124 PetriNetUnfolderBase]: 690/1297 cut-off events. [2024-06-14 15:01:58,241 INFO L125 PetriNetUnfolderBase]: For 118022/118022 co-relation queries the response was YES. [2024-06-14 15:01:58,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7383 conditions, 1297 events. 690/1297 cut-off events. For 118022/118022 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7360 event pairs, 180 based on Foata normal form. 12/1308 useless extension candidates. Maximal degree in co-relation 7236. Up to 1150 conditions per place. [2024-06-14 15:01:58,252 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 227 selfloop transitions, 30 changer transitions 7/266 dead transitions. [2024-06-14 15:01:58,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 266 transitions, 2992 flow [2024-06-14 15:01:58,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:01:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:01:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 15:01:58,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646 [2024-06-14 15:01:58,253 INFO L175 Difference]: Start difference. First operand has 320 places, 246 transitions, 2322 flow. Second operand 10 states and 109 transitions. [2024-06-14 15:01:58,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 266 transitions, 2992 flow [2024-06-14 15:01:58,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 266 transitions, 2904 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 15:01:58,612 INFO L231 Difference]: Finished difference. Result has 317 places, 244 transitions, 2323 flow [2024-06-14 15:01:58,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2236, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2323, PETRI_PLACES=317, PETRI_TRANSITIONS=244} [2024-06-14 15:01:58,612 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 287 predicate places. [2024-06-14 15:01:58,612 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 244 transitions, 2323 flow [2024-06-14 15:01:58,612 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-14 15:01:58,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:58,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:58,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-14 15:01:58,613 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-14 15:01:58,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:58,613 INFO L85 PathProgramCache]: Analyzing trace with hash -954235930, now seen corresponding path program 21 times [2024-06-14 15:01:58,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:58,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359890151] [2024-06-14 15:01:58,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:58,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:02:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:02:02,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:02:02,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359890151] [2024-06-14 15:02:02,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359890151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:02:02,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:02:02,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:02:02,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52332639] [2024-06-14 15:02:02,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:02:02,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:02:02,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:02:02,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:02:02,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:02:02,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:02:02,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 244 transitions, 2323 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-14 15:02:02,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:02:02,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:02:02,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:02:02,924 INFO L124 PetriNetUnfolderBase]: 670/1257 cut-off events. [2024-06-14 15:02:02,924 INFO L125 PetriNetUnfolderBase]: For 81702/81702 co-relation queries the response was YES. [2024-06-14 15:02:02,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7236 conditions, 1257 events. 670/1257 cut-off events. For 81702/81702 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 7100 event pairs, 174 based on Foata normal form. 2/1258 useless extension candidates. Maximal degree in co-relation 7090. Up to 1152 conditions per place. [2024-06-14 15:02:02,939 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 225 selfloop transitions, 33 changer transitions 0/260 dead transitions. [2024-06-14 15:02:02,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 260 transitions, 2929 flow [2024-06-14 15:02:02,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:02:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:02:02,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-14 15:02:02,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-14 15:02:02,940 INFO L175 Difference]: Start difference. First operand has 317 places, 244 transitions, 2323 flow. Second operand 10 states and 105 transitions. [2024-06-14 15:02:02,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 260 transitions, 2929 flow [2024-06-14 15:02:03,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 260 transitions, 2819 flow, removed 23 selfloop flow, removed 10 redundant places. [2024-06-14 15:02:03,315 INFO L231 Difference]: Finished difference. Result has 317 places, 245 transitions, 2337 flow [2024-06-14 15:02:03,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2213, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2337, PETRI_PLACES=317, PETRI_TRANSITIONS=245} [2024-06-14 15:02:03,315 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 287 predicate places. [2024-06-14 15:02:03,315 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 245 transitions, 2337 flow [2024-06-14 15:02:03,315 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-14 15:02:03,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:02:03,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:02:03,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-06-14 15:02:03,316 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-14 15:02:03,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:02:03,316 INFO L85 PathProgramCache]: Analyzing trace with hash 823207868, now seen corresponding path program 22 times [2024-06-14 15:02:03,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:02:03,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654313383] [2024-06-14 15:02:03,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:02:03,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:02:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:02:09,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:02:09,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:02:09,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654313383] [2024-06-14 15:02:09,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654313383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:02:09,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:02:09,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:02:09,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646614146] [2024-06-14 15:02:09,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:02:09,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:02:09,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:02:09,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:02:09,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:02:09,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:02:09,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 245 transitions, 2337 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-14 15:02:09,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:02:09,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:02:09,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:02:10,346 INFO L124 PetriNetUnfolderBase]: 674/1266 cut-off events. [2024-06-14 15:02:10,346 INFO L125 PetriNetUnfolderBase]: For 83392/83392 co-relation queries the response was YES. [2024-06-14 15:02:10,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7297 conditions, 1266 events. 674/1266 cut-off events. For 83392/83392 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 7157 event pairs, 128 based on Foata normal form. 2/1267 useless extension candidates. Maximal degree in co-relation 7151. Up to 1116 conditions per place. [2024-06-14 15:02:10,360 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 214 selfloop transitions, 46 changer transitions 0/262 dead transitions. [2024-06-14 15:02:10,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 262 transitions, 2953 flow [2024-06-14 15:02:10,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:02:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:02:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-14 15:02:10,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-14 15:02:10,362 INFO L175 Difference]: Start difference. First operand has 317 places, 245 transitions, 2337 flow. Second operand 10 states and 105 transitions. [2024-06-14 15:02:10,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 262 transitions, 2953 flow [2024-06-14 15:02:10,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 262 transitions, 2839 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-14 15:02:10,780 INFO L231 Difference]: Finished difference. Result has 319 places, 246 transitions, 2375 flow [2024-06-14 15:02:10,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2225, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2375, PETRI_PLACES=319, PETRI_TRANSITIONS=246} [2024-06-14 15:02:10,780 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 289 predicate places. [2024-06-14 15:02:10,780 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 246 transitions, 2375 flow [2024-06-14 15:02:10,781 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-14 15:02:10,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:02:10,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:02:10,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-06-14 15:02:10,781 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-14 15:02:10,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:02:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash -954240580, now seen corresponding path program 23 times [2024-06-14 15:02:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:02:10,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638481263] [2024-06-14 15:02:10,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:02:10,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:02:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:02:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:02:14,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:02:14,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638481263] [2024-06-14 15:02:14,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638481263] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:02:14,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:02:14,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:02:14,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067048219] [2024-06-14 15:02:14,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:02:14,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:02:14,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:02:14,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:02:14,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:02:15,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:02:15,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 246 transitions, 2375 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-14 15:02:15,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:02:15,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:02:15,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:02:15,550 INFO L124 PetriNetUnfolderBase]: 678/1273 cut-off events. [2024-06-14 15:02:15,551 INFO L125 PetriNetUnfolderBase]: For 83697/83697 co-relation queries the response was YES. [2024-06-14 15:02:15,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7360 conditions, 1273 events. 678/1273 cut-off events. For 83697/83697 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7243 event pairs, 178 based on Foata normal form. 2/1274 useless extension candidates. Maximal degree in co-relation 7213. Up to 1134 conditions per place. [2024-06-14 15:02:15,563 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 224 selfloop transitions, 36 changer transitions 0/262 dead transitions. [2024-06-14 15:02:15,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 262 transitions, 2985 flow [2024-06-14 15:02:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:02:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:02:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-14 15:02:15,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-14 15:02:15,564 INFO L175 Difference]: Start difference. First operand has 319 places, 246 transitions, 2375 flow. Second operand 10 states and 105 transitions. [2024-06-14 15:02:15,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 262 transitions, 2985 flow [2024-06-14 15:02:15,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 262 transitions, 2845 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-14 15:02:15,927 INFO L231 Difference]: Finished difference. Result has 321 places, 247 transitions, 2367 flow [2024-06-14 15:02:15,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2237, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2367, PETRI_PLACES=321, PETRI_TRANSITIONS=247} [2024-06-14 15:02:15,928 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 291 predicate places. [2024-06-14 15:02:15,928 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 247 transitions, 2367 flow [2024-06-14 15:02:15,928 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-14 15:02:15,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:02:15,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:02:15,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2024-06-14 15:02:15,928 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-14 15:02:15,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:02:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash 387162228, now seen corresponding path program 8 times [2024-06-14 15:02:15,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:02:15,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043338929] [2024-06-14 15:02:15,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:02:15,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:02:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:02:20,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-14 15:02:20,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:02:20,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043338929] [2024-06-14 15:02:20,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043338929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:02:20,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:02:20,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:02:20,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727863302] [2024-06-14 15:02:20,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:02:20,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:02:20,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:02:20,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:02:20,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:02:20,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:02:20,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 247 transitions, 2367 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-14 15:02:20,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:02:20,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:02:20,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:02:20,751 INFO L124 PetriNetUnfolderBase]: 687/1296 cut-off events. [2024-06-14 15:02:20,751 INFO L125 PetriNetUnfolderBase]: For 112910/112910 co-relation queries the response was YES. [2024-06-14 15:02:20,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6846 conditions, 1296 events. 687/1296 cut-off events. For 112910/112910 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7421 event pairs, 177 based on Foata normal form. 16/1311 useless extension candidates. Maximal degree in co-relation 6698. Up to 1121 conditions per place. [2024-06-14 15:02:20,764 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 223 selfloop transitions, 24 changer transitions 19/268 dead transitions. [2024-06-14 15:02:20,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 268 transitions, 2997 flow [2024-06-14 15:02:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:02:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:02:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-14 15:02:20,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2024-06-14 15:02:20,765 INFO L175 Difference]: Start difference. First operand has 321 places, 247 transitions, 2367 flow. Second operand 11 states and 118 transitions. [2024-06-14 15:02:20,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 268 transitions, 2997 flow [2024-06-14 15:02:21,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 268 transitions, 2879 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-14 15:02:21,040 INFO L231 Difference]: Finished difference. Result has 324 places, 238 transitions, 2224 flow [2024-06-14 15:02:21,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2249, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2224, PETRI_PLACES=324, PETRI_TRANSITIONS=238} [2024-06-14 15:02:21,040 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 294 predicate places. [2024-06-14 15:02:21,040 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 238 transitions, 2224 flow [2024-06-14 15:02:21,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-14 15:02:21,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:02:21,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:02:21,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-06-14 15:02:21,041 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-14 15:02:21,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:02:21,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1000346332, now seen corresponding path program 9 times [2024-06-14 15:02:21,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:02:21,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991307139] [2024-06-14 15:02:21,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:02:21,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:02:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:02:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:02:25,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:02:25,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991307139] [2024-06-14 15:02:25,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991307139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:02:25,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:02:25,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:02:25,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136138461] [2024-06-14 15:02:25,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:02:25,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:02:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:02:25,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:02:25,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:02:25,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:02:25,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 238 transitions, 2224 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-14 15:02:25,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:02:25,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:02:25,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:02:26,041 INFO L124 PetriNetUnfolderBase]: 649/1226 cut-off events. [2024-06-14 15:02:26,041 INFO L125 PetriNetUnfolderBase]: For 88220/88220 co-relation queries the response was YES. [2024-06-14 15:02:26,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6429 conditions, 1226 events. 649/1226 cut-off events. For 88220/88220 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 6941 event pairs, 173 based on Foata normal form. 10/1235 useless extension candidates. Maximal degree in co-relation 6295. Up to 1105 conditions per place. [2024-06-14 15:02:26,053 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 222 selfloop transitions, 18 changer transitions 16/258 dead transitions. [2024-06-14 15:02:26,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 258 transitions, 2830 flow [2024-06-14 15:02:26,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:02:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:02:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-14 15:02:26,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077 [2024-06-14 15:02:26,054 INFO L175 Difference]: Start difference. First operand has 324 places, 238 transitions, 2224 flow. Second operand 11 states and 115 transitions. [2024-06-14 15:02:26,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 258 transitions, 2830 flow [2024-06-14 15:02:26,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 258 transitions, 2768 flow, removed 7 selfloop flow, removed 12 redundant places. [2024-06-14 15:02:26,301 INFO L231 Difference]: Finished difference. Result has 314 places, 232 transitions, 2152 flow [2024-06-14 15:02:26,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2162, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2152, PETRI_PLACES=314, PETRI_TRANSITIONS=232} [2024-06-14 15:02:26,301 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 284 predicate places. [2024-06-14 15:02:26,301 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 232 transitions, 2152 flow [2024-06-14 15:02:26,301 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-14 15:02:26,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:02:26,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:02:26,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2024-06-14 15:02:26,302 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-14 15:02:26,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:02:26,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1000585342, now seen corresponding path program 10 times [2024-06-14 15:02:26,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:02:26,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521299050] [2024-06-14 15:02:26,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:02:26,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:02:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:02:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:02:30,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:02:30,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521299050] [2024-06-14 15:02:30,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521299050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:02:30,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:02:30,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:02:30,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873674888] [2024-06-14 15:02:30,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:02:30,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:02:30,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:02:30,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:02:30,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:02:30,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:02:30,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 232 transitions, 2152 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-14 15:02:30,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:02:30,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:02:30,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:02:30,926 INFO L124 PetriNetUnfolderBase]: 627/1188 cut-off events. [2024-06-14 15:02:30,926 INFO L125 PetriNetUnfolderBase]: For 73250/73250 co-relation queries the response was YES. [2024-06-14 15:02:30,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6179 conditions, 1188 events. 627/1188 cut-off events. For 73250/73250 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6686 event pairs, 168 based on Foata normal form. 8/1194 useless extension candidates. Maximal degree in co-relation 6049. Up to 1107 conditions per place. [2024-06-14 15:02:30,936 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 220 selfloop transitions, 14 changer transitions 12/248 dead transitions. [2024-06-14 15:02:30,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 248 transitions, 2714 flow [2024-06-14 15:02:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:02:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:02:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2024-06-14 15:02:30,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31671554252199413 [2024-06-14 15:02:30,937 INFO L175 Difference]: Start difference. First operand has 314 places, 232 transitions, 2152 flow. Second operand 11 states and 108 transitions. [2024-06-14 15:02:30,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 248 transitions, 2714 flow [2024-06-14 15:02:31,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 248 transitions, 2640 flow, removed 8 selfloop flow, removed 14 redundant places. [2024-06-14 15:02:31,165 INFO L231 Difference]: Finished difference. Result has 305 places, 228 transitions, 2085 flow [2024-06-14 15:02:31,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2080, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2085, PETRI_PLACES=305, PETRI_TRANSITIONS=228} [2024-06-14 15:02:31,166 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 275 predicate places. [2024-06-14 15:02:31,166 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 228 transitions, 2085 flow [2024-06-14 15:02:31,166 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-14 15:02:31,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:02:31,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:02:31,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2024-06-14 15:02:31,166 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-14 15:02:31,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:02:31,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1124943010, now seen corresponding path program 24 times [2024-06-14 15:02:31,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:02:31,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404737670] [2024-06-14 15:02:31,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:02:31,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:02:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:02:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:02:35,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:02:35,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404737670] [2024-06-14 15:02:35,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404737670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:02:35,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:02:35,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:02:35,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701454578] [2024-06-14 15:02:35,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:02:35,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:02:35,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:02:35,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:02:35,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:02:35,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:02:35,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 228 transitions, 2085 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-14 15:02:35,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:02:35,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:02:35,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:02:36,400 INFO L124 PetriNetUnfolderBase]: 611/1153 cut-off events. [2024-06-14 15:02:36,401 INFO L125 PetriNetUnfolderBase]: For 49811/49811 co-relation queries the response was YES. [2024-06-14 15:02:36,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5993 conditions, 1153 events. 611/1153 cut-off events. For 49811/49811 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6470 event pairs, 105 based on Foata normal form. 2/1154 useless extension candidates. Maximal degree in co-relation 5868. Up to 975 conditions per place. [2024-06-14 15:02:36,414 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 195 selfloop transitions, 48 changer transitions 0/245 dead transitions. [2024-06-14 15:02:36,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 245 transitions, 2655 flow [2024-06-14 15:02:36,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:02:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:02:36,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 15:02:36,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-14 15:02:36,416 INFO L175 Difference]: Start difference. First operand has 305 places, 228 transitions, 2085 flow. Second operand 10 states and 106 transitions. [2024-06-14 15:02:36,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 245 transitions, 2655 flow [2024-06-14 15:02:36,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 245 transitions, 2619 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-14 15:02:36,598 INFO L231 Difference]: Finished difference. Result has 299 places, 229 transitions, 2195 flow [2024-06-14 15:02:36,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2049, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2195, PETRI_PLACES=299, PETRI_TRANSITIONS=229} [2024-06-14 15:02:36,599 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 269 predicate places. [2024-06-14 15:02:36,599 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 229 transitions, 2195 flow [2024-06-14 15:02:36,599 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-14 15:02:36,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:02:36,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:02:36,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2024-06-14 15:02:36,600 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-14 15:02:36,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:02:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash 220928448, now seen corresponding path program 11 times [2024-06-14 15:02:36,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:02:36,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237171828] [2024-06-14 15:02:36,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:02:36,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:02:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:02:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:02:41,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:02:41,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237171828] [2024-06-14 15:02:41,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237171828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:02:41,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:02:41,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:02:41,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80852245] [2024-06-14 15:02:41,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:02:41,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:02:41,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:02:41,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:02:41,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:02:41,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:02:41,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 229 transitions, 2195 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-14 15:02:41,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:02:41,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:02:41,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:02:41,904 INFO L124 PetriNetUnfolderBase]: 627/1189 cut-off events. [2024-06-14 15:02:41,904 INFO L125 PetriNetUnfolderBase]: For 72629/72629 co-relation queries the response was YES. [2024-06-14 15:02:41,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6222 conditions, 1189 events. 627/1189 cut-off events. For 72629/72629 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6694 event pairs, 113 based on Foata normal form. 10/1198 useless extension candidates. Maximal degree in co-relation 6099. Up to 989 conditions per place. [2024-06-14 15:02:41,917 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 195 selfloop transitions, 45 changer transitions 7/249 dead transitions. [2024-06-14 15:02:41,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 249 transitions, 2781 flow [2024-06-14 15:02:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:02:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:02:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-14 15:02:41,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-14 15:02:41,919 INFO L175 Difference]: Start difference. First operand has 299 places, 229 transitions, 2195 flow. Second operand 10 states and 110 transitions. [2024-06-14 15:02:41,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 249 transitions, 2781 flow [2024-06-14 15:02:42,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 249 transitions, 2647 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-14 15:02:42,096 INFO L231 Difference]: Finished difference. Result has 301 places, 226 transitions, 2141 flow [2024-06-14 15:02:42,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2061, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2141, PETRI_PLACES=301, PETRI_TRANSITIONS=226} [2024-06-14 15:02:42,097 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 271 predicate places. [2024-06-14 15:02:42,097 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 226 transitions, 2141 flow [2024-06-14 15:02:42,097 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-14 15:02:42,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:02:42,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:02:42,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2024-06-14 15:02:42,097 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-14 15:02:42,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:02:42,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1212680260, now seen corresponding path program 25 times [2024-06-14 15:02:42,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:02:42,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555296128] [2024-06-14 15:02:42,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:02:42,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:02:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:02:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:02:47,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:02:47,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555296128] [2024-06-14 15:02:47,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555296128] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:02:47,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:02:47,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:02:47,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387451068] [2024-06-14 15:02:47,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:02:47,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:02:47,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:02:47,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:02:47,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:02:47,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:02:47,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 226 transitions, 2141 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-14 15:02:47,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:02:47,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:02:47,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:02:47,797 INFO L124 PetriNetUnfolderBase]: 605/1147 cut-off events. [2024-06-14 15:02:47,797 INFO L125 PetriNetUnfolderBase]: For 47903/47903 co-relation queries the response was YES. [2024-06-14 15:02:47,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6039 conditions, 1147 events. 605/1147 cut-off events. For 47903/47903 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6438 event pairs, 114 based on Foata normal form. 2/1144 useless extension candidates. Maximal degree in co-relation 5915. Up to 1007 conditions per place. [2024-06-14 15:02:47,807 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 195 selfloop transitions, 44 changer transitions 0/241 dead transitions. [2024-06-14 15:02:47,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 241 transitions, 2699 flow [2024-06-14 15:02:47,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:02:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:02:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2024-06-14 15:02:47,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33548387096774196 [2024-06-14 15:02:47,808 INFO L175 Difference]: Start difference. First operand has 301 places, 226 transitions, 2141 flow. Second operand 10 states and 104 transitions. [2024-06-14 15:02:47,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 241 transitions, 2699 flow [2024-06-14 15:02:47,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 241 transitions, 2601 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-14 15:02:47,961 INFO L231 Difference]: Finished difference. Result has 299 places, 227 transitions, 2179 flow [2024-06-14 15:02:47,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2043, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2179, PETRI_PLACES=299, PETRI_TRANSITIONS=227} [2024-06-14 15:02:47,961 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 269 predicate places. [2024-06-14 15:02:47,961 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 227 transitions, 2179 flow [2024-06-14 15:02:47,961 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-14 15:02:47,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:02:47,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:02:47,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2024-06-14 15:02:47,962 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-14 15:02:47,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:02:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1212684910, now seen corresponding path program 26 times [2024-06-14 15:02:47,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:02:47,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508424142] [2024-06-14 15:02:47,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:02:47,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:02:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:02:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:02:53,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:02:53,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508424142] [2024-06-14 15:02:53,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508424142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:02:53,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:02:53,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:02:53,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242313545] [2024-06-14 15:02:53,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:02:53,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:02:53,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:02:53,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:02:53,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:02:53,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:02:53,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 227 transitions, 2179 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-14 15:02:53,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:02:53,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:02:53,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:02:53,729 INFO L124 PetriNetUnfolderBase]: 609/1155 cut-off events. [2024-06-14 15:02:53,729 INFO L125 PetriNetUnfolderBase]: For 47738/47738 co-relation queries the response was YES. [2024-06-14 15:02:53,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6125 conditions, 1155 events. 609/1155 cut-off events. For 47738/47738 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6523 event pairs, 112 based on Foata normal form. 2/1152 useless extension candidates. Maximal degree in co-relation 6002. Up to 1001 conditions per place. [2024-06-14 15:02:53,742 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 195 selfloop transitions, 45 changer transitions 0/242 dead transitions. [2024-06-14 15:02:53,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 242 transitions, 2739 flow [2024-06-14 15:02:53,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:02:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:02:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-14 15:02:53,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-14 15:02:53,743 INFO L175 Difference]: Start difference. First operand has 299 places, 227 transitions, 2179 flow. Second operand 10 states and 105 transitions. [2024-06-14 15:02:53,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 242 transitions, 2739 flow [2024-06-14 15:02:53,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 242 transitions, 2613 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-14 15:02:53,924 INFO L231 Difference]: Finished difference. Result has 301 places, 228 transitions, 2193 flow [2024-06-14 15:02:53,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2053, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2193, PETRI_PLACES=301, PETRI_TRANSITIONS=228} [2024-06-14 15:02:53,925 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 271 predicate places. [2024-06-14 15:02:53,925 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 228 transitions, 2193 flow [2024-06-14 15:02:53,925 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-14 15:02:53,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:02:53,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:02:53,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2024-06-14 15:02:53,925 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-14 15:02:53,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:02:53,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1041977830, now seen corresponding path program 27 times [2024-06-14 15:02:53,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:02:53,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831368175] [2024-06-14 15:02:53,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:02:53,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:02:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:02:58,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-14 15:02:58,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:02:58,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831368175] [2024-06-14 15:02:58,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831368175] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:02:58,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:02:58,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:02:58,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139504804] [2024-06-14 15:02:58,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:02:58,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:02:58,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:02:58,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:02:58,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:02:58,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:02:58,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 228 transitions, 2193 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-14 15:02:58,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:02:58,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:02:58,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:02:59,096 INFO L124 PetriNetUnfolderBase]: 613/1163 cut-off events. [2024-06-14 15:02:59,096 INFO L125 PetriNetUnfolderBase]: For 49208/49208 co-relation queries the response was YES. [2024-06-14 15:02:59,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6178 conditions, 1163 events. 613/1163 cut-off events. For 49208/49208 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6569 event pairs, 164 based on Foata normal form. 2/1162 useless extension candidates. Maximal degree in co-relation 6054. Up to 1068 conditions per place. [2024-06-14 15:02:59,105 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 207 selfloop transitions, 33 changer transitions 0/242 dead transitions. [2024-06-14 15:02:59,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 242 transitions, 2753 flow [2024-06-14 15:02:59,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:02:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:02:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-14 15:02:59,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-14 15:02:59,105 INFO L175 Difference]: Start difference. First operand has 301 places, 228 transitions, 2193 flow. Second operand 10 states and 105 transitions. [2024-06-14 15:02:59,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 242 transitions, 2753 flow [2024-06-14 15:02:59,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 242 transitions, 2623 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-14 15:02:59,282 INFO L231 Difference]: Finished difference. Result has 303 places, 229 transitions, 2181 flow [2024-06-14 15:02:59,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2063, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2181, PETRI_PLACES=303, PETRI_TRANSITIONS=229} [2024-06-14 15:02:59,282 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 273 predicate places. [2024-06-14 15:02:59,282 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 229 transitions, 2181 flow [2024-06-14 15:02:59,282 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-14 15:02:59,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:02:59,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:02:59,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2024-06-14 15:02:59,282 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-14 15:02:59,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:02:59,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1065875686, now seen corresponding path program 28 times [2024-06-14 15:02:59,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:02:59,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765012870] [2024-06-14 15:02:59,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:02:59,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:02:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:03:03,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:03,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765012870] [2024-06-14 15:03:03,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765012870] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:03,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:03,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:03:03,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594473657] [2024-06-14 15:03:03,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:03,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:03:03,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:03,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:03:03,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:03:03,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:03:03,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 229 transitions, 2181 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-14 15:03:03,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:03,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:03:03,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:04,101 INFO L124 PetriNetUnfolderBase]: 633/1207 cut-off events. [2024-06-14 15:03:04,102 INFO L125 PetriNetUnfolderBase]: For 82117/82117 co-relation queries the response was YES. [2024-06-14 15:03:04,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6350 conditions, 1207 events. 633/1207 cut-off events. For 82117/82117 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6862 event pairs, 170 based on Foata normal form. 12/1216 useless extension candidates. Maximal degree in co-relation 6225. Up to 961 conditions per place. [2024-06-14 15:03:04,114 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 188 selfloop transitions, 51 changer transitions 7/248 dead transitions. [2024-06-14 15:03:04,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 248 transitions, 2807 flow [2024-06-14 15:03:04,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:03:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:03:04,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 15:03:04,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-14 15:03:04,115 INFO L175 Difference]: Start difference. First operand has 303 places, 229 transitions, 2181 flow. Second operand 10 states and 115 transitions. [2024-06-14 15:03:04,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 248 transitions, 2807 flow [2024-06-14 15:03:04,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 248 transitions, 2699 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-14 15:03:04,328 INFO L231 Difference]: Finished difference. Result has 305 places, 227 transitions, 2210 flow [2024-06-14 15:03:04,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2073, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2210, PETRI_PLACES=305, PETRI_TRANSITIONS=227} [2024-06-14 15:03:04,328 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 275 predicate places. [2024-06-14 15:03:04,328 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 227 transitions, 2210 flow [2024-06-14 15:03:04,328 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-14 15:03:04,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:04,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:04,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2024-06-14 15:03:04,328 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-14 15:03:04,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:04,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1041982480, now seen corresponding path program 29 times [2024-06-14 15:03:04,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:04,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120889451] [2024-06-14 15:03:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:04,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:03:08,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:08,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120889451] [2024-06-14 15:03:08,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120889451] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:08,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:08,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:03:08,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194039370] [2024-06-14 15:03:08,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:08,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:03:08,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:08,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:03:08,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:03:08,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:03:08,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 227 transitions, 2210 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-14 15:03:08,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:08,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:03:08,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:09,108 INFO L124 PetriNetUnfolderBase]: 649/1239 cut-off events. [2024-06-14 15:03:09,108 INFO L125 PetriNetUnfolderBase]: For 92181/92181 co-relation queries the response was YES. [2024-06-14 15:03:09,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7631 conditions, 1239 events. 649/1239 cut-off events. For 92181/92181 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 7052 event pairs, 182 based on Foata normal form. 2/1238 useless extension candidates. Maximal degree in co-relation 7505. Up to 1056 conditions per place. [2024-06-14 15:03:09,122 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 210 selfloop transitions, 35 changer transitions 0/247 dead transitions. [2024-06-14 15:03:09,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 247 transitions, 3046 flow [2024-06-14 15:03:09,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:03:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:03:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-14 15:03:09,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-14 15:03:09,123 INFO L175 Difference]: Start difference. First operand has 305 places, 227 transitions, 2210 flow. Second operand 10 states and 110 transitions. [2024-06-14 15:03:09,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 247 transitions, 3046 flow [2024-06-14 15:03:09,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 247 transitions, 2900 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-14 15:03:09,429 INFO L231 Difference]: Finished difference. Result has 307 places, 229 transitions, 2240 flow [2024-06-14 15:03:09,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2240, PETRI_PLACES=307, PETRI_TRANSITIONS=229} [2024-06-14 15:03:09,429 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 277 predicate places. [2024-06-14 15:03:09,429 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 229 transitions, 2240 flow [2024-06-14 15:03:09,429 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-14 15:03:09,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:09,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:09,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2024-06-14 15:03:09,429 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-14 15:03:09,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:09,430 INFO L85 PathProgramCache]: Analyzing trace with hash -688638184, now seen corresponding path program 12 times [2024-06-14 15:03:09,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:09,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954835205] [2024-06-14 15:03:09,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:09,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:14,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-14 15:03:14,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:14,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954835205] [2024-06-14 15:03:14,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954835205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:14,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:14,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:03:14,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495336528] [2024-06-14 15:03:14,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:14,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:03:14,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:14,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:03:14,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:03:14,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:03:14,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 229 transitions, 2240 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-14 15:03:14,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:14,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:03:14,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:14,829 INFO L124 PetriNetUnfolderBase]: 665/1275 cut-off events. [2024-06-14 15:03:14,829 INFO L125 PetriNetUnfolderBase]: For 120076/120076 co-relation queries the response was YES. [2024-06-14 15:03:14,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7696 conditions, 1275 events. 665/1275 cut-off events. For 120076/120076 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7307 event pairs, 188 based on Foata normal form. 10/1282 useless extension candidates. Maximal degree in co-relation 7569. Up to 1134 conditions per place. [2024-06-14 15:03:14,842 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 203 selfloop transitions, 27 changer transitions 16/248 dead transitions. [2024-06-14 15:03:14,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 248 transitions, 2820 flow [2024-06-14 15:03:14,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:03:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:03:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-14 15:03:14,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2024-06-14 15:03:14,843 INFO L175 Difference]: Start difference. First operand has 307 places, 229 transitions, 2240 flow. Second operand 11 states and 118 transitions. [2024-06-14 15:03:14,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 248 transitions, 2820 flow [2024-06-14 15:03:15,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 248 transitions, 2726 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-14 15:03:15,222 INFO L231 Difference]: Finished difference. Result has 312 places, 223 transitions, 2156 flow [2024-06-14 15:03:15,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2146, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2156, PETRI_PLACES=312, PETRI_TRANSITIONS=223} [2024-06-14 15:03:15,223 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 282 predicate places. [2024-06-14 15:03:15,223 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 223 transitions, 2156 flow [2024-06-14 15:03:15,223 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-14 15:03:15,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:15,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:15,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2024-06-14 15:03:15,223 INFO L420 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:03:15,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:15,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1072304776, now seen corresponding path program 30 times [2024-06-14 15:03:15,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:15,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103857463] [2024-06-14 15:03:15,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:15,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:19,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-14 15:03:19,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:19,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103857463] [2024-06-14 15:03:19,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103857463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:19,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:19,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:03:19,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934760904] [2024-06-14 15:03:19,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:19,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:03:19,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:19,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:03:19,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:03:19,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:03:19,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 223 transitions, 2156 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-14 15:03:19,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:19,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:03:19,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:19,826 INFO L124 PetriNetUnfolderBase]: 633/1215 cut-off events. [2024-06-14 15:03:19,826 INFO L125 PetriNetUnfolderBase]: For 95609/95609 co-relation queries the response was YES. [2024-06-14 15:03:19,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7472 conditions, 1215 events. 633/1215 cut-off events. For 95609/95609 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6913 event pairs, 180 based on Foata normal form. 2/1214 useless extension candidates. Maximal degree in co-relation 7343. Up to 1033 conditions per place. [2024-06-14 15:03:19,836 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 183 selfloop transitions, 53 changer transitions 0/238 dead transitions. [2024-06-14 15:03:19,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 238 transitions, 2718 flow [2024-06-14 15:03:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:03:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:03:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-14 15:03:19,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-14 15:03:19,837 INFO L175 Difference]: Start difference. First operand has 312 places, 223 transitions, 2156 flow. Second operand 10 states and 110 transitions. [2024-06-14 15:03:19,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 238 transitions, 2718 flow [2024-06-14 15:03:20,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 238 transitions, 2632 flow, removed 10 selfloop flow, removed 12 redundant places. [2024-06-14 15:03:20,146 INFO L231 Difference]: Finished difference. Result has 304 places, 224 transitions, 2234 flow [2024-06-14 15:03:20,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2074, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2234, PETRI_PLACES=304, PETRI_TRANSITIONS=224} [2024-06-14 15:03:20,146 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 274 predicate places. [2024-06-14 15:03:20,146 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 224 transitions, 2234 flow [2024-06-14 15:03:20,146 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-14 15:03:20,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:20,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:20,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2024-06-14 15:03:20,147 INFO L420 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:03:20,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:20,147 INFO L85 PathProgramCache]: Analyzing trace with hash -141907664, now seen corresponding path program 31 times [2024-06-14 15:03:20,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:20,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977619630] [2024-06-14 15:03:20,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:20,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:03:24,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:24,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977619630] [2024-06-14 15:03:24,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977619630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:24,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:24,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:03:24,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727028787] [2024-06-14 15:03:24,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:24,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:03:24,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:24,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:03:24,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:03:24,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:03:24,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 224 transitions, 2234 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-14 15:03:24,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:24,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:03:24,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:24,795 INFO L124 PetriNetUnfolderBase]: 617/1187 cut-off events. [2024-06-14 15:03:24,795 INFO L125 PetriNetUnfolderBase]: For 82237/82237 co-relation queries the response was YES. [2024-06-14 15:03:24,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6325 conditions, 1187 events. 617/1187 cut-off events. For 82237/82237 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6788 event pairs, 172 based on Foata normal form. 12/1196 useless extension candidates. Maximal degree in co-relation 6199. Up to 1066 conditions per place. [2024-06-14 15:03:24,807 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 207 selfloop transitions, 25 changer transitions 7/241 dead transitions. [2024-06-14 15:03:24,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 241 transitions, 2794 flow [2024-06-14 15:03:24,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:03:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:03:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-14 15:03:24,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-14 15:03:24,808 INFO L175 Difference]: Start difference. First operand has 304 places, 224 transitions, 2234 flow. Second operand 10 states and 108 transitions. [2024-06-14 15:03:24,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 241 transitions, 2794 flow [2024-06-14 15:03:25,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 241 transitions, 2612 flow, removed 39 selfloop flow, removed 8 redundant places. [2024-06-14 15:03:25,011 INFO L231 Difference]: Finished difference. Result has 306 places, 221 transitions, 2083 flow [2024-06-14 15:03:25,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2052, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2083, PETRI_PLACES=306, PETRI_TRANSITIONS=221} [2024-06-14 15:03:25,012 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 276 predicate places. [2024-06-14 15:03:25,012 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 221 transitions, 2083 flow [2024-06-14 15:03:25,012 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-14 15:03:25,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:25,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:25,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2024-06-14 15:03:25,012 INFO L420 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:03:25,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:25,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1035541796, now seen corresponding path program 13 times [2024-06-14 15:03:25,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:25,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622432711] [2024-06-14 15:03:25,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:25,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:03:29,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:29,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622432711] [2024-06-14 15:03:29,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622432711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:29,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:29,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:03:29,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448785898] [2024-06-14 15:03:29,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:29,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:03:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:29,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:03:29,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:03:29,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:03:29,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 221 transitions, 2083 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-14 15:03:29,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:29,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:03:29,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:30,129 INFO L124 PetriNetUnfolderBase]: 609/1175 cut-off events. [2024-06-14 15:03:30,130 INFO L125 PetriNetUnfolderBase]: For 75387/75387 co-relation queries the response was YES. [2024-06-14 15:03:30,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6058 conditions, 1175 events. 609/1175 cut-off events. For 75387/75387 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6695 event pairs, 174 based on Foata normal form. 10/1182 useless extension candidates. Maximal degree in co-relation 5931. Up to 1056 conditions per place. [2024-06-14 15:03:30,143 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 202 selfloop transitions, 19 changer transitions 16/239 dead transitions. [2024-06-14 15:03:30,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 239 transitions, 2641 flow [2024-06-14 15:03:30,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:03:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:03:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-14 15:03:30,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3343108504398827 [2024-06-14 15:03:30,144 INFO L175 Difference]: Start difference. First operand has 306 places, 221 transitions, 2083 flow. Second operand 11 states and 114 transitions. [2024-06-14 15:03:30,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 239 transitions, 2641 flow [2024-06-14 15:03:30,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 239 transitions, 2547 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-14 15:03:30,355 INFO L231 Difference]: Finished difference. Result has 305 places, 215 transitions, 1990 flow [2024-06-14 15:03:30,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1989, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1990, PETRI_PLACES=305, PETRI_TRANSITIONS=215} [2024-06-14 15:03:30,356 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 275 predicate places. [2024-06-14 15:03:30,356 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 215 transitions, 1990 flow [2024-06-14 15:03:30,356 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-14 15:03:30,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:30,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:30,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2024-06-14 15:03:30,356 INFO L420 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:03:30,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:30,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1497256636, now seen corresponding path program 32 times [2024-06-14 15:03:30,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:30,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007076664] [2024-06-14 15:03:30,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:30,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:03:35,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:35,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007076664] [2024-06-14 15:03:35,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007076664] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:35,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:35,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:03:35,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616918931] [2024-06-14 15:03:35,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:35,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:03:35,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:35,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:03:35,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:03:35,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:03:35,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 215 transitions, 1990 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-14 15:03:35,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:35,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:03:35,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:35,712 INFO L124 PetriNetUnfolderBase]: 615/1189 cut-off events. [2024-06-14 15:03:35,712 INFO L125 PetriNetUnfolderBase]: For 93048/93048 co-relation queries the response was YES. [2024-06-14 15:03:35,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7223 conditions, 1189 events. 615/1189 cut-off events. For 93048/93048 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6781 event pairs, 178 based on Foata normal form. 2/1188 useless extension candidates. Maximal degree in co-relation 7097. Up to 933 conditions per place. [2024-06-14 15:03:35,725 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 183 selfloop transitions, 51 changer transitions 0/236 dead transitions. [2024-06-14 15:03:35,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 236 transitions, 2810 flow [2024-06-14 15:03:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:03:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:03:35,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 15:03:35,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-14 15:03:35,726 INFO L175 Difference]: Start difference. First operand has 305 places, 215 transitions, 1990 flow. Second operand 10 states and 115 transitions. [2024-06-14 15:03:35,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 236 transitions, 2810 flow [2024-06-14 15:03:36,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 236 transitions, 2750 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-06-14 15:03:36,062 INFO L231 Difference]: Finished difference. Result has 298 places, 217 transitions, 2146 flow [2024-06-14 15:03:36,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1942, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2146, PETRI_PLACES=298, PETRI_TRANSITIONS=217} [2024-06-14 15:03:36,063 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 268 predicate places. [2024-06-14 15:03:36,063 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 217 transitions, 2146 flow [2024-06-14 15:03:36,063 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-14 15:03:36,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:36,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:36,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2024-06-14 15:03:36,063 INFO L420 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:03:36,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:36,063 INFO L85 PathProgramCache]: Analyzing trace with hash 681851628, now seen corresponding path program 14 times [2024-06-14 15:03:36,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:36,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875463032] [2024-06-14 15:03:36,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:36,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:40,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-14 15:03:40,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:40,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875463032] [2024-06-14 15:03:40,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875463032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:40,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:40,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:03:40,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704868175] [2024-06-14 15:03:40,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:40,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:03:40,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:40,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:03:40,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:03:40,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:03:40,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 217 transitions, 2146 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-14 15:03:40,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:40,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:03:40,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:40,861 INFO L124 PetriNetUnfolderBase]: 656/1276 cut-off events. [2024-06-14 15:03:40,861 INFO L125 PetriNetUnfolderBase]: For 135967/135967 co-relation queries the response was YES. [2024-06-14 15:03:40,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8386 conditions, 1276 events. 656/1276 cut-off events. For 135967/135967 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 7357 event pairs, 199 based on Foata normal form. 8/1281 useless extension candidates. Maximal degree in co-relation 8263. Up to 991 conditions per place. [2024-06-14 15:03:40,875 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 188 selfloop transitions, 41 changer transitions 8/239 dead transitions. [2024-06-14 15:03:40,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 239 transitions, 2902 flow [2024-06-14 15:03:40,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:03:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:03:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-14 15:03:40,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 15:03:40,876 INFO L175 Difference]: Start difference. First operand has 298 places, 217 transitions, 2146 flow. Second operand 11 states and 124 transitions. [2024-06-14 15:03:40,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 239 transitions, 2902 flow [2024-06-14 15:03:41,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 239 transitions, 2756 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-06-14 15:03:41,289 INFO L231 Difference]: Finished difference. Result has 302 places, 214 transitions, 2067 flow [2024-06-14 15:03:41,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2000, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2067, PETRI_PLACES=302, PETRI_TRANSITIONS=214} [2024-06-14 15:03:41,290 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 272 predicate places. [2024-06-14 15:03:41,290 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 214 transitions, 2067 flow [2024-06-14 15:03:41,290 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-14 15:03:41,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:41,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:41,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2024-06-14 15:03:41,290 INFO L420 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:03:41,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:41,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1065868742, now seen corresponding path program 15 times [2024-06-14 15:03:41,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:41,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306469928] [2024-06-14 15:03:41,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:41,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:03:46,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:46,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306469928] [2024-06-14 15:03:46,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306469928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:46,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:46,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:03:46,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157467534] [2024-06-14 15:03:46,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:46,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:03:46,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:46,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:03:46,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:03:46,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:03:46,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 214 transitions, 2067 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-14 15:03:46,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:46,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:03:46,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:47,194 INFO L124 PetriNetUnfolderBase]: 653/1271 cut-off events. [2024-06-14 15:03:47,194 INFO L125 PetriNetUnfolderBase]: For 144716/144716 co-relation queries the response was YES. [2024-06-14 15:03:47,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8283 conditions, 1271 events. 653/1271 cut-off events. For 144716/144716 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7329 event pairs, 203 based on Foata normal form. 10/1278 useless extension candidates. Maximal degree in co-relation 8159. Up to 1070 conditions per place. [2024-06-14 15:03:47,207 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 182 selfloop transitions, 41 changer transitions 9/234 dead transitions. [2024-06-14 15:03:47,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 234 transitions, 2623 flow [2024-06-14 15:03:47,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:03:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:03:47,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2024-06-14 15:03:47,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34946236559139787 [2024-06-14 15:03:47,208 INFO L175 Difference]: Start difference. First operand has 302 places, 214 transitions, 2067 flow. Second operand 12 states and 130 transitions. [2024-06-14 15:03:47,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 234 transitions, 2623 flow [2024-06-14 15:03:47,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 234 transitions, 2541 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-14 15:03:47,653 INFO L231 Difference]: Finished difference. Result has 300 places, 211 transitions, 2049 flow [2024-06-14 15:03:47,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1985, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2049, PETRI_PLACES=300, PETRI_TRANSITIONS=211} [2024-06-14 15:03:47,653 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 270 predicate places. [2024-06-14 15:03:47,653 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 211 transitions, 2049 flow [2024-06-14 15:03:47,653 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-14 15:03:47,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:47,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:47,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2024-06-14 15:03:47,653 INFO L420 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:03:47,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:47,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1212800230, now seen corresponding path program 33 times [2024-06-14 15:03:47,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:47,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748332121] [2024-06-14 15:03:47,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:47,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:03:52,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:52,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748332121] [2024-06-14 15:03:52,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748332121] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:52,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:52,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:03:52,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434426139] [2024-06-14 15:03:52,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:52,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:03:52,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:52,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:03:52,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:03:53,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:03:53,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 211 transitions, 2049 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-14 15:03:53,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:53,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:03:53,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:53,519 INFO L124 PetriNetUnfolderBase]: 624/1216 cut-off events. [2024-06-14 15:03:53,520 INFO L125 PetriNetUnfolderBase]: For 108247/108247 co-relation queries the response was YES. [2024-06-14 15:03:53,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7801 conditions, 1216 events. 624/1216 cut-off events. For 108247/108247 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6928 event pairs, 150 based on Foata normal form. 2/1213 useless extension candidates. Maximal degree in co-relation 7679. Up to 1076 conditions per place. [2024-06-14 15:03:53,532 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 181 selfloop transitions, 42 changer transitions 0/225 dead transitions. [2024-06-14 15:03:53,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 225 transitions, 2529 flow [2024-06-14 15:03:53,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:03:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:03:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-14 15:03:53,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32903225806451614 [2024-06-14 15:03:53,533 INFO L175 Difference]: Start difference. First operand has 300 places, 211 transitions, 2049 flow. Second operand 10 states and 102 transitions. [2024-06-14 15:03:53,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 225 transitions, 2529 flow [2024-06-14 15:03:53,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 225 transitions, 2441 flow, removed 2 selfloop flow, removed 12 redundant places. [2024-06-14 15:03:53,892 INFO L231 Difference]: Finished difference. Result has 296 places, 211 transitions, 2049 flow [2024-06-14 15:03:53,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1961, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2049, PETRI_PLACES=296, PETRI_TRANSITIONS=211} [2024-06-14 15:03:53,892 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 266 predicate places. [2024-06-14 15:03:53,892 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 211 transitions, 2049 flow [2024-06-14 15:03:53,892 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-14 15:03:53,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:53,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:53,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2024-06-14 15:03:53,893 INFO L420 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:03:53,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:53,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1035302786, now seen corresponding path program 16 times [2024-06-14 15:03:53,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:53,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079220940] [2024-06-14 15:03:53,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:53,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:03:58,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:58,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079220940] [2024-06-14 15:03:58,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079220940] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:58,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:58,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:03:58,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143176229] [2024-06-14 15:03:58,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:58,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:03:58,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:58,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:03:58,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:03:58,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:03:58,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 211 transitions, 2049 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-14 15:03:58,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:58,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:03:58,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:58,585 INFO L124 PetriNetUnfolderBase]: 636/1244 cut-off events. [2024-06-14 15:03:58,585 INFO L125 PetriNetUnfolderBase]: For 123246/123246 co-relation queries the response was YES. [2024-06-14 15:03:58,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7897 conditions, 1244 events. 636/1244 cut-off events. For 123246/123246 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7144 event pairs, 208 based on Foata normal form. 8/1249 useless extension candidates. Maximal degree in co-relation 7776. Up to 1153 conditions per place. [2024-06-14 15:03:58,595 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 195 selfloop transitions, 17 changer transitions 12/226 dead transitions. [2024-06-14 15:03:58,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 226 transitions, 2561 flow [2024-06-14 15:03:58,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:03:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:03:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2024-06-14 15:03:58,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3258064516129032 [2024-06-14 15:03:58,595 INFO L175 Difference]: Start difference. First operand has 296 places, 211 transitions, 2049 flow. Second operand 10 states and 101 transitions. [2024-06-14 15:03:58,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 226 transitions, 2561 flow [2024-06-14 15:03:58,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 226 transitions, 2376 flow, removed 23 selfloop flow, removed 11 redundant places. [2024-06-14 15:03:58,968 INFO L231 Difference]: Finished difference. Result has 295 places, 207 transitions, 1880 flow [2024-06-14 15:03:58,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1864, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1880, PETRI_PLACES=295, PETRI_TRANSITIONS=207} [2024-06-14 15:03:58,968 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 265 predicate places. [2024-06-14 15:03:58,968 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 207 transitions, 1880 flow [2024-06-14 15:03:58,968 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-14 15:03:58,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:58,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:58,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2024-06-14 15:03:58,969 INFO L420 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:03:58,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:58,969 INFO L85 PathProgramCache]: Analyzing trace with hash -314390610, now seen corresponding path program 17 times [2024-06-14 15:03:58,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:58,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757688469] [2024-06-14 15:03:58,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:58,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:03,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-14 15:04:03,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:03,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757688469] [2024-06-14 15:04:03,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757688469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:03,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:03,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:04:03,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103324998] [2024-06-14 15:04:03,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:03,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:04:03,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:03,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:04:03,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:04:03,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:04:03,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 207 transitions, 1880 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-14 15:04:03,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:03,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:04:03,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:04:03,834 INFO L124 PetriNetUnfolderBase]: 632/1236 cut-off events. [2024-06-14 15:04:03,834 INFO L125 PetriNetUnfolderBase]: For 131323/131323 co-relation queries the response was YES. [2024-06-14 15:04:03,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7613 conditions, 1236 events. 632/1236 cut-off events. For 131323/131323 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7086 event pairs, 158 based on Foata normal form. 10/1241 useless extension candidates. Maximal degree in co-relation 7494. Up to 1052 conditions per place. [2024-06-14 15:04:03,846 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 172 selfloop transitions, 42 changer transitions 11/227 dead transitions. [2024-06-14 15:04:03,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 227 transitions, 2422 flow [2024-06-14 15:04:03,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:04:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:04:03,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-14 15:04:03,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-14 15:04:03,847 INFO L175 Difference]: Start difference. First operand has 295 places, 207 transitions, 1880 flow. Second operand 11 states and 116 transitions. [2024-06-14 15:04:03,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 227 transitions, 2422 flow [2024-06-14 15:04:04,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 227 transitions, 2378 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-14 15:04:04,187 INFO L231 Difference]: Finished difference. Result has 291 places, 204 transitions, 1910 flow [2024-06-14 15:04:04,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1838, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1910, PETRI_PLACES=291, PETRI_TRANSITIONS=204} [2024-06-14 15:04:04,187 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 261 predicate places. [2024-06-14 15:04:04,187 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 204 transitions, 1910 flow [2024-06-14 15:04:04,187 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-14 15:04:04,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:04,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:04:04,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2024-06-14 15:04:04,187 INFO L420 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:04:04,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:04,188 INFO L85 PathProgramCache]: Analyzing trace with hash 250409298, now seen corresponding path program 18 times [2024-06-14 15:04:04,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:04,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330590736] [2024-06-14 15:04:04,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:04,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:04:08,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:08,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330590736] [2024-06-14 15:04:08,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330590736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:08,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:08,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:04:08,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263433652] [2024-06-14 15:04:08,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:08,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:04:08,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:08,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:04:08,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:04:08,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:04:08,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 204 transitions, 1910 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-14 15:04:08,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:08,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:04:08,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:04:09,016 INFO L124 PetriNetUnfolderBase]: 608/1196 cut-off events. [2024-06-14 15:04:09,016 INFO L125 PetriNetUnfolderBase]: For 113147/113147 co-relation queries the response was YES. [2024-06-14 15:04:09,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7096 conditions, 1196 events. 608/1196 cut-off events. For 113147/113147 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6850 event pairs, 196 based on Foata normal form. 10/1203 useless extension candidates. Maximal degree in co-relation 6979. Up to 1005 conditions per place. [2024-06-14 15:04:09,027 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 169 selfloop transitions, 37 changer transitions 16/224 dead transitions. [2024-06-14 15:04:09,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 224 transitions, 2444 flow [2024-06-14 15:04:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:04:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:04:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-14 15:04:09,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36070381231671556 [2024-06-14 15:04:09,028 INFO L175 Difference]: Start difference. First operand has 291 places, 204 transitions, 1910 flow. Second operand 11 states and 123 transitions. [2024-06-14 15:04:09,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 224 transitions, 2444 flow [2024-06-14 15:04:09,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 224 transitions, 2358 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-14 15:04:09,303 INFO L231 Difference]: Finished difference. Result has 290 places, 198 transitions, 1860 flow [2024-06-14 15:04:09,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1860, PETRI_PLACES=290, PETRI_TRANSITIONS=198} [2024-06-14 15:04:09,303 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 260 predicate places. [2024-06-14 15:04:09,303 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 198 transitions, 1860 flow [2024-06-14 15:04:09,303 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-14 15:04:09,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:09,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:04:09,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2024-06-14 15:04:09,304 INFO L420 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:04:09,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:09,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1408829314, now seen corresponding path program 19 times [2024-06-14 15:04:09,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:09,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179862443] [2024-06-14 15:04:09,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:09,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:04:13,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:13,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179862443] [2024-06-14 15:04:13,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179862443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:13,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:13,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:04:13,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12451717] [2024-06-14 15:04:13,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:13,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:04:13,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:13,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:04:13,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:04:13,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:04:13,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 198 transitions, 1860 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-14 15:04:13,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:13,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:04:13,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:04:14,051 INFO L124 PetriNetUnfolderBase]: 606/1202 cut-off events. [2024-06-14 15:04:14,051 INFO L125 PetriNetUnfolderBase]: For 129687/129687 co-relation queries the response was YES. [2024-06-14 15:04:14,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7737 conditions, 1202 events. 606/1202 cut-off events. For 129687/129687 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6892 event pairs, 263 based on Foata normal form. 8/1209 useless extension candidates. Maximal degree in co-relation 7620. Up to 933 conditions per place. [2024-06-14 15:04:14,060 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 190 selfloop transitions, 18 changer transitions 10/220 dead transitions. [2024-06-14 15:04:14,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 220 transitions, 2566 flow [2024-06-14 15:04:14,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:04:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:04:14,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-14 15:04:14,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077 [2024-06-14 15:04:14,061 INFO L175 Difference]: Start difference. First operand has 290 places, 198 transitions, 1860 flow. Second operand 11 states and 115 transitions. [2024-06-14 15:04:14,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 220 transitions, 2566 flow [2024-06-14 15:04:14,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 220 transitions, 2474 flow, removed 9 selfloop flow, removed 11 redundant places. [2024-06-14 15:04:14,325 INFO L231 Difference]: Finished difference. Result has 284 places, 195 transitions, 1799 flow [2024-06-14 15:04:14,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1776, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1799, PETRI_PLACES=284, PETRI_TRANSITIONS=195} [2024-06-14 15:04:14,325 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 254 predicate places. [2024-06-14 15:04:14,325 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 195 transitions, 1799 flow [2024-06-14 15:04:14,325 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-14 15:04:14,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:14,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:04:14,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2024-06-14 15:04:14,326 INFO L420 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:04:14,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:14,326 INFO L85 PathProgramCache]: Analyzing trace with hash 486584658, now seen corresponding path program 20 times [2024-06-14 15:04:14,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:14,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718943246] [2024-06-14 15:04:14,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:14,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:04:18,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:18,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718943246] [2024-06-14 15:04:18,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718943246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:18,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:18,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:04:18,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360879481] [2024-06-14 15:04:18,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:18,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:04:18,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:18,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:04:18,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:04:18,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:04:18,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 195 transitions, 1799 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-14 15:04:18,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:18,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:04:18,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:04:18,819 INFO L124 PetriNetUnfolderBase]: 568/1128 cut-off events. [2024-06-14 15:04:18,819 INFO L125 PetriNetUnfolderBase]: For 98827/98827 co-relation queries the response was YES. [2024-06-14 15:04:18,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6393 conditions, 1128 events. 568/1128 cut-off events. For 98827/98827 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6400 event pairs, 251 based on Foata normal form. 12/1139 useless extension candidates. Maximal degree in co-relation 6279. Up to 1022 conditions per place. [2024-06-14 15:04:18,830 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 181 selfloop transitions, 20 changer transitions 8/211 dead transitions. [2024-06-14 15:04:18,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 211 transitions, 2293 flow [2024-06-14 15:04:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:04:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:04:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2024-06-14 15:04:18,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3196480938416422 [2024-06-14 15:04:18,831 INFO L175 Difference]: Start difference. First operand has 284 places, 195 transitions, 1799 flow. Second operand 11 states and 109 transitions. [2024-06-14 15:04:18,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 211 transitions, 2293 flow [2024-06-14 15:04:19,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 211 transitions, 2230 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-06-14 15:04:19,104 INFO L231 Difference]: Finished difference. Result has 281 places, 191 transitions, 1754 flow [2024-06-14 15:04:19,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1754, PETRI_PLACES=281, PETRI_TRANSITIONS=191} [2024-06-14 15:04:19,104 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 251 predicate places. [2024-06-14 15:04:19,105 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 191 transitions, 1754 flow [2024-06-14 15:04:19,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-14 15:04:19,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:19,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:04:19,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2024-06-14 15:04:19,105 INFO L420 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:04:19,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:19,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1082121108, now seen corresponding path program 21 times [2024-06-14 15:04:19,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:19,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036652997] [2024-06-14 15:04:19,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:19,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:23,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:04:23,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:23,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036652997] [2024-06-14 15:04:23,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036652997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:23,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:23,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:04:23,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333131620] [2024-06-14 15:04:23,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:23,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:04:23,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:23,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:04:23,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:04:23,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:04:23,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 191 transitions, 1754 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-14 15:04:23,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:23,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:04:23,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:04:23,587 INFO L124 PetriNetUnfolderBase]: 554/1106 cut-off events. [2024-06-14 15:04:23,588 INFO L125 PetriNetUnfolderBase]: For 82556/82556 co-relation queries the response was YES. [2024-06-14 15:04:23,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6218 conditions, 1106 events. 554/1106 cut-off events. For 82556/82556 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6273 event pairs, 243 based on Foata normal form. 8/1113 useless extension candidates. Maximal degree in co-relation 6106. Up to 933 conditions per place. [2024-06-14 15:04:23,598 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 184 selfloop transitions, 13 changer transitions 12/211 dead transitions. [2024-06-14 15:04:23,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 211 transitions, 2428 flow [2024-06-14 15:04:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:04:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:04:23,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-14 15:04:23,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-14 15:04:23,599 INFO L175 Difference]: Start difference. First operand has 281 places, 191 transitions, 1754 flow. Second operand 10 states and 105 transitions. [2024-06-14 15:04:23,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 211 transitions, 2428 flow [2024-06-14 15:04:23,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 211 transitions, 2288 flow, removed 9 selfloop flow, removed 13 redundant places. [2024-06-14 15:04:23,844 INFO L231 Difference]: Finished difference. Result has 278 places, 184 transitions, 1611 flow [2024-06-14 15:04:23,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1618, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1611, PETRI_PLACES=278, PETRI_TRANSITIONS=184} [2024-06-14 15:04:23,844 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 248 predicate places. [2024-06-14 15:04:23,844 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 184 transitions, 1611 flow [2024-06-14 15:04:23,844 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-14 15:04:23,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:23,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:04:23,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2024-06-14 15:04:23,844 INFO L420 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:04:23,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:23,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1704287524, now seen corresponding path program 22 times [2024-06-14 15:04:23,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:23,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329519310] [2024-06-14 15:04:23,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:23,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:29,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-14 15:04:29,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:29,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329519310] [2024-06-14 15:04:29,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329519310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:29,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:29,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:04:29,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825955978] [2024-06-14 15:04:29,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:29,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:04:29,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:29,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:04:29,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:04:29,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:04:29,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 184 transitions, 1611 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-14 15:04:29,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:29,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:04:29,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:04:29,771 INFO L124 PetriNetUnfolderBase]: 529/1059 cut-off events. [2024-06-14 15:04:29,771 INFO L125 PetriNetUnfolderBase]: For 75914/75914 co-relation queries the response was YES. [2024-06-14 15:04:29,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5539 conditions, 1059 events. 529/1059 cut-off events. For 75914/75914 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5937 event pairs, 243 based on Foata normal form. 10/1068 useless extension candidates. Maximal degree in co-relation 5427. Up to 970 conditions per place. [2024-06-14 15:04:29,781 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 176 selfloop transitions, 14 changer transitions 9/201 dead transitions. [2024-06-14 15:04:29,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 201 transitions, 2087 flow [2024-06-14 15:04:29,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:04:29,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:04:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2024-06-14 15:04:29,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3010752688172043 [2024-06-14 15:04:29,782 INFO L175 Difference]: Start difference. First operand has 278 places, 184 transitions, 1611 flow. Second operand 12 states and 112 transitions. [2024-06-14 15:04:29,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 201 transitions, 2087 flow [2024-06-14 15:04:29,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 201 transitions, 2052 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-14 15:04:29,980 INFO L231 Difference]: Finished difference. Result has 273 places, 181 transitions, 1591 flow [2024-06-14 15:04:29,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1591, PETRI_PLACES=273, PETRI_TRANSITIONS=181} [2024-06-14 15:04:29,981 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 243 predicate places. [2024-06-14 15:04:29,981 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 181 transitions, 1591 flow [2024-06-14 15:04:29,981 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-14 15:04:29,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:29,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:04:29,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2024-06-14 15:04:29,981 INFO L420 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:04:29,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:29,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2008902062, now seen corresponding path program 1 times [2024-06-14 15:04:29,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:29,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318616834] [2024-06-14 15:04:29,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:29,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:04:35,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:35,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318616834] [2024-06-14 15:04:35,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318616834] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:35,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:35,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:04:35,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456171859] [2024-06-14 15:04:35,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:35,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:04:35,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:35,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:04:35,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:04:35,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 15:04:35,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 181 transitions, 1591 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-14 15:04:35,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:35,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 15:04:35,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:04:35,875 INFO L124 PetriNetUnfolderBase]: 511/1028 cut-off events. [2024-06-14 15:04:35,875 INFO L125 PetriNetUnfolderBase]: For 61351/61351 co-relation queries the response was YES. [2024-06-14 15:04:35,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5312 conditions, 1028 events. 511/1028 cut-off events. For 61351/61351 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5757 event pairs, 129 based on Foata normal form. 6/1033 useless extension candidates. Maximal degree in co-relation 5203. Up to 875 conditions per place. [2024-06-14 15:04:35,885 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 161 selfloop transitions, 22 changer transitions 20/205 dead transitions. [2024-06-14 15:04:35,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 205 transitions, 2059 flow [2024-06-14 15:04:35,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:04:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:04:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 119 transitions. [2024-06-14 15:04:35,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31989247311827956 [2024-06-14 15:04:35,885 INFO L175 Difference]: Start difference. First operand has 273 places, 181 transitions, 1591 flow. Second operand 12 states and 119 transitions. [2024-06-14 15:04:35,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 205 transitions, 2059 flow [2024-06-14 15:04:36,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 205 transitions, 2021 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-14 15:04:36,087 INFO L231 Difference]: Finished difference. Result has 271 places, 175 transitions, 1560 flow [2024-06-14 15:04:36,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1560, PETRI_PLACES=271, PETRI_TRANSITIONS=175} [2024-06-14 15:04:36,087 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 241 predicate places. [2024-06-14 15:04:36,087 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 175 transitions, 1560 flow [2024-06-14 15:04:36,087 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-14 15:04:36,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:36,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:04:36,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2024-06-14 15:04:36,087 INFO L420 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:04:36,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:36,088 INFO L85 PathProgramCache]: Analyzing trace with hash -342239616, now seen corresponding path program 2 times [2024-06-14 15:04:36,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:36,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506917982] [2024-06-14 15:04:36,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:36,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15