./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix031.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix031.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 17:11:14,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 17:11:14,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 17:11:14,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 17:11:14,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 17:11:14,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 17:11:14,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 17:11:14,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 17:11:14,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 17:11:14,995 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 17:11:14,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 17:11:14,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 17:11:14,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 17:11:15,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 17:11:15,001 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 17:11:15,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 17:11:15,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 17:11:15,002 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 17:11:15,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 17:11:15,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 17:11:15,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 17:11:15,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 17:11:15,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 17:11:15,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 17:11:15,005 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 17:11:15,005 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 17:11:15,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 17:11:15,006 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 17:11:15,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 17:11:15,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 17:11:15,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 17:11:15,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 17:11:15,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:11:15,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 17:11:15,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 17:11:15,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 17:11:15,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 17:11:15,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 17:11:15,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 17:11:15,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 17:11:15,010 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 17:11:15,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 17:11:15,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 17:11:15,011 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 17:11:15,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 17:11:15,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 17:11:15,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 17:11:15,281 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 17:11:15,281 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 17:11:15,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2024-06-04 17:11:16,518 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 17:11:16,791 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 17:11:16,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2024-06-04 17:11:16,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d16e551b0/02aa3fa2316340518483f38268871568/FLAGded83bd2c [2024-06-04 17:11:16,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d16e551b0/02aa3fa2316340518483f38268871568 [2024-06-04 17:11:16,824 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 17:11:16,825 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 17:11:16,826 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/mix031.opt.yml/witness.yml [2024-06-04 17:11:17,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 17:11:17,035 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 17:11:17,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 17:11:17,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 17:11:17,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 17:11:17,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:11:16" (1/2) ... [2024-06-04 17:11:17,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4e8d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:17, skipping insertion in model container [2024-06-04 17:11:17,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:11:16" (1/2) ... [2024-06-04 17:11:17,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@e2bef15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:11:17, skipping insertion in model container [2024-06-04 17:11:17,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:11:17" (2/2) ... [2024-06-04 17:11:17,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4e8d0f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:17, skipping insertion in model container [2024-06-04 17:11:17,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:11:17" (2/2) ... [2024-06-04 17:11:17,049 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 17:11:17,139 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 17:11:17,141 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] (((((((((((((((((((! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 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 )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 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 )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )a) - (long long )x >= 0LL) && (1LL + (long long )a) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a) - (long long )x >= 0LL) && (2LL - (long long )a) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && a <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) [2024-06-04 17:11:17,142 INFO L97 edCorrectnessWitness]: Location invariant before [L827-L827] (((((((((((((((((((! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 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 )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 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 )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )a) - (long long )x >= 0LL) && (1LL + (long long )a) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a) - (long long )x >= 0LL) && (2LL - (long long )a) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && a <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) [2024-06-04 17:11:17,143 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 17:11:17,143 INFO L106 edCorrectnessWitness]: ghost_update [L824-L824] multithreaded = 1; [2024-06-04 17:11:17,191 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 17:11:17,479 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:11:17,494 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 17:11:17,859 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:11:17,906 INFO L206 MainTranslator]: Completed translation [2024-06-04 17:11:17,912 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:17 WrapperNode [2024-06-04 17:11:17,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 17:11:17,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 17:11:17,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 17:11:17,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 17:11:17,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:17" (1/1) ... [2024-06-04 17:11:17,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:17" (1/1) ... [2024-06-04 17:11:18,041 INFO L138 Inliner]: procedures = 174, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 123 [2024-06-04 17:11:18,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 17:11:18,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 17:11:18,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 17:11:18,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 17:11:18,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:17" (1/1) ... [2024-06-04 17:11:18,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:17" (1/1) ... [2024-06-04 17:11:18,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:17" (1/1) ... [2024-06-04 17:11:18,127 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 17:11:18,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:17" (1/1) ... [2024-06-04 17:11:18,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:17" (1/1) ... [2024-06-04 17:11:18,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:17" (1/1) ... [2024-06-04 17:11:18,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:17" (1/1) ... [2024-06-04 17:11:18,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:17" (1/1) ... [2024-06-04 17:11:18,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:17" (1/1) ... [2024-06-04 17:11:18,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 17:11:18,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 17:11:18,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 17:11:18,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 17:11:18,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:17" (1/1) ... [2024-06-04 17:11:18,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:11:18,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 17:11:18,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 17:11:18,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 17:11:18,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 17:11:18,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 17:11:18,284 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 17:11:18,284 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 17:11:18,285 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 17:11:18,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 17:11:18,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 17:11:18,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 17:11:18,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 17:11:18,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 17:11:18,287 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 17:11:18,423 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 17:11:18,426 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 17:11:19,762 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 17:11:19,763 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 17:11:20,052 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 17:11:20,053 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 17:11:20,055 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:11:20 BoogieIcfgContainer [2024-06-04 17:11:20,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 17:11:20,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 17:11:20,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 17:11:20,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 17:11:20,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:11:16" (1/4) ... [2024-06-04 17:11:20,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3c5336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:11:20, skipping insertion in model container [2024-06-04 17:11:20,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:11:17" (2/4) ... [2024-06-04 17:11:20,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3c5336 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:11:20, skipping insertion in model container [2024-06-04 17:11:20,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:11:17" (3/4) ... [2024-06-04 17:11:20,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3c5336 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:11:20, skipping insertion in model container [2024-06-04 17:11:20,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:11:20" (4/4) ... [2024-06-04 17:11:20,065 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2024-06-04 17:11:20,083 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 17:11:20,084 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 17:11:20,084 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 17:11:20,216 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 17:11:20,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 76 flow [2024-06-04 17:11:20,314 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2024-06-04 17:11:20,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:11:20,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 17:11:20,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 34 transitions, 76 flow [2024-06-04 17:11:20,321 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 58 flow [2024-06-04 17:11:20,333 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 17:11:20,365 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;@7e07df7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 17:11:20,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 17:11:20,388 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 17:11:20,388 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-04 17:11:20,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:11:20,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:20,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 17:11:20,392 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:11:20,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:20,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1705962069, now seen corresponding path program 1 times [2024-06-04 17:11:20,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:20,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591640796] [2024-06-04 17:11:20,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:20,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:11:29,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:29,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591640796] [2024-06-04 17:11:29,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591640796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:29,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:29,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 17:11:29,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388261104] [2024-06-04 17:11:29,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:29,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 17:11:29,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:29,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 17:11:29,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 17:11:29,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2024-06-04 17:11:29,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:11:29,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:29,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2024-06-04 17:11:29,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:29,725 INFO L124 PetriNetUnfolderBase]: 162/327 cut-off events. [2024-06-04 17:11:29,725 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-04 17:11:29,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 327 events. 162/327 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1327 event pairs, 97 based on Foata normal form. 1/313 useless extension candidates. Maximal degree in co-relation 626. Up to 288 conditions per place. [2024-06-04 17:11:29,732 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 23 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2024-06-04 17:11:29,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 125 flow [2024-06-04 17:11:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 17:11:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 17:11:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-06-04 17:11:29,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5980392156862745 [2024-06-04 17:11:29,745 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 58 flow. Second operand 3 states and 61 transitions. [2024-06-04 17:11:29,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 125 flow [2024-06-04 17:11:29,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 17:11:29,750 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 77 flow [2024-06-04 17:11:29,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2024-06-04 17:11:29,755 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2024-06-04 17:11:29,755 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 77 flow [2024-06-04 17:11:29,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:11:29,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:29,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:11:29,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 17:11:29,757 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:11:29,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:29,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1247929228, now seen corresponding path program 1 times [2024-06-04 17:11:29,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:29,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733528766] [2024-06-04 17:11:29,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:29,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:11:35,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:35,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733528766] [2024-06-04 17:11:35,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733528766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:35,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:35,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 17:11:35,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933724577] [2024-06-04 17:11:35,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:35,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 17:11:35,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:35,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 17:11:35,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 17:11:35,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-06-04 17:11:35,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:11:35,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:35,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-06-04 17:11:35,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:36,379 INFO L124 PetriNetUnfolderBase]: 186/357 cut-off events. [2024-06-04 17:11:36,380 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-06-04 17:11:36,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 357 events. 186/357 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1447 event pairs, 94 based on Foata normal form. 2/353 useless extension candidates. Maximal degree in co-relation 786. Up to 319 conditions per place. [2024-06-04 17:11:36,384 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 28 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2024-06-04 17:11:36,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 169 flow [2024-06-04 17:11:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 17:11:36,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 17:11:36,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2024-06-04 17:11:36,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5514705882352942 [2024-06-04 17:11:36,387 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 77 flow. Second operand 4 states and 75 transitions. [2024-06-04 17:11:36,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 169 flow [2024-06-04 17:11:36,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 17:11:36,389 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2024-06-04 17:11:36,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2024-06-04 17:11:36,390 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2024-06-04 17:11:36,390 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2024-06-04 17:11:36,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:11:36,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:36,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:11:36,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 17:11:36,391 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:11:36,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash -31099420, now seen corresponding path program 1 times [2024-06-04 17:11:36,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:36,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65055370] [2024-06-04 17:11:36,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:36,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:11:41,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:41,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65055370] [2024-06-04 17:11:41,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65055370] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:41,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:41,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 17:11:41,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662375184] [2024-06-04 17:11:41,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:41,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 17:11:41,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:41,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 17:11:41,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 17:11:41,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-06-04 17:11:41,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:11:41,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:41,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-06-04 17:11:41,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:42,268 INFO L124 PetriNetUnfolderBase]: 219/413 cut-off events. [2024-06-04 17:11:42,268 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2024-06-04 17:11:42,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 413 events. 219/413 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1641 event pairs, 99 based on Foata normal form. 2/411 useless extension candidates. Maximal degree in co-relation 1004. Up to 366 conditions per place. [2024-06-04 17:11:42,277 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 33 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2024-06-04 17:11:42,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 219 flow [2024-06-04 17:11:42,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:11:42,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:11:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-06-04 17:11:42,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117647058823529 [2024-06-04 17:11:42,279 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 5 states and 87 transitions. [2024-06-04 17:11:42,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 219 flow [2024-06-04 17:11:42,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 210 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 17:11:42,282 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 125 flow [2024-06-04 17:11:42,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-06-04 17:11:42,283 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2024-06-04 17:11:42,283 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 125 flow [2024-06-04 17:11:42,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:11:42,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:42,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:11:42,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 17:11:42,284 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:11:42,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:42,285 INFO L85 PathProgramCache]: Analyzing trace with hash -964081005, now seen corresponding path program 1 times [2024-06-04 17:11:42,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:42,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803090238] [2024-06-04 17:11:42,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:42,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:11:47,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:47,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803090238] [2024-06-04 17:11:47,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803090238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:47,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:47,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:11:47,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16417254] [2024-06-04 17:11:47,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:47,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:11:47,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:47,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:11:47,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:11:47,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-06-04 17:11:47,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:11:47,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:47,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-06-04 17:11:47,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:48,280 INFO L124 PetriNetUnfolderBase]: 216/410 cut-off events. [2024-06-04 17:11:48,281 INFO L125 PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES. [2024-06-04 17:11:48,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 410 events. 216/410 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1604 event pairs, 78 based on Foata normal form. 2/408 useless extension candidates. Maximal degree in co-relation 1084. Up to 352 conditions per place. [2024-06-04 17:11:48,285 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 37 selfloop transitions, 9 changer transitions 0/50 dead transitions. [2024-06-04 17:11:48,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 267 flow [2024-06-04 17:11:48,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:11:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:11:48,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-04 17:11:48,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-04 17:11:48,291 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 125 flow. Second operand 6 states and 102 transitions. [2024-06-04 17:11:48,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 267 flow [2024-06-04 17:11:48,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 252 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 17:11:48,295 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 149 flow [2024-06-04 17:11:48,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2024-06-04 17:11:48,296 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2024-06-04 17:11:48,297 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 149 flow [2024-06-04 17:11:48,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:11:48,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:48,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:11:48,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 17:11:48,297 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:11:48,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:48,298 INFO L85 PathProgramCache]: Analyzing trace with hash 176477025, now seen corresponding path program 1 times [2024-06-04 17:11:48,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:48,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106185272] [2024-06-04 17:11:48,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:48,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:11:55,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:55,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106185272] [2024-06-04 17:11:55,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106185272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:55,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:55,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:11:55,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211209743] [2024-06-04 17:11:55,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:55,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:11:55,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:55,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:11:55,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:11:55,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-06-04 17:11:55,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 149 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:11:55,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:55,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-06-04 17:11:55,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:56,109 INFO L124 PetriNetUnfolderBase]: 213/404 cut-off events. [2024-06-04 17:11:56,109 INFO L125 PetriNetUnfolderBase]: For 576/576 co-relation queries the response was YES. [2024-06-04 17:11:56,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 404 events. 213/404 cut-off events. For 576/576 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1568 event pairs, 57 based on Foata normal form. 2/401 useless extension candidates. Maximal degree in co-relation 1151. Up to 338 conditions per place. [2024-06-04 17:11:56,113 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 41 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2024-06-04 17:11:56,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 315 flow [2024-06-04 17:11:56,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:11:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:11:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-04 17:11:56,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49159663865546216 [2024-06-04 17:11:56,114 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 149 flow. Second operand 7 states and 117 transitions. [2024-06-04 17:11:56,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 315 flow [2024-06-04 17:11:56,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 294 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 17:11:56,118 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 173 flow [2024-06-04 17:11:56,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, 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=7, PETRI_FLOW=173, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-06-04 17:11:56,119 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2024-06-04 17:11:56,119 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 173 flow [2024-06-04 17:11:56,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:11:56,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:56,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:11:56,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 17:11:56,120 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:11:56,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:56,120 INFO L85 PathProgramCache]: Analyzing trace with hash -349451833, now seen corresponding path program 1 times [2024-06-04 17:11:56,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:56,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775655590] [2024-06-04 17:11:56,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:56,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:12:06,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:06,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775655590] [2024-06-04 17:12:06,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775655590] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:06,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:06,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:12:06,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936547456] [2024-06-04 17:12:06,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:06,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:12:06,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:06,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:12:06,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:12:06,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-06-04 17:12:06,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:06,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:06,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-06-04 17:12:06,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:06,487 INFO L124 PetriNetUnfolderBase]: 165/350 cut-off events. [2024-06-04 17:12:06,487 INFO L125 PetriNetUnfolderBase]: For 660/660 co-relation queries the response was YES. [2024-06-04 17:12:06,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 350 events. 165/350 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1427 event pairs, 46 based on Foata normal form. 1/346 useless extension candidates. Maximal degree in co-relation 1032. Up to 291 conditions per place. [2024-06-04 17:12:06,490 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 30 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2024-06-04 17:12:06,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 43 transitions, 263 flow [2024-06-04 17:12:06,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:12:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:12:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-06-04 17:12:06,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2024-06-04 17:12:06,491 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 173 flow. Second operand 5 states and 80 transitions. [2024-06-04 17:12:06,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 43 transitions, 263 flow [2024-06-04 17:12:06,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 236 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 17:12:06,494 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 173 flow [2024-06-04 17:12:06,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2024-06-04 17:12:06,495 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2024-06-04 17:12:06,495 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 173 flow [2024-06-04 17:12:06,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:06,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:06,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:12:06,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 17:12:06,496 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:12:06,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2068876627, now seen corresponding path program 1 times [2024-06-04 17:12:06,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:06,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963497837] [2024-06-04 17:12:06,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:06,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:12:16,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:16,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963497837] [2024-06-04 17:12:16,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963497837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:16,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:16,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:12:16,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355758060] [2024-06-04 17:12:16,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:16,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:12:16,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:16,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:12:16,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:12:16,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-06-04 17:12:16,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 173 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:16,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:16,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-06-04 17:12:16,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:16,688 INFO L124 PetriNetUnfolderBase]: 191/384 cut-off events. [2024-06-04 17:12:16,688 INFO L125 PetriNetUnfolderBase]: For 994/994 co-relation queries the response was YES. [2024-06-04 17:12:16,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 384 events. 191/384 cut-off events. For 994/994 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1551 event pairs, 55 based on Foata normal form. 1/385 useless extension candidates. Maximal degree in co-relation 1204. Up to 335 conditions per place. [2024-06-04 17:12:16,691 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 32 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-04 17:12:16,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 275 flow [2024-06-04 17:12:16,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:12:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:12:16,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-06-04 17:12:16,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43137254901960786 [2024-06-04 17:12:16,693 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 173 flow. Second operand 6 states and 88 transitions. [2024-06-04 17:12:16,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 275 flow [2024-06-04 17:12:16,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 264 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 17:12:16,695 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 195 flow [2024-06-04 17:12:16,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-06-04 17:12:16,696 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2024-06-04 17:12:16,696 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 195 flow [2024-06-04 17:12:16,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:16,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:16,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:12:16,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 17:12:16,697 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:12:16,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:16,698 INFO L85 PathProgramCache]: Analyzing trace with hash -823368730, now seen corresponding path program 1 times [2024-06-04 17:12:16,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:16,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72720329] [2024-06-04 17:12:16,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:16,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:12:26,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:26,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72720329] [2024-06-04 17:12:26,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72720329] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:26,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:26,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:12:26,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592841158] [2024-06-04 17:12:26,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:26,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:12:26,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:26,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:12:26,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:12:26,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-06-04 17:12:26,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 195 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:26,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:26,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-06-04 17:12:26,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:26,664 INFO L124 PetriNetUnfolderBase]: 209/405 cut-off events. [2024-06-04 17:12:26,665 INFO L125 PetriNetUnfolderBase]: For 1514/1514 co-relation queries the response was YES. [2024-06-04 17:12:26,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 405 events. 209/405 cut-off events. For 1514/1514 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1625 event pairs, 61 based on Foata normal form. 1/406 useless extension candidates. Maximal degree in co-relation 1391. Up to 348 conditions per place. [2024-06-04 17:12:26,669 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 36 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2024-06-04 17:12:26,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 313 flow [2024-06-04 17:12:26,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:12:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:12:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2024-06-04 17:12:26,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44607843137254904 [2024-06-04 17:12:26,672 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 195 flow. Second operand 6 states and 91 transitions. [2024-06-04 17:12:26,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 313 flow [2024-06-04 17:12:26,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 296 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:12:26,677 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 211 flow [2024-06-04 17:12:26,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-04 17:12:26,687 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2024-06-04 17:12:26,687 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 211 flow [2024-06-04 17:12:26,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:26,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:26,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:12:26,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 17:12:26,689 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:12:26,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:26,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2090730976, now seen corresponding path program 1 times [2024-06-04 17:12:26,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:26,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902968146] [2024-06-04 17:12:26,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:26,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:12:33,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:33,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902968146] [2024-06-04 17:12:33,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902968146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:33,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:33,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:12:33,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915720821] [2024-06-04 17:12:33,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:33,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:12:33,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:33,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:12:33,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:12:33,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-06-04 17:12:33,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 211 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:33,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:33,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-06-04 17:12:33,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:33,920 INFO L124 PetriNetUnfolderBase]: 223/415 cut-off events. [2024-06-04 17:12:33,920 INFO L125 PetriNetUnfolderBase]: For 1864/1864 co-relation queries the response was YES. [2024-06-04 17:12:33,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 415 events. 223/415 cut-off events. For 1864/1864 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1576 event pairs, 39 based on Foata normal form. 4/419 useless extension candidates. Maximal degree in co-relation 1492. Up to 327 conditions per place. [2024-06-04 17:12:33,923 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 46 selfloop transitions, 12 changer transitions 0/63 dead transitions. [2024-06-04 17:12:33,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 63 transitions, 369 flow [2024-06-04 17:12:33,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:12:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:12:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-04 17:12:33,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46691176470588236 [2024-06-04 17:12:33,925 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 211 flow. Second operand 8 states and 127 transitions. [2024-06-04 17:12:33,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 63 transitions, 369 flow [2024-06-04 17:12:33,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 352 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:12:33,928 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 210 flow [2024-06-04 17:12:33,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2024-06-04 17:12:33,929 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places. [2024-06-04 17:12:33,929 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 210 flow [2024-06-04 17:12:33,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:33,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:33,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:12:33,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 17:12:33,930 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:12:33,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:33,930 INFO L85 PathProgramCache]: Analyzing trace with hash -815750170, now seen corresponding path program 2 times [2024-06-04 17:12:33,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:33,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657522418] [2024-06-04 17:12:33,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:33,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:12:43,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:43,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657522418] [2024-06-04 17:12:43,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657522418] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:43,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:43,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:12:43,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646207256] [2024-06-04 17:12:43,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:43,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:12:43,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:43,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:12:43,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:12:43,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-06-04 17:12:43,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:43,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:43,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-06-04 17:12:43,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:44,080 INFO L124 PetriNetUnfolderBase]: 204/395 cut-off events. [2024-06-04 17:12:44,080 INFO L125 PetriNetUnfolderBase]: For 2203/2203 co-relation queries the response was YES. [2024-06-04 17:12:44,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 395 events. 204/395 cut-off events. For 2203/2203 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1533 event pairs, 58 based on Foata normal form. 1/396 useless extension candidates. Maximal degree in co-relation 1483. Up to 332 conditions per place. [2024-06-04 17:12:44,084 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 34 selfloop transitions, 12 changer transitions 0/53 dead transitions. [2024-06-04 17:12:44,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 338 flow [2024-06-04 17:12:44,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:12:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:12:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2024-06-04 17:12:44,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4327731092436975 [2024-06-04 17:12:44,086 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 210 flow. Second operand 7 states and 103 transitions. [2024-06-04 17:12:44,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 338 flow [2024-06-04 17:12:44,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 306 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 17:12:44,089 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 223 flow [2024-06-04 17:12:44,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-06-04 17:12:44,090 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2024-06-04 17:12:44,090 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 223 flow [2024-06-04 17:12:44,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:44,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:44,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:12:44,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 17:12:44,091 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:12:44,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:44,091 INFO L85 PathProgramCache]: Analyzing trace with hash -289333280, now seen corresponding path program 1 times [2024-06-04 17:12:44,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:44,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111994187] [2024-06-04 17:12:44,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:44,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:54,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-04 17:12:54,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:54,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111994187] [2024-06-04 17:12:54,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111994187] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:54,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:54,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:12:54,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171042476] [2024-06-04 17:12:54,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:54,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:12:54,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:54,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:12:54,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:12:54,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-06-04 17:12:54,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 223 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:54,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:54,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-06-04 17:12:54,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:54,546 INFO L124 PetriNetUnfolderBase]: 188/371 cut-off events. [2024-06-04 17:12:54,546 INFO L125 PetriNetUnfolderBase]: For 2128/2128 co-relation queries the response was YES. [2024-06-04 17:12:54,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1423 conditions, 371 events. 188/371 cut-off events. For 2128/2128 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1460 event pairs, 49 based on Foata normal form. 1/372 useless extension candidates. Maximal degree in co-relation 1397. Up to 323 conditions per place. [2024-06-04 17:12:54,549 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 36 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2024-06-04 17:12:54,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 341 flow [2024-06-04 17:12:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:12:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:12:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-06-04 17:12:54,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41596638655462187 [2024-06-04 17:12:54,551 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 223 flow. Second operand 7 states and 99 transitions. [2024-06-04 17:12:54,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 52 transitions, 341 flow [2024-06-04 17:12:54,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 312 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 17:12:54,554 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 233 flow [2024-06-04 17:12:54,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=233, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-06-04 17:12:54,555 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 24 predicate places. [2024-06-04 17:12:54,555 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 233 flow [2024-06-04 17:12:54,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:54,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:54,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:12:54,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 17:12:54,556 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:12:54,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:54,556 INFO L85 PathProgramCache]: Analyzing trace with hash 245194100, now seen corresponding path program 1 times [2024-06-04 17:12:54,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:54,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385798062] [2024-06-04 17:12:54,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:54,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:04,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-04 17:13:04,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:04,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385798062] [2024-06-04 17:13:04,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385798062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:04,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:04,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:13:04,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500377205] [2024-06-04 17:13:04,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:04,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:13:04,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:04,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:13:04,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:13:04,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:13:04,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 233 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:04,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:04,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:13:04,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:04,706 INFO L124 PetriNetUnfolderBase]: 220/411 cut-off events. [2024-06-04 17:13:04,706 INFO L125 PetriNetUnfolderBase]: For 2980/2980 co-relation queries the response was YES. [2024-06-04 17:13:04,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1669 conditions, 411 events. 220/411 cut-off events. For 2980/2980 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1556 event pairs, 55 based on Foata normal form. 1/412 useless extension candidates. Maximal degree in co-relation 1642. Up to 356 conditions per place. [2024-06-04 17:13:04,709 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 45 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2024-06-04 17:13:04,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 387 flow [2024-06-04 17:13:04,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:13:04,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:13:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-06-04 17:13:04,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41596638655462187 [2024-06-04 17:13:04,710 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 233 flow. Second operand 7 states and 99 transitions. [2024-06-04 17:13:04,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 387 flow [2024-06-04 17:13:04,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 364 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 17:13:04,713 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 251 flow [2024-06-04 17:13:04,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2024-06-04 17:13:04,713 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2024-06-04 17:13:04,714 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 251 flow [2024-06-04 17:13:04,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:04,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:04,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:04,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 17:13:04,714 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:13:04,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:04,715 INFO L85 PathProgramCache]: Analyzing trace with hash -387978374, now seen corresponding path program 2 times [2024-06-04 17:13:04,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:04,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298968060] [2024-06-04 17:13:04,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:04,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:13:14,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:14,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298968060] [2024-06-04 17:13:14,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298968060] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:14,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:14,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:13:14,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617660511] [2024-06-04 17:13:14,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:14,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:13:14,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:14,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:13:14,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:13:14,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:13:14,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 251 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:14,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:14,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:13:14,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:14,945 INFO L124 PetriNetUnfolderBase]: 223/416 cut-off events. [2024-06-04 17:13:14,945 INFO L125 PetriNetUnfolderBase]: For 3488/3488 co-relation queries the response was YES. [2024-06-04 17:13:14,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 416 events. 223/416 cut-off events. For 3488/3488 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1571 event pairs, 55 based on Foata normal form. 1/417 useless extension candidates. Maximal degree in co-relation 1740. Up to 355 conditions per place. [2024-06-04 17:13:14,948 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 41 selfloop transitions, 13 changer transitions 0/59 dead transitions. [2024-06-04 17:13:14,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 59 transitions, 399 flow [2024-06-04 17:13:14,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:13:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:13:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-04 17:13:14,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2024-06-04 17:13:14,950 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 251 flow. Second operand 7 states and 98 transitions. [2024-06-04 17:13:14,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 59 transitions, 399 flow [2024-06-04 17:13:14,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 374 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 17:13:14,953 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 277 flow [2024-06-04 17:13:14,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=277, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2024-06-04 17:13:14,954 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 28 predicate places. [2024-06-04 17:13:14,954 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 277 flow [2024-06-04 17:13:14,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:14,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:14,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:14,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 17:13:14,955 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:13:14,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:14,955 INFO L85 PathProgramCache]: Analyzing trace with hash 245373838, now seen corresponding path program 1 times [2024-06-04 17:13:14,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:14,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480651471] [2024-06-04 17:13:14,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:14,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:24,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-04 17:13:24,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:24,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480651471] [2024-06-04 17:13:24,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480651471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:24,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:24,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:13:24,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606768772] [2024-06-04 17:13:24,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:24,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:13:24,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:24,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:13:24,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:13:24,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:13:24,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 277 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:24,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:24,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:13:24,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:25,294 INFO L124 PetriNetUnfolderBase]: 226/421 cut-off events. [2024-06-04 17:13:25,295 INFO L125 PetriNetUnfolderBase]: For 4005/4005 co-relation queries the response was YES. [2024-06-04 17:13:25,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1844 conditions, 421 events. 226/421 cut-off events. For 4005/4005 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1612 event pairs, 56 based on Foata normal form. 1/422 useless extension candidates. Maximal degree in co-relation 1815. Up to 375 conditions per place. [2024-06-04 17:13:25,299 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 44 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2024-06-04 17:13:25,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 61 transitions, 421 flow [2024-06-04 17:13:25,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:13:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:13:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-04 17:13:25,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40336134453781514 [2024-06-04 17:13:25,300 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 277 flow. Second operand 7 states and 96 transitions. [2024-06-04 17:13:25,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 61 transitions, 421 flow [2024-06-04 17:13:25,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 386 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 17:13:25,304 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 283 flow [2024-06-04 17:13:25,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=283, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2024-06-04 17:13:25,305 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 30 predicate places. [2024-06-04 17:13:25,305 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 283 flow [2024-06-04 17:13:25,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:25,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:25,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:25,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 17:13:25,306 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:13:25,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:25,307 INFO L85 PathProgramCache]: Analyzing trace with hash -379704164, now seen corresponding path program 3 times [2024-06-04 17:13:25,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:25,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604675205] [2024-06-04 17:13:25,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:25,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:35,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:13:35,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:35,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604675205] [2024-06-04 17:13:35,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604675205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:35,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:35,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:13:35,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011186931] [2024-06-04 17:13:35,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:35,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:13:35,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:35,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:13:35,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:13:35,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:13:35,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 283 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:35,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:35,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:13:35,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:35,568 INFO L124 PetriNetUnfolderBase]: 226/420 cut-off events. [2024-06-04 17:13:35,568 INFO L125 PetriNetUnfolderBase]: For 4607/4607 co-relation queries the response was YES. [2024-06-04 17:13:35,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 420 events. 226/420 cut-off events. For 4607/4607 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1588 event pairs, 54 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 1885. Up to 348 conditions per place. [2024-06-04 17:13:35,572 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 40 selfloop transitions, 18 changer transitions 0/64 dead transitions. [2024-06-04 17:13:35,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 445 flow [2024-06-04 17:13:35,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:13:35,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:13:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-04 17:13:35,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40441176470588236 [2024-06-04 17:13:35,574 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 283 flow. Second operand 8 states and 110 transitions. [2024-06-04 17:13:35,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 445 flow [2024-06-04 17:13:35,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 420 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 17:13:35,579 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 323 flow [2024-06-04 17:13:35,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=323, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2024-06-04 17:13:35,580 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 33 predicate places. [2024-06-04 17:13:35,580 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 323 flow [2024-06-04 17:13:35,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:35,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:35,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:35,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 17:13:35,581 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:13:35,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash -379703916, now seen corresponding path program 2 times [2024-06-04 17:13:35,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:35,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641098261] [2024-06-04 17:13:35,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:35,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:13:45,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:45,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641098261] [2024-06-04 17:13:45,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641098261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:45,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:45,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:13:45,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351300659] [2024-06-04 17:13:45,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:45,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:13:45,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:45,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:13:45,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:13:45,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:13:45,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 323 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:45,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:45,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:13:45,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:46,118 INFO L124 PetriNetUnfolderBase]: 227/423 cut-off events. [2024-06-04 17:13:46,118 INFO L125 PetriNetUnfolderBase]: For 5107/5107 co-relation queries the response was YES. [2024-06-04 17:13:46,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1983 conditions, 423 events. 227/423 cut-off events. For 5107/5107 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1634 event pairs, 56 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 1952. Up to 362 conditions per place. [2024-06-04 17:13:46,121 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 43 selfloop transitions, 18 changer transitions 0/69 dead transitions. [2024-06-04 17:13:46,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 535 flow [2024-06-04 17:13:46,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:13:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:13:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-06-04 17:13:46,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40808823529411764 [2024-06-04 17:13:46,123 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 323 flow. Second operand 8 states and 111 transitions. [2024-06-04 17:13:46,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 535 flow [2024-06-04 17:13:46,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 69 transitions, 486 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 17:13:46,127 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 351 flow [2024-06-04 17:13:46,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=351, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2024-06-04 17:13:46,128 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 35 predicate places. [2024-06-04 17:13:46,128 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 351 flow [2024-06-04 17:13:46,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:46,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:46,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:46,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 17:13:46,129 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:13:46,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:46,129 INFO L85 PathProgramCache]: Analyzing trace with hash 481845868, now seen corresponding path program 3 times [2024-06-04 17:13:46,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:46,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457806151] [2024-06-04 17:13:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:46,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:13:55,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:55,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457806151] [2024-06-04 17:13:55,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457806151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:55,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:55,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:13:55,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892903857] [2024-06-04 17:13:55,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:55,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:13:55,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:55,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:13:55,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:13:56,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:13:56,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 351 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:56,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:56,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:13:56,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:56,397 INFO L124 PetriNetUnfolderBase]: 225/420 cut-off events. [2024-06-04 17:13:56,397 INFO L125 PetriNetUnfolderBase]: For 5695/5695 co-relation queries the response was YES. [2024-06-04 17:13:56,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2019 conditions, 420 events. 225/420 cut-off events. For 5695/5695 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1624 event pairs, 56 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 1987. Up to 360 conditions per place. [2024-06-04 17:13:56,400 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 41 selfloop transitions, 19 changer transitions 0/68 dead transitions. [2024-06-04 17:13:56,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 68 transitions, 497 flow [2024-06-04 17:13:56,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:13:56,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:13:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-04 17:13:56,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4007352941176471 [2024-06-04 17:13:56,401 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 351 flow. Second operand 8 states and 109 transitions. [2024-06-04 17:13:56,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 68 transitions, 497 flow [2024-06-04 17:13:56,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 68 transitions, 459 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-04 17:13:56,405 INFO L231 Difference]: Finished difference. Result has 72 places, 57 transitions, 356 flow [2024-06-04 17:13:56,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=356, PETRI_PLACES=72, PETRI_TRANSITIONS=57} [2024-06-04 17:13:56,406 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 39 predicate places. [2024-06-04 17:13:56,406 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 356 flow [2024-06-04 17:13:56,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:56,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:56,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:56,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 17:13:56,407 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:13:56,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:56,407 INFO L85 PathProgramCache]: Analyzing trace with hash 871269377, now seen corresponding path program 1 times [2024-06-04 17:13:56,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:56,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395306241] [2024-06-04 17:13:56,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:56,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:14:04,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:04,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395306241] [2024-06-04 17:14:04,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395306241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:04,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:04,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:14:04,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048898] [2024-06-04 17:14:04,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:04,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:14:04,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:04,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:14:04,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:14:04,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:14:04,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 57 transitions, 356 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:04,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:04,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:14:04,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:05,064 INFO L124 PetriNetUnfolderBase]: 245/457 cut-off events. [2024-06-04 17:14:05,064 INFO L125 PetriNetUnfolderBase]: For 6843/6843 co-relation queries the response was YES. [2024-06-04 17:14:05,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2251 conditions, 457 events. 245/457 cut-off events. For 6843/6843 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1795 event pairs, 106 based on Foata normal form. 2/458 useless extension candidates. Maximal degree in co-relation 2217. Up to 395 conditions per place. [2024-06-04 17:14:05,068 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 56 selfloop transitions, 14 changer transitions 0/78 dead transitions. [2024-06-04 17:14:05,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 78 transitions, 595 flow [2024-06-04 17:14:05,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:14:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:14:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-04 17:14:05,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4007352941176471 [2024-06-04 17:14:05,070 INFO L175 Difference]: Start difference. First operand has 72 places, 57 transitions, 356 flow. Second operand 8 states and 109 transitions. [2024-06-04 17:14:05,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 78 transitions, 595 flow [2024-06-04 17:14:05,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 78 transitions, 546 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 17:14:05,076 INFO L231 Difference]: Finished difference. Result has 77 places, 67 transitions, 437 flow [2024-06-04 17:14:05,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=437, PETRI_PLACES=77, PETRI_TRANSITIONS=67} [2024-06-04 17:14:05,077 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 44 predicate places. [2024-06-04 17:14:05,077 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 67 transitions, 437 flow [2024-06-04 17:14:05,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:05,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:05,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:05,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 17:14:05,078 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:14:05,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:05,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1081926461, now seen corresponding path program 2 times [2024-06-04 17:14:05,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:05,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683217] [2024-06-04 17:14:05,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:05,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:14,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-04 17:14:14,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:14,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683217] [2024-06-04 17:14:14,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:14,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:14,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:14:14,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475257428] [2024-06-04 17:14:14,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:14,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:14:14,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:14,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:14:14,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:14:14,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:14:14,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 67 transitions, 437 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:14,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:14,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:14:14,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:15,072 INFO L124 PetriNetUnfolderBase]: 263/491 cut-off events. [2024-06-04 17:14:15,072 INFO L125 PetriNetUnfolderBase]: For 7791/7794 co-relation queries the response was YES. [2024-06-04 17:14:15,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 491 events. 263/491 cut-off events. For 7791/7794 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1983 event pairs, 54 based on Foata normal form. 4/495 useless extension candidates. Maximal degree in co-relation 2467. Up to 393 conditions per place. [2024-06-04 17:14:15,076 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 60 selfloop transitions, 24 changer transitions 0/92 dead transitions. [2024-06-04 17:14:15,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 721 flow [2024-06-04 17:14:15,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:14:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:14:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2024-06-04 17:14:15,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2024-06-04 17:14:15,078 INFO L175 Difference]: Start difference. First operand has 77 places, 67 transitions, 437 flow. Second operand 9 states and 126 transitions. [2024-06-04 17:14:15,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 92 transitions, 721 flow [2024-06-04 17:14:15,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 699 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-04 17:14:15,086 INFO L231 Difference]: Finished difference. Result has 87 places, 76 transitions, 560 flow [2024-06-04 17:14:15,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=560, PETRI_PLACES=87, PETRI_TRANSITIONS=76} [2024-06-04 17:14:15,086 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 54 predicate places. [2024-06-04 17:14:15,087 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 76 transitions, 560 flow [2024-06-04 17:14:15,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:15,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:15,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:15,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 17:14:15,087 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:14:15,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:15,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1676694463, now seen corresponding path program 3 times [2024-06-04 17:14:15,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:15,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340629198] [2024-06-04 17:14:15,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:15,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:14:24,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:24,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340629198] [2024-06-04 17:14:24,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340629198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:24,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:24,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:14:24,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372928743] [2024-06-04 17:14:24,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:24,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:14:24,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:24,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:14:24,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:14:24,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:14:24,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 76 transitions, 560 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:24,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:24,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:14:24,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:24,907 INFO L124 PetriNetUnfolderBase]: 269/503 cut-off events. [2024-06-04 17:14:24,908 INFO L125 PetriNetUnfolderBase]: For 8855/8855 co-relation queries the response was YES. [2024-06-04 17:14:24,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2704 conditions, 503 events. 269/503 cut-off events. For 8855/8855 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2043 event pairs, 56 based on Foata normal form. 2/505 useless extension candidates. Maximal degree in co-relation 2660. Up to 403 conditions per place. [2024-06-04 17:14:24,913 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 63 selfloop transitions, 25 changer transitions 0/96 dead transitions. [2024-06-04 17:14:24,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 96 transitions, 841 flow [2024-06-04 17:14:24,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:14:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:14:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2024-06-04 17:14:24,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2024-06-04 17:14:24,915 INFO L175 Difference]: Start difference. First operand has 87 places, 76 transitions, 560 flow. Second operand 9 states and 126 transitions. [2024-06-04 17:14:24,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 96 transitions, 841 flow [2024-06-04 17:14:24,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 96 transitions, 779 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-04 17:14:24,924 INFO L231 Difference]: Finished difference. Result has 95 places, 82 transitions, 649 flow [2024-06-04 17:14:24,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=649, PETRI_PLACES=95, PETRI_TRANSITIONS=82} [2024-06-04 17:14:24,925 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 62 predicate places. [2024-06-04 17:14:24,925 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 82 transitions, 649 flow [2024-06-04 17:14:24,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:24,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:24,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:24,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 17:14:24,926 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:14:24,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:24,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1498236729, now seen corresponding path program 4 times [2024-06-04 17:14:24,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:24,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120139189] [2024-06-04 17:14:24,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:24,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:14:34,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:34,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120139189] [2024-06-04 17:14:34,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120139189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:34,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:34,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:14:34,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610064639] [2024-06-04 17:14:34,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:34,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:14:34,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:34,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:14:34,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:14:34,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:14:34,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 82 transitions, 649 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:34,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:34,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:14:34,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:34,729 INFO L124 PetriNetUnfolderBase]: 274/512 cut-off events. [2024-06-04 17:14:34,729 INFO L125 PetriNetUnfolderBase]: For 10095/10096 co-relation queries the response was YES. [2024-06-04 17:14:34,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2852 conditions, 512 events. 274/512 cut-off events. For 10095/10096 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2126 event pairs, 88 based on Foata normal form. 2/513 useless extension candidates. Maximal degree in co-relation 2804. Up to 412 conditions per place. [2024-06-04 17:14:34,734 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 64 selfloop transitions, 29 changer transitions 0/101 dead transitions. [2024-06-04 17:14:34,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 101 transitions, 919 flow [2024-06-04 17:14:34,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:14:34,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:14:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2024-06-04 17:14:34,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2024-06-04 17:14:34,735 INFO L175 Difference]: Start difference. First operand has 95 places, 82 transitions, 649 flow. Second operand 9 states and 126 transitions. [2024-06-04 17:14:34,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 101 transitions, 919 flow [2024-06-04 17:14:34,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 101 transitions, 858 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-04 17:14:34,747 INFO L231 Difference]: Finished difference. Result has 102 places, 85 transitions, 709 flow [2024-06-04 17:14:34,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=709, PETRI_PLACES=102, PETRI_TRANSITIONS=85} [2024-06-04 17:14:34,748 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 69 predicate places. [2024-06-04 17:14:34,748 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 85 transitions, 709 flow [2024-06-04 17:14:34,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:34,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:34,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:34,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 17:14:34,749 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:14:34,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:34,749 INFO L85 PathProgramCache]: Analyzing trace with hash -233390598, now seen corresponding path program 1 times [2024-06-04 17:14:34,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:34,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082870958] [2024-06-04 17:14:34,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:34,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:14:44,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:44,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082870958] [2024-06-04 17:14:44,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082870958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:44,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:44,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:14:44,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890054455] [2024-06-04 17:14:44,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:44,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:14:44,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:44,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:14:44,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:14:44,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:14:44,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 85 transitions, 709 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:44,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:44,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:14:44,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:45,250 INFO L124 PetriNetUnfolderBase]: 296/539 cut-off events. [2024-06-04 17:14:45,250 INFO L125 PetriNetUnfolderBase]: For 10650/10650 co-relation queries the response was YES. [2024-06-04 17:14:45,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3040 conditions, 539 events. 296/539 cut-off events. For 10650/10650 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2172 event pairs, 95 based on Foata normal form. 1/540 useless extension candidates. Maximal degree in co-relation 2990. Up to 482 conditions per place. [2024-06-04 17:14:45,254 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 77 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2024-06-04 17:14:45,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 102 transitions, 967 flow [2024-06-04 17:14:45,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:14:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:14:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 17:14:45,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-04 17:14:45,255 INFO L175 Difference]: Start difference. First operand has 102 places, 85 transitions, 709 flow. Second operand 9 states and 114 transitions. [2024-06-04 17:14:45,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 102 transitions, 967 flow [2024-06-04 17:14:45,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 102 transitions, 888 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 17:14:45,266 INFO L231 Difference]: Finished difference. Result has 106 places, 89 transitions, 716 flow [2024-06-04 17:14:45,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=716, PETRI_PLACES=106, PETRI_TRANSITIONS=89} [2024-06-04 17:14:45,267 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 73 predicate places. [2024-06-04 17:14:45,267 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 89 transitions, 716 flow [2024-06-04 17:14:45,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:45,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:45,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:45,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 17:14:45,268 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:14:45,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1529858171, now seen corresponding path program 5 times [2024-06-04 17:14:45,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:45,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680429033] [2024-06-04 17:14:45,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:45,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:55,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:14:55,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:55,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680429033] [2024-06-04 17:14:55,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680429033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:55,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:55,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:14:55,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351771570] [2024-06-04 17:14:55,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:55,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:14:55,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:55,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:14:55,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:14:55,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:14:55,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 89 transitions, 716 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:55,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:55,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:14:55,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:55,614 INFO L124 PetriNetUnfolderBase]: 292/542 cut-off events. [2024-06-04 17:14:55,614 INFO L125 PetriNetUnfolderBase]: For 12395/12397 co-relation queries the response was YES. [2024-06-04 17:14:55,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3128 conditions, 542 events. 292/542 cut-off events. For 12395/12397 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2262 event pairs, 86 based on Foata normal form. 2/541 useless extension candidates. Maximal degree in co-relation 3076. Up to 423 conditions per place. [2024-06-04 17:14:55,618 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 65 selfloop transitions, 32 changer transitions 0/106 dead transitions. [2024-06-04 17:14:55,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 106 transitions, 986 flow [2024-06-04 17:14:55,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:14:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:14:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2024-06-04 17:14:55,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4150326797385621 [2024-06-04 17:14:55,620 INFO L175 Difference]: Start difference. First operand has 106 places, 89 transitions, 716 flow. Second operand 9 states and 127 transitions. [2024-06-04 17:14:55,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 106 transitions, 986 flow [2024-06-04 17:14:55,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 106 transitions, 908 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 17:14:55,630 INFO L231 Difference]: Finished difference. Result has 107 places, 91 transitions, 745 flow [2024-06-04 17:14:55,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=745, PETRI_PLACES=107, PETRI_TRANSITIONS=91} [2024-06-04 17:14:55,631 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 74 predicate places. [2024-06-04 17:14:55,631 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 745 flow [2024-06-04 17:14:55,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:55,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:55,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:55,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 17:14:55,632 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:14:55,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:55,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1676688883, now seen corresponding path program 6 times [2024-06-04 17:14:55,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:55,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103631563] [2024-06-04 17:14:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:55,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:05,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-04 17:15:05,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:05,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103631563] [2024-06-04 17:15:05,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103631563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:05,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:05,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:15:05,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941050150] [2024-06-04 17:15:05,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:05,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:15:05,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:05,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:15:05,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:15:05,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:15:05,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 91 transitions, 745 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:05,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:05,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:15:05,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:05,732 INFO L124 PetriNetUnfolderBase]: 298/555 cut-off events. [2024-06-04 17:15:05,732 INFO L125 PetriNetUnfolderBase]: For 13330/13330 co-relation queries the response was YES. [2024-06-04 17:15:05,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3239 conditions, 555 events. 298/555 cut-off events. For 13330/13330 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2309 event pairs, 56 based on Foata normal form. 2/557 useless extension candidates. Maximal degree in co-relation 3188. Up to 439 conditions per place. [2024-06-04 17:15:05,738 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 71 selfloop transitions, 29 changer transitions 0/109 dead transitions. [2024-06-04 17:15:05,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 109 transitions, 1035 flow [2024-06-04 17:15:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:15:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:15:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2024-06-04 17:15:05,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41830065359477125 [2024-06-04 17:15:05,740 INFO L175 Difference]: Start difference. First operand has 107 places, 91 transitions, 745 flow. Second operand 9 states and 128 transitions. [2024-06-04 17:15:05,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 109 transitions, 1035 flow [2024-06-04 17:15:05,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 944 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 17:15:05,754 INFO L231 Difference]: Finished difference. Result has 110 places, 95 transitions, 781 flow [2024-06-04 17:15:05,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=781, PETRI_PLACES=110, PETRI_TRANSITIONS=95} [2024-06-04 17:15:05,754 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 77 predicate places. [2024-06-04 17:15:05,754 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 95 transitions, 781 flow [2024-06-04 17:15:05,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:05,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:05,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:05,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 17:15:05,755 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:15:05,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:05,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2086509280, now seen corresponding path program 2 times [2024-06-04 17:15:05,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:05,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656992474] [2024-06-04 17:15:05,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:05,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:15:14,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:14,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656992474] [2024-06-04 17:15:14,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656992474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:14,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:14,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:15:14,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940133525] [2024-06-04 17:15:14,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:14,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:15:14,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:14,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:15:14,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:15:15,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:15:15,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 95 transitions, 781 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:15,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:15,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:15:15,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:15,507 INFO L124 PetriNetUnfolderBase]: 314/573 cut-off events. [2024-06-04 17:15:15,507 INFO L125 PetriNetUnfolderBase]: For 13980/13980 co-relation queries the response was YES. [2024-06-04 17:15:15,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3371 conditions, 573 events. 314/573 cut-off events. For 13980/13980 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2372 event pairs, 89 based on Foata normal form. 1/574 useless extension candidates. Maximal degree in co-relation 3318. Up to 512 conditions per place. [2024-06-04 17:15:15,512 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 85 selfloop transitions, 21 changer transitions 0/109 dead transitions. [2024-06-04 17:15:15,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 1047 flow [2024-06-04 17:15:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:15:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:15:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 17:15:15,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-04 17:15:15,514 INFO L175 Difference]: Start difference. First operand has 110 places, 95 transitions, 781 flow. Second operand 9 states and 114 transitions. [2024-06-04 17:15:15,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 1047 flow [2024-06-04 17:15:15,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 109 transitions, 960 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-04 17:15:15,525 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 767 flow [2024-06-04 17:15:15,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=767, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2024-06-04 17:15:15,525 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 80 predicate places. [2024-06-04 17:15:15,526 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 767 flow [2024-06-04 17:15:15,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:15,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:15,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:15,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 17:15:15,526 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:15:15,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:15,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1676479416, now seen corresponding path program 3 times [2024-06-04 17:15:15,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:15,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166151077] [2024-06-04 17:15:15,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:15,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:15:24,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:24,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166151077] [2024-06-04 17:15:24,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166151077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:24,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:24,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:15:24,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182914969] [2024-06-04 17:15:24,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:24,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:15:24,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:24,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:15:24,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:15:24,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:15:24,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 97 transitions, 767 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:24,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:24,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:15:24,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:25,372 INFO L124 PetriNetUnfolderBase]: 331/601 cut-off events. [2024-06-04 17:15:25,373 INFO L125 PetriNetUnfolderBase]: For 15084/15084 co-relation queries the response was YES. [2024-06-04 17:15:25,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3535 conditions, 601 events. 331/601 cut-off events. For 15084/15084 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2508 event pairs, 91 based on Foata normal form. 1/602 useless extension candidates. Maximal degree in co-relation 3481. Up to 518 conditions per place. [2024-06-04 17:15:25,378 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 83 selfloop transitions, 33 changer transitions 0/119 dead transitions. [2024-06-04 17:15:25,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 1162 flow [2024-06-04 17:15:25,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:15:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:15:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-04 17:15:25,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790849673202614 [2024-06-04 17:15:25,379 INFO L175 Difference]: Start difference. First operand has 113 places, 97 transitions, 767 flow. Second operand 9 states and 116 transitions. [2024-06-04 17:15:25,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 1162 flow [2024-06-04 17:15:25,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 119 transitions, 1101 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-04 17:15:25,391 INFO L231 Difference]: Finished difference. Result has 117 places, 106 transitions, 889 flow [2024-06-04 17:15:25,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=889, PETRI_PLACES=117, PETRI_TRANSITIONS=106} [2024-06-04 17:15:25,392 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 84 predicate places. [2024-06-04 17:15:25,392 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 106 transitions, 889 flow [2024-06-04 17:15:25,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:25,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:25,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:25,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 17:15:25,393 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:15:25,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1676479137, now seen corresponding path program 1 times [2024-06-04 17:15:25,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:25,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943459652] [2024-06-04 17:15:25,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:25,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:33,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-04 17:15:33,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:33,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943459652] [2024-06-04 17:15:33,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943459652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:33,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:33,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:15:33,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253378593] [2024-06-04 17:15:33,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:33,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:15:33,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:33,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:15:33,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:15:33,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:15:33,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 106 transitions, 889 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:33,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:33,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:15:33,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:33,981 INFO L124 PetriNetUnfolderBase]: 313/581 cut-off events. [2024-06-04 17:15:33,981 INFO L125 PetriNetUnfolderBase]: For 16386/16388 co-relation queries the response was YES. [2024-06-04 17:15:33,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3502 conditions, 581 events. 313/581 cut-off events. For 16386/16388 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2516 event pairs, 98 based on Foata normal form. 3/581 useless extension candidates. Maximal degree in co-relation 3446. Up to 498 conditions per place. [2024-06-04 17:15:33,986 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 85 selfloop transitions, 17 changer transitions 0/120 dead transitions. [2024-06-04 17:15:33,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 120 transitions, 1142 flow [2024-06-04 17:15:33,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:15:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:15:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-04 17:15:33,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-04 17:15:33,987 INFO L175 Difference]: Start difference. First operand has 117 places, 106 transitions, 889 flow. Second operand 9 states and 119 transitions. [2024-06-04 17:15:33,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 120 transitions, 1142 flow [2024-06-04 17:15:34,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 120 transitions, 1099 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-04 17:15:34,002 INFO L231 Difference]: Finished difference. Result has 123 places, 109 transitions, 915 flow [2024-06-04 17:15:34,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=915, PETRI_PLACES=123, PETRI_TRANSITIONS=109} [2024-06-04 17:15:34,002 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 90 predicate places. [2024-06-04 17:15:34,003 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 109 transitions, 915 flow [2024-06-04 17:15:34,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:34,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:34,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:34,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 17:15:34,003 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:15:34,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:34,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1676487073, now seen corresponding path program 7 times [2024-06-04 17:15:34,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:34,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442924382] [2024-06-04 17:15:34,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:34,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:15:43,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:43,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442924382] [2024-06-04 17:15:43,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442924382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:43,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:43,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:15:43,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300010487] [2024-06-04 17:15:43,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:43,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:15:43,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:43,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:15:43,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:15:44,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:15:44,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 109 transitions, 915 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:44,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:44,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:15:44,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:44,409 INFO L124 PetriNetUnfolderBase]: 326/604 cut-off events. [2024-06-04 17:15:44,409 INFO L125 PetriNetUnfolderBase]: For 18026/18026 co-relation queries the response was YES. [2024-06-04 17:15:44,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3785 conditions, 604 events. 326/604 cut-off events. For 18026/18026 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2590 event pairs, 59 based on Foata normal form. 2/606 useless extension candidates. Maximal degree in co-relation 3726. Up to 444 conditions per place. [2024-06-04 17:15:44,413 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 71 selfloop transitions, 40 changer transitions 0/124 dead transitions. [2024-06-04 17:15:44,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 124 transitions, 1215 flow [2024-06-04 17:15:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:15:44,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:15:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2024-06-04 17:15:44,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4150326797385621 [2024-06-04 17:15:44,414 INFO L175 Difference]: Start difference. First operand has 123 places, 109 transitions, 915 flow. Second operand 9 states and 127 transitions. [2024-06-04 17:15:44,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 124 transitions, 1215 flow [2024-06-04 17:15:44,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 124 transitions, 1162 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 17:15:44,427 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 993 flow [2024-06-04 17:15:44,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=993, PETRI_PLACES=126, PETRI_TRANSITIONS=111} [2024-06-04 17:15:44,428 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 93 predicate places. [2024-06-04 17:15:44,428 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 993 flow [2024-06-04 17:15:44,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:44,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:44,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:44,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 17:15:44,429 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:15:44,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:44,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1676486856, now seen corresponding path program 4 times [2024-06-04 17:15:44,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:44,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076634452] [2024-06-04 17:15:44,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:44,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:15:53,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:53,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076634452] [2024-06-04 17:15:53,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076634452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:53,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:53,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:15:53,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537839677] [2024-06-04 17:15:53,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:53,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:15:53,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:53,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:15:53,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:15:53,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:15:53,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 111 transitions, 993 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:53,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:53,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:15:53,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:54,065 INFO L124 PetriNetUnfolderBase]: 338/616 cut-off events. [2024-06-04 17:15:54,066 INFO L125 PetriNetUnfolderBase]: For 18530/18530 co-relation queries the response was YES. [2024-06-04 17:15:54,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3930 conditions, 616 events. 338/616 cut-off events. For 18530/18530 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2604 event pairs, 90 based on Foata normal form. 1/617 useless extension candidates. Maximal degree in co-relation 3871. Up to 531 conditions per place. [2024-06-04 17:15:54,070 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 88 selfloop transitions, 31 changer transitions 0/122 dead transitions. [2024-06-04 17:15:54,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 122 transitions, 1259 flow [2024-06-04 17:15:54,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:15:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:15:54,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-04 17:15:54,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790849673202614 [2024-06-04 17:15:54,071 INFO L175 Difference]: Start difference. First operand has 126 places, 111 transitions, 993 flow. Second operand 9 states and 116 transitions. [2024-06-04 17:15:54,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 122 transitions, 1259 flow [2024-06-04 17:15:54,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 122 transitions, 1127 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-04 17:15:54,086 INFO L231 Difference]: Finished difference. Result has 128 places, 111 transitions, 928 flow [2024-06-04 17:15:54,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=928, PETRI_PLACES=128, PETRI_TRANSITIONS=111} [2024-06-04 17:15:54,087 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 95 predicate places. [2024-06-04 17:15:54,087 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 111 transitions, 928 flow [2024-06-04 17:15:54,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:54,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:54,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:54,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 17:15:54,088 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:15:54,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:54,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1434923989, now seen corresponding path program 8 times [2024-06-04 17:15:54,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:54,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513521584] [2024-06-04 17:15:54,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:54,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:03,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-04 17:16:03,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:03,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513521584] [2024-06-04 17:16:03,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513521584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:03,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:03,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:16:03,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842893480] [2024-06-04 17:16:03,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:03,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:16:03,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:03,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:16:03,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:16:03,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:16:03,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 111 transitions, 928 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:03,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:03,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:16:03,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:04,438 INFO L124 PetriNetUnfolderBase]: 333/617 cut-off events. [2024-06-04 17:16:04,438 INFO L125 PetriNetUnfolderBase]: For 21073/21075 co-relation queries the response was YES. [2024-06-04 17:16:04,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3951 conditions, 617 events. 333/617 cut-off events. For 21073/21075 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2718 event pairs, 85 based on Foata normal form. 2/616 useless extension candidates. Maximal degree in co-relation 3891. Up to 454 conditions per place. [2024-06-04 17:16:04,442 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 71 selfloop transitions, 42 changer transitions 0/126 dead transitions. [2024-06-04 17:16:04,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 126 transitions, 1236 flow [2024-06-04 17:16:04,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:16:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:16:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2024-06-04 17:16:04,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41911764705882354 [2024-06-04 17:16:04,443 INFO L175 Difference]: Start difference. First operand has 128 places, 111 transitions, 928 flow. Second operand 8 states and 114 transitions. [2024-06-04 17:16:04,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 126 transitions, 1236 flow [2024-06-04 17:16:04,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 126 transitions, 1153 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-04 17:16:04,455 INFO L231 Difference]: Finished difference. Result has 128 places, 113 transitions, 990 flow [2024-06-04 17:16:04,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=990, PETRI_PLACES=128, PETRI_TRANSITIONS=113} [2024-06-04 17:16:04,456 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 95 predicate places. [2024-06-04 17:16:04,457 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 113 transitions, 990 flow [2024-06-04 17:16:04,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:04,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:04,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:04,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 17:16:04,458 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:16:04,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:04,458 INFO L85 PathProgramCache]: Analyzing trace with hash 257278963, now seen corresponding path program 1 times [2024-06-04 17:16:04,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:04,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170602798] [2024-06-04 17:16:04,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:04,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:16:14,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:14,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170602798] [2024-06-04 17:16:14,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170602798] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:14,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:14,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:16:14,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416701674] [2024-06-04 17:16:14,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:14,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:16:14,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:14,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:16:14,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:16:14,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:16:14,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 113 transitions, 990 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:14,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:14,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:16:14,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:15,350 INFO L124 PetriNetUnfolderBase]: 347/632 cut-off events. [2024-06-04 17:16:15,350 INFO L125 PetriNetUnfolderBase]: For 21101/21101 co-relation queries the response was YES. [2024-06-04 17:16:15,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4107 conditions, 632 events. 347/632 cut-off events. For 21101/21101 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2718 event pairs, 88 based on Foata normal form. 1/633 useless extension candidates. Maximal degree in co-relation 4046. Up to 564 conditions per place. [2024-06-04 17:16:15,357 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 102 selfloop transitions, 23 changer transitions 0/128 dead transitions. [2024-06-04 17:16:15,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 128 transitions, 1294 flow [2024-06-04 17:16:15,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:16:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:16:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 17:16:15,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36470588235294116 [2024-06-04 17:16:15,358 INFO L175 Difference]: Start difference. First operand has 128 places, 113 transitions, 990 flow. Second operand 10 states and 124 transitions. [2024-06-04 17:16:15,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 128 transitions, 1294 flow [2024-06-04 17:16:15,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 128 transitions, 1173 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-04 17:16:15,380 INFO L231 Difference]: Finished difference. Result has 132 places, 115 transitions, 944 flow [2024-06-04 17:16:15,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=944, PETRI_PLACES=132, PETRI_TRANSITIONS=115} [2024-06-04 17:16:15,381 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 99 predicate places. [2024-06-04 17:16:15,381 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 115 transitions, 944 flow [2024-06-04 17:16:15,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:15,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:15,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:15,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 17:16:15,381 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:16:15,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:15,382 INFO L85 PathProgramCache]: Analyzing trace with hash -988916800, now seen corresponding path program 5 times [2024-06-04 17:16:15,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:15,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294748330] [2024-06-04 17:16:15,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:15,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:16:25,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:25,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294748330] [2024-06-04 17:16:25,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294748330] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:25,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:25,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:16:25,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854372302] [2024-06-04 17:16:25,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:25,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:16:25,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:25,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:16:25,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:16:25,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:16:25,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 115 transitions, 944 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:25,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:25,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:16:25,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:25,730 INFO L124 PetriNetUnfolderBase]: 350/637 cut-off events. [2024-06-04 17:16:25,731 INFO L125 PetriNetUnfolderBase]: For 19145/19145 co-relation queries the response was YES. [2024-06-04 17:16:25,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3974 conditions, 637 events. 350/637 cut-off events. For 19145/19145 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2739 event pairs, 95 based on Foata normal form. 1/638 useless extension candidates. Maximal degree in co-relation 3912. Up to 560 conditions per place. [2024-06-04 17:16:25,735 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 96 selfloop transitions, 29 changer transitions 0/128 dead transitions. [2024-06-04 17:16:25,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 128 transitions, 1254 flow [2024-06-04 17:16:25,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:16:25,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:16:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-04 17:16:25,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3786764705882353 [2024-06-04 17:16:25,736 INFO L175 Difference]: Start difference. First operand has 132 places, 115 transitions, 944 flow. Second operand 8 states and 103 transitions. [2024-06-04 17:16:25,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 128 transitions, 1254 flow [2024-06-04 17:16:25,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 128 transitions, 1195 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 17:16:25,751 INFO L231 Difference]: Finished difference. Result has 132 places, 117 transitions, 990 flow [2024-06-04 17:16:25,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=990, PETRI_PLACES=132, PETRI_TRANSITIONS=117} [2024-06-04 17:16:25,751 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 99 predicate places. [2024-06-04 17:16:25,752 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 117 transitions, 990 flow [2024-06-04 17:16:25,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:25,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:25,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:25,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 17:16:25,752 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:16:25,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:25,753 INFO L85 PathProgramCache]: Analyzing trace with hash -983352827, now seen corresponding path program 9 times [2024-06-04 17:16:25,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:25,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640326178] [2024-06-04 17:16:25,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:25,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:36,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-04 17:16:36,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:36,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640326178] [2024-06-04 17:16:36,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640326178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:36,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:36,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:16:36,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318528674] [2024-06-04 17:16:36,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:36,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:16:36,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:36,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:16:36,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:16:36,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:16:36,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 117 transitions, 990 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:36,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:36,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:16:36,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:36,599 INFO L124 PetriNetUnfolderBase]: 341/634 cut-off events. [2024-06-04 17:16:36,599 INFO L125 PetriNetUnfolderBase]: For 21202/21202 co-relation queries the response was YES. [2024-06-04 17:16:36,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 634 events. 341/634 cut-off events. For 21202/21202 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2783 event pairs, 59 based on Foata normal form. 2/636 useless extension candidates. Maximal degree in co-relation 4005. Up to 442 conditions per place. [2024-06-04 17:16:36,606 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 68 selfloop transitions, 48 changer transitions 0/130 dead transitions. [2024-06-04 17:16:36,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 130 transitions, 1294 flow [2024-06-04 17:16:36,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:16:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:16:36,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-04 17:16:36,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41544117647058826 [2024-06-04 17:16:36,607 INFO L175 Difference]: Start difference. First operand has 132 places, 117 transitions, 990 flow. Second operand 8 states and 113 transitions. [2024-06-04 17:16:36,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 130 transitions, 1294 flow [2024-06-04 17:16:36,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 130 transitions, 1217 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-04 17:16:36,629 INFO L231 Difference]: Finished difference. Result has 134 places, 119 transitions, 1063 flow [2024-06-04 17:16:36,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1063, PETRI_PLACES=134, PETRI_TRANSITIONS=119} [2024-06-04 17:16:36,629 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 101 predicate places. [2024-06-04 17:16:36,630 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 119 transitions, 1063 flow [2024-06-04 17:16:36,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:36,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:36,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:36,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:16:36,630 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:16:36,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:36,631 INFO L85 PathProgramCache]: Analyzing trace with hash -983352610, now seen corresponding path program 6 times [2024-06-04 17:16:36,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:36,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773243430] [2024-06-04 17:16:36,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:36,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:16:46,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:46,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773243430] [2024-06-04 17:16:46,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773243430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:46,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:46,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:16:46,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749029178] [2024-06-04 17:16:46,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:46,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:16:46,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:46,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:16:46,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:16:46,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:16:46,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 119 transitions, 1063 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:46,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:46,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:16:46,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:47,198 INFO L124 PetriNetUnfolderBase]: 364/663 cut-off events. [2024-06-04 17:16:47,198 INFO L125 PetriNetUnfolderBase]: For 20229/20229 co-relation queries the response was YES. [2024-06-04 17:16:47,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4248 conditions, 663 events. 364/663 cut-off events. For 20229/20229 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2895 event pairs, 90 based on Foata normal form. 1/664 useless extension candidates. Maximal degree in co-relation 4184. Up to 552 conditions per place. [2024-06-04 17:16:47,203 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 89 selfloop transitions, 41 changer transitions 0/133 dead transitions. [2024-06-04 17:16:47,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 133 transitions, 1461 flow [2024-06-04 17:16:47,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:16:47,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:16:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-04 17:16:47,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3860294117647059 [2024-06-04 17:16:47,205 INFO L175 Difference]: Start difference. First operand has 134 places, 119 transitions, 1063 flow. Second operand 8 states and 105 transitions. [2024-06-04 17:16:47,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 133 transitions, 1461 flow [2024-06-04 17:16:47,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 133 transitions, 1315 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-04 17:16:47,231 INFO L231 Difference]: Finished difference. Result has 134 places, 123 transitions, 1069 flow [2024-06-04 17:16:47,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1069, PETRI_PLACES=134, PETRI_TRANSITIONS=123} [2024-06-04 17:16:47,232 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 101 predicate places. [2024-06-04 17:16:47,232 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 123 transitions, 1069 flow [2024-06-04 17:16:47,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:47,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:47,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:47,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:16:47,233 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:16:47,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:47,233 INFO L85 PathProgramCache]: Analyzing trace with hash -983344891, now seen corresponding path program 2 times [2024-06-04 17:16:47,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:47,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169291030] [2024-06-04 17:16:47,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:47,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:16:57,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:57,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169291030] [2024-06-04 17:16:57,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169291030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:57,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:57,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:16:57,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793456006] [2024-06-04 17:16:57,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:57,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:16:57,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:57,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:16:57,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:16:57,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:16:57,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 123 transitions, 1069 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:57,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:57,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:16:57,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:57,710 INFO L124 PetriNetUnfolderBase]: 347/643 cut-off events. [2024-06-04 17:16:57,710 INFO L125 PetriNetUnfolderBase]: For 19987/19990 co-relation queries the response was YES. [2024-06-04 17:16:57,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4007 conditions, 643 events. 347/643 cut-off events. For 19987/19990 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2862 event pairs, 98 based on Foata normal form. 4/645 useless extension candidates. Maximal degree in co-relation 3944. Up to 533 conditions per place. [2024-06-04 17:16:57,715 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 90 selfloop transitions, 22 changer transitions 0/134 dead transitions. [2024-06-04 17:16:57,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 134 transitions, 1335 flow [2024-06-04 17:16:57,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:16:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:16:57,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-04 17:16:57,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39338235294117646 [2024-06-04 17:16:57,717 INFO L175 Difference]: Start difference. First operand has 134 places, 123 transitions, 1069 flow. Second operand 8 states and 107 transitions. [2024-06-04 17:16:57,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 134 transitions, 1335 flow [2024-06-04 17:16:57,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 134 transitions, 1267 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-04 17:16:57,742 INFO L231 Difference]: Finished difference. Result has 137 places, 125 transitions, 1077 flow [2024-06-04 17:16:57,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1077, PETRI_PLACES=137, PETRI_TRANSITIONS=125} [2024-06-04 17:16:57,742 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 104 predicate places. [2024-06-04 17:16:57,742 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 125 transitions, 1077 flow [2024-06-04 17:16:57,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:57,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:57,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:57,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 17:16:57,743 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:16:57,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash -983345170, now seen corresponding path program 7 times [2024-06-04 17:16:57,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:57,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335164406] [2024-06-04 17:16:57,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:57,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:17:07,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:07,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335164406] [2024-06-04 17:17:07,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335164406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:07,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:07,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:17:07,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614352163] [2024-06-04 17:17:07,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:07,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:17:07,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:07,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:17:07,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:17:08,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:17:08,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 125 transitions, 1077 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:08,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:08,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:17:08,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:08,413 INFO L124 PetriNetUnfolderBase]: 365/664 cut-off events. [2024-06-04 17:17:08,413 INFO L125 PetriNetUnfolderBase]: For 18991/18991 co-relation queries the response was YES. [2024-06-04 17:17:08,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4145 conditions, 664 events. 365/664 cut-off events. For 18991/18991 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2909 event pairs, 90 based on Foata normal form. 1/665 useless extension candidates. Maximal degree in co-relation 4081. Up to 555 conditions per place. [2024-06-04 17:17:08,418 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 87 selfloop transitions, 44 changer transitions 0/134 dead transitions. [2024-06-04 17:17:08,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 134 transitions, 1361 flow [2024-06-04 17:17:08,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:17:08,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:17:08,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-04 17:17:08,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3786764705882353 [2024-06-04 17:17:08,420 INFO L175 Difference]: Start difference. First operand has 137 places, 125 transitions, 1077 flow. Second operand 8 states and 103 transitions. [2024-06-04 17:17:08,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 134 transitions, 1361 flow [2024-06-04 17:17:08,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 134 transitions, 1289 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-04 17:17:08,444 INFO L231 Difference]: Finished difference. Result has 139 places, 125 transitions, 1101 flow [2024-06-04 17:17:08,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1101, PETRI_PLACES=139, PETRI_TRANSITIONS=125} [2024-06-04 17:17:08,445 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 106 predicate places. [2024-06-04 17:17:08,445 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 125 transitions, 1101 flow [2024-06-04 17:17:08,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:08,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:08,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:08,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 17:17:08,446 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:17:08,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:08,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2043116254, now seen corresponding path program 8 times [2024-06-04 17:17:08,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:08,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575608118] [2024-06-04 17:17:08,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:08,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:17:18,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:18,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575608118] [2024-06-04 17:17:18,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575608118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:18,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:18,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:17:18,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934773015] [2024-06-04 17:17:18,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:18,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:17:18,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:18,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:17:18,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:17:19,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:17:19,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 125 transitions, 1101 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:19,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:19,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:17:19,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:19,370 INFO L124 PetriNetUnfolderBase]: 368/670 cut-off events. [2024-06-04 17:17:19,371 INFO L125 PetriNetUnfolderBase]: For 19159/19159 co-relation queries the response was YES. [2024-06-04 17:17:19,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4175 conditions, 670 events. 368/670 cut-off events. For 19159/19159 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2931 event pairs, 90 based on Foata normal form. 1/671 useless extension candidates. Maximal degree in co-relation 4110. Up to 533 conditions per place. [2024-06-04 17:17:19,376 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 88 selfloop transitions, 49 changer transitions 0/140 dead transitions. [2024-06-04 17:17:19,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 140 transitions, 1515 flow [2024-06-04 17:17:19,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:17:19,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:17:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-04 17:17:19,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-04 17:17:19,385 INFO L175 Difference]: Start difference. First operand has 139 places, 125 transitions, 1101 flow. Second operand 9 states and 117 transitions. [2024-06-04 17:17:19,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 140 transitions, 1515 flow [2024-06-04 17:17:19,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 140 transitions, 1412 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-04 17:17:19,408 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 1163 flow [2024-06-04 17:17:19,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1163, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2024-06-04 17:17:19,409 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 107 predicate places. [2024-06-04 17:17:19,409 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 1163 flow [2024-06-04 17:17:19,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:19,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:19,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:19,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 17:17:19,410 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:17:19,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:19,411 INFO L85 PathProgramCache]: Analyzing trace with hash -782263577, now seen corresponding path program 10 times [2024-06-04 17:17:19,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:19,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908522130] [2024-06-04 17:17:19,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:19,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:29,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-04 17:17:29,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:29,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908522130] [2024-06-04 17:17:29,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908522130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:29,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:29,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:17:29,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124868671] [2024-06-04 17:17:29,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:29,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:17:29,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:29,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:17:29,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:17:29,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:17:29,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 1163 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:29,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:29,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:17:29,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:30,400 INFO L124 PetriNetUnfolderBase]: 353/658 cut-off events. [2024-06-04 17:17:30,400 INFO L125 PetriNetUnfolderBase]: For 19645/19645 co-relation queries the response was YES. [2024-06-04 17:17:30,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4121 conditions, 658 events. 353/658 cut-off events. For 19645/19645 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2931 event pairs, 59 based on Foata normal form. 2/660 useless extension candidates. Maximal degree in co-relation 4056. Up to 442 conditions per place. [2024-06-04 17:17:30,405 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 73 selfloop transitions, 52 changer transitions 0/143 dead transitions. [2024-06-04 17:17:30,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 143 transitions, 1487 flow [2024-06-04 17:17:30,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:17:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:17:30,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-06-04 17:17:30,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4084967320261438 [2024-06-04 17:17:30,406 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 1163 flow. Second operand 9 states and 125 transitions. [2024-06-04 17:17:30,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 143 transitions, 1487 flow [2024-06-04 17:17:30,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 143 transitions, 1372 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-04 17:17:30,424 INFO L231 Difference]: Finished difference. Result has 143 places, 131 transitions, 1203 flow [2024-06-04 17:17:30,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1203, PETRI_PLACES=143, PETRI_TRANSITIONS=131} [2024-06-04 17:17:30,425 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 110 predicate places. [2024-06-04 17:17:30,425 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 131 transitions, 1203 flow [2024-06-04 17:17:30,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:30,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:30,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:30,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 17:17:30,425 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:17:30,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2043123694, now seen corresponding path program 9 times [2024-06-04 17:17:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:30,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919114473] [2024-06-04 17:17:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:30,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:17:40,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:40,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919114473] [2024-06-04 17:17:40,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919114473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:40,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:40,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:17:40,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785071333] [2024-06-04 17:17:40,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:40,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:17:40,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:40,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:17:40,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:17:40,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:17:40,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 131 transitions, 1203 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:40,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:40,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:17:40,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:41,186 INFO L124 PetriNetUnfolderBase]: 372/679 cut-off events. [2024-06-04 17:17:41,186 INFO L125 PetriNetUnfolderBase]: For 20407/20407 co-relation queries the response was YES. [2024-06-04 17:17:41,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4309 conditions, 679 events. 372/679 cut-off events. For 20407/20407 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3000 event pairs, 90 based on Foata normal form. 1/680 useless extension candidates. Maximal degree in co-relation 4243. Up to 539 conditions per place. [2024-06-04 17:17:41,190 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 91 selfloop transitions, 50 changer transitions 0/144 dead transitions. [2024-06-04 17:17:41,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 144 transitions, 1597 flow [2024-06-04 17:17:41,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:17:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:17:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 17:17:41,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38562091503267976 [2024-06-04 17:17:41,191 INFO L175 Difference]: Start difference. First operand has 143 places, 131 transitions, 1203 flow. Second operand 9 states and 118 transitions. [2024-06-04 17:17:41,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 144 transitions, 1597 flow [2024-06-04 17:17:41,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 144 transitions, 1458 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-04 17:17:41,210 INFO L231 Difference]: Finished difference. Result has 145 places, 133 transitions, 1195 flow [2024-06-04 17:17:41,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1195, PETRI_PLACES=145, PETRI_TRANSITIONS=133} [2024-06-04 17:17:41,210 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 112 predicate places. [2024-06-04 17:17:41,211 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 133 transitions, 1195 flow [2024-06-04 17:17:41,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:41,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:41,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:41,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 17:17:41,211 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:17:41,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2043123973, now seen corresponding path program 3 times [2024-06-04 17:17:41,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:41,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345287433] [2024-06-04 17:17:41,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:41,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:17:51,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:51,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345287433] [2024-06-04 17:17:51,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345287433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:51,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:51,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:17:51,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035940658] [2024-06-04 17:17:51,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:51,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:17:51,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:51,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:17:51,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:17:51,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:17:51,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 133 transitions, 1195 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:51,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:51,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:17:51,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:52,014 INFO L124 PetriNetUnfolderBase]: 355/659 cut-off events. [2024-06-04 17:17:52,015 INFO L125 PetriNetUnfolderBase]: For 21454/21456 co-relation queries the response was YES. [2024-06-04 17:17:52,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4124 conditions, 659 events. 355/659 cut-off events. For 21454/21456 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2979 event pairs, 98 based on Foata normal form. 3/659 useless extension candidates. Maximal degree in co-relation 4057. Up to 517 conditions per place. [2024-06-04 17:17:52,021 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 94 selfloop transitions, 31 changer transitions 0/150 dead transitions. [2024-06-04 17:17:52,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 150 transitions, 1583 flow [2024-06-04 17:17:52,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:17:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:17:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2024-06-04 17:17:52,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40522875816993464 [2024-06-04 17:17:52,023 INFO L175 Difference]: Start difference. First operand has 145 places, 133 transitions, 1195 flow. Second operand 9 states and 124 transitions. [2024-06-04 17:17:52,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 150 transitions, 1583 flow [2024-06-04 17:17:52,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 150 transitions, 1476 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 17:17:52,043 INFO L231 Difference]: Finished difference. Result has 149 places, 139 transitions, 1226 flow [2024-06-04 17:17:52,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1226, PETRI_PLACES=149, PETRI_TRANSITIONS=139} [2024-06-04 17:17:52,044 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 116 predicate places. [2024-06-04 17:17:52,044 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 139 transitions, 1226 flow [2024-06-04 17:17:52,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:52,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:52,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:52,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 17:17:52,045 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:17:52,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:52,045 INFO L85 PathProgramCache]: Analyzing trace with hash -781996450, now seen corresponding path program 10 times [2024-06-04 17:17:52,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:52,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45621608] [2024-06-04 17:17:52,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:52,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:18:02,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:02,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45621608] [2024-06-04 17:18:02,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45621608] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:02,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:02,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:18:02,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490686855] [2024-06-04 17:18:02,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:02,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:18:02,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:02,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:18:02,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:18:02,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:18:02,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 139 transitions, 1226 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:02,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:02,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:18:02,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:02,823 INFO L124 PetriNetUnfolderBase]: 373/680 cut-off events. [2024-06-04 17:18:02,823 INFO L125 PetriNetUnfolderBase]: For 21964/21964 co-relation queries the response was YES. [2024-06-04 17:18:02,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4297 conditions, 680 events. 373/680 cut-off events. For 21964/21964 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3003 event pairs, 90 based on Foata normal form. 1/681 useless extension candidates. Maximal degree in co-relation 4228. Up to 542 conditions per place. [2024-06-04 17:18:02,828 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 89 selfloop transitions, 57 changer transitions 0/149 dead transitions. [2024-06-04 17:18:02,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 149 transitions, 1542 flow [2024-06-04 17:18:02,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:18:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:18:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-04 17:18:02,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3758169934640523 [2024-06-04 17:18:02,829 INFO L175 Difference]: Start difference. First operand has 149 places, 139 transitions, 1226 flow. Second operand 9 states and 115 transitions. [2024-06-04 17:18:02,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 149 transitions, 1542 flow [2024-06-04 17:18:02,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 149 transitions, 1492 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-04 17:18:02,852 INFO L231 Difference]: Finished difference. Result has 154 places, 139 transitions, 1295 flow [2024-06-04 17:18:02,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1295, PETRI_PLACES=154, PETRI_TRANSITIONS=139} [2024-06-04 17:18:02,852 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 121 predicate places. [2024-06-04 17:18:02,853 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 139 transitions, 1295 flow [2024-06-04 17:18:02,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:02,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:02,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:02,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 17:18:02,853 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:18:02,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:02,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2052320743, now seen corresponding path program 4 times [2024-06-04 17:18:02,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:02,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687305778] [2024-06-04 17:18:02,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:02,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:18:13,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:13,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687305778] [2024-06-04 17:18:13,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687305778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:13,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:13,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:18:13,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074877518] [2024-06-04 17:18:13,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:13,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:18:13,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:13,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:18:13,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:18:13,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:18:13,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 139 transitions, 1295 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:13,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:13,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:18:13,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:13,575 INFO L124 PetriNetUnfolderBase]: 356/661 cut-off events. [2024-06-04 17:18:13,575 INFO L125 PetriNetUnfolderBase]: For 23609/23611 co-relation queries the response was YES. [2024-06-04 17:18:13,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4274 conditions, 661 events. 356/661 cut-off events. For 23609/23611 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2995 event pairs, 98 based on Foata normal form. 3/661 useless extension candidates. Maximal degree in co-relation 4203. Up to 519 conditions per place. [2024-06-04 17:18:13,580 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 92 selfloop transitions, 35 changer transitions 0/152 dead transitions. [2024-06-04 17:18:13,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 152 transitions, 1665 flow [2024-06-04 17:18:13,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:18:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:18:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-04 17:18:13,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4019607843137255 [2024-06-04 17:18:13,581 INFO L175 Difference]: Start difference. First operand has 154 places, 139 transitions, 1295 flow. Second operand 9 states and 123 transitions. [2024-06-04 17:18:13,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 152 transitions, 1665 flow [2024-06-04 17:18:13,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 152 transitions, 1535 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-04 17:18:13,605 INFO L231 Difference]: Finished difference. Result has 154 places, 141 transitions, 1264 flow [2024-06-04 17:18:13,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1264, PETRI_PLACES=154, PETRI_TRANSITIONS=141} [2024-06-04 17:18:13,606 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 121 predicate places. [2024-06-04 17:18:13,606 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 141 transitions, 1264 flow [2024-06-04 17:18:13,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:13,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:13,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:13,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 17:18:13,607 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:18:13,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:13,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1123604415, now seen corresponding path program 5 times [2024-06-04 17:18:13,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:13,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530265017] [2024-06-04 17:18:13,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:13,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:18:23,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:23,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530265017] [2024-06-04 17:18:23,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530265017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:23,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:23,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:18:23,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372811017] [2024-06-04 17:18:23,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:23,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:18:23,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:23,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:18:23,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:18:23,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:18:23,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 141 transitions, 1264 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:23,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:23,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:18:23,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:24,189 INFO L124 PetriNetUnfolderBase]: 354/658 cut-off events. [2024-06-04 17:18:24,189 INFO L125 PetriNetUnfolderBase]: For 24335/24337 co-relation queries the response was YES. [2024-06-04 17:18:24,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4217 conditions, 658 events. 354/658 cut-off events. For 24335/24337 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2981 event pairs, 98 based on Foata normal form. 3/658 useless extension candidates. Maximal degree in co-relation 4145. Up to 517 conditions per place. [2024-06-04 17:18:24,194 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 88 selfloop transitions, 38 changer transitions 0/151 dead transitions. [2024-06-04 17:18:24,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 151 transitions, 1540 flow [2024-06-04 17:18:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:18:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:18:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-04 17:18:24,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3954248366013072 [2024-06-04 17:18:24,195 INFO L175 Difference]: Start difference. First operand has 154 places, 141 transitions, 1264 flow. Second operand 9 states and 121 transitions. [2024-06-04 17:18:24,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 151 transitions, 1540 flow [2024-06-04 17:18:24,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 151 transitions, 1455 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-04 17:18:24,219 INFO L231 Difference]: Finished difference. Result has 157 places, 141 transitions, 1260 flow [2024-06-04 17:18:24,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1260, PETRI_PLACES=157, PETRI_TRANSITIONS=141} [2024-06-04 17:18:24,219 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 124 predicate places. [2024-06-04 17:18:24,220 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 141 transitions, 1260 flow [2024-06-04 17:18:24,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:24,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:24,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:24,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 17:18:24,220 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:18:24,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:24,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2052659077, now seen corresponding path program 1 times [2024-06-04 17:18:24,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:24,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570209516] [2024-06-04 17:18:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:24,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:18:34,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:34,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570209516] [2024-06-04 17:18:34,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570209516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:34,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:34,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:18:34,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159527904] [2024-06-04 17:18:34,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:34,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:18:34,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:34,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:18:34,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:18:35,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:18:35,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 141 transitions, 1260 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:35,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:35,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:18:35,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:35,425 INFO L124 PetriNetUnfolderBase]: 351/653 cut-off events. [2024-06-04 17:18:35,426 INFO L125 PetriNetUnfolderBase]: For 25122/25124 co-relation queries the response was YES. [2024-06-04 17:18:35,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4186 conditions, 653 events. 351/653 cut-off events. For 25122/25124 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2968 event pairs, 116 based on Foata normal form. 3/650 useless extension candidates. Maximal degree in co-relation 4113. Up to 555 conditions per place. [2024-06-04 17:18:35,430 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 111 selfloop transitions, 15 changer transitions 0/151 dead transitions. [2024-06-04 17:18:35,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 151 transitions, 1542 flow [2024-06-04 17:18:35,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:18:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:18:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-04 17:18:35,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3758169934640523 [2024-06-04 17:18:35,431 INFO L175 Difference]: Start difference. First operand has 157 places, 141 transitions, 1260 flow. Second operand 9 states and 115 transitions. [2024-06-04 17:18:35,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 151 transitions, 1542 flow [2024-06-04 17:18:35,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 151 transitions, 1476 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 17:18:35,457 INFO L231 Difference]: Finished difference. Result has 159 places, 143 transitions, 1245 flow [2024-06-04 17:18:35,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1245, PETRI_PLACES=159, PETRI_TRANSITIONS=143} [2024-06-04 17:18:35,458 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 126 predicate places. [2024-06-04 17:18:35,458 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 143 transitions, 1245 flow [2024-06-04 17:18:35,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:35,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:35,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:35,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 17:18:35,459 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:18:35,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:35,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1323152227, now seen corresponding path program 1 times [2024-06-04 17:18:35,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:35,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943721480] [2024-06-04 17:18:35,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:35,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:18:46,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:46,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943721480] [2024-06-04 17:18:46,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943721480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:46,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:46,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:18:46,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2312743] [2024-06-04 17:18:46,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:46,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:18:46,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:46,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:18:46,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:18:46,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:18:46,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 143 transitions, 1245 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:46,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:46,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:18:46,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:47,380 INFO L124 PetriNetUnfolderBase]: 361/674 cut-off events. [2024-06-04 17:18:47,380 INFO L125 PetriNetUnfolderBase]: For 26606/26607 co-relation queries the response was YES. [2024-06-04 17:18:47,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4362 conditions, 674 events. 361/674 cut-off events. For 26606/26607 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3068 event pairs, 80 based on Foata normal form. 1/674 useless extension candidates. Maximal degree in co-relation 4288. Up to 524 conditions per place. [2024-06-04 17:18:47,385 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 114 selfloop transitions, 33 changer transitions 0/166 dead transitions. [2024-06-04 17:18:47,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 1651 flow [2024-06-04 17:18:47,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:18:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:18:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-04 17:18:47,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4088235294117647 [2024-06-04 17:18:47,386 INFO L175 Difference]: Start difference. First operand has 159 places, 143 transitions, 1245 flow. Second operand 10 states and 139 transitions. [2024-06-04 17:18:47,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 1651 flow [2024-06-04 17:18:47,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 166 transitions, 1553 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-04 17:18:47,416 INFO L231 Difference]: Finished difference. Result has 160 places, 148 transitions, 1296 flow [2024-06-04 17:18:47,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1296, PETRI_PLACES=160, PETRI_TRANSITIONS=148} [2024-06-04 17:18:47,417 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 127 predicate places. [2024-06-04 17:18:47,417 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 148 transitions, 1296 flow [2024-06-04 17:18:47,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:47,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:47,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:47,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 17:18:47,417 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:18:47,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash 813154513, now seen corresponding path program 2 times [2024-06-04 17:18:47,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:47,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483616991] [2024-06-04 17:18:47,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:47,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:57,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-04 17:18:57,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:57,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483616991] [2024-06-04 17:18:57,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483616991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:57,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:57,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:18:57,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123324906] [2024-06-04 17:18:57,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:57,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:18:57,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:57,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:18:57,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:18:57,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:18:57,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 148 transitions, 1296 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:57,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:57,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:18:57,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:57,946 INFO L124 PetriNetUnfolderBase]: 362/680 cut-off events. [2024-06-04 17:18:57,946 INFO L125 PetriNetUnfolderBase]: For 27503/27504 co-relation queries the response was YES. [2024-06-04 17:18:57,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4403 conditions, 680 events. 362/680 cut-off events. For 27503/27504 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3149 event pairs, 79 based on Foata normal form. 1/680 useless extension candidates. Maximal degree in co-relation 4328. Up to 520 conditions per place. [2024-06-04 17:18:57,951 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 115 selfloop transitions, 38 changer transitions 0/172 dead transitions. [2024-06-04 17:18:57,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 172 transitions, 1722 flow [2024-06-04 17:18:57,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:18:57,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:18:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-04 17:18:57,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4037433155080214 [2024-06-04 17:18:57,960 INFO L175 Difference]: Start difference. First operand has 160 places, 148 transitions, 1296 flow. Second operand 11 states and 151 transitions. [2024-06-04 17:18:57,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 172 transitions, 1722 flow [2024-06-04 17:18:57,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 172 transitions, 1609 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-04 17:18:57,991 INFO L231 Difference]: Finished difference. Result has 164 places, 152 transitions, 1338 flow [2024-06-04 17:18:57,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1338, PETRI_PLACES=164, PETRI_TRANSITIONS=152} [2024-06-04 17:18:57,992 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 131 predicate places. [2024-06-04 17:18:57,992 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 152 transitions, 1338 flow [2024-06-04 17:18:57,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:57,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:57,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:57,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 17:18:57,992 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:18:57,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:57,992 INFO L85 PathProgramCache]: Analyzing trace with hash 816859819, now seen corresponding path program 1 times [2024-06-04 17:18:57,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:57,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859487189] [2024-06-04 17:18:57,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:57,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:19:05,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:05,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859487189] [2024-06-04 17:19:05,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859487189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:05,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:05,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:19:05,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670578212] [2024-06-04 17:19:05,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:05,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:19:05,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:05,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:19:05,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:19:05,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:19:05,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 152 transitions, 1338 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:05,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:05,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:19:05,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:06,366 INFO L124 PetriNetUnfolderBase]: 384/703 cut-off events. [2024-06-04 17:19:06,366 INFO L125 PetriNetUnfolderBase]: For 28683/28683 co-relation queries the response was YES. [2024-06-04 17:19:06,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4571 conditions, 703 events. 384/703 cut-off events. For 28683/28683 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3170 event pairs, 90 based on Foata normal form. 1/704 useless extension candidates. Maximal degree in co-relation 4495. Up to 610 conditions per place. [2024-06-04 17:19:06,371 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 138 selfloop transitions, 31 changer transitions 0/172 dead transitions. [2024-06-04 17:19:06,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 172 transitions, 1742 flow [2024-06-04 17:19:06,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:19:06,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:19:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 17:19:06,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3735294117647059 [2024-06-04 17:19:06,372 INFO L175 Difference]: Start difference. First operand has 164 places, 152 transitions, 1338 flow. Second operand 10 states and 127 transitions. [2024-06-04 17:19:06,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 172 transitions, 1742 flow [2024-06-04 17:19:06,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 172 transitions, 1638 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-04 17:19:06,397 INFO L231 Difference]: Finished difference. Result has 168 places, 156 transitions, 1334 flow [2024-06-04 17:19:06,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1334, PETRI_PLACES=168, PETRI_TRANSITIONS=156} [2024-06-04 17:19:06,398 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 135 predicate places. [2024-06-04 17:19:06,398 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 156 transitions, 1334 flow [2024-06-04 17:19:06,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:06,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:06,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:06,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 17:19:06,398 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:19:06,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:06,398 INFO L85 PathProgramCache]: Analyzing trace with hash 175601357, now seen corresponding path program 2 times [2024-06-04 17:19:06,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:06,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950394529] [2024-06-04 17:19:06,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:06,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:16,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-04 17:19:16,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:16,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950394529] [2024-06-04 17:19:16,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950394529] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:16,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:16,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:19:16,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237360679] [2024-06-04 17:19:16,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:16,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:19:16,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:16,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:19:16,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:19:16,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:19:16,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 156 transitions, 1334 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:16,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:16,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:19:16,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:16,782 INFO L124 PetriNetUnfolderBase]: 390/714 cut-off events. [2024-06-04 17:19:16,782 INFO L125 PetriNetUnfolderBase]: For 29053/29053 co-relation queries the response was YES. [2024-06-04 17:19:16,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4635 conditions, 714 events. 390/714 cut-off events. For 29053/29053 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3245 event pairs, 92 based on Foata normal form. 2/716 useless extension candidates. Maximal degree in co-relation 4557. Up to 612 conditions per place. [2024-06-04 17:19:16,787 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 143 selfloop transitions, 29 changer transitions 0/175 dead transitions. [2024-06-04 17:19:16,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 175 transitions, 1764 flow [2024-06-04 17:19:16,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:19:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:19:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-04 17:19:16,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37941176470588234 [2024-06-04 17:19:16,789 INFO L175 Difference]: Start difference. First operand has 168 places, 156 transitions, 1334 flow. Second operand 10 states and 129 transitions. [2024-06-04 17:19:16,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 175 transitions, 1764 flow [2024-06-04 17:19:16,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 175 transitions, 1712 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 17:19:16,822 INFO L231 Difference]: Finished difference. Result has 172 places, 158 transitions, 1383 flow [2024-06-04 17:19:16,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1383, PETRI_PLACES=172, PETRI_TRANSITIONS=158} [2024-06-04 17:19:16,822 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 139 predicate places. [2024-06-04 17:19:16,822 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 158 transitions, 1383 flow [2024-06-04 17:19:16,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:16,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:16,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:16,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 17:19:16,823 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:19:16,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:16,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1354826777, now seen corresponding path program 2 times [2024-06-04 17:19:16,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:16,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803042646] [2024-06-04 17:19:16,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:16,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:26,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:19:26,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:26,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803042646] [2024-06-04 17:19:26,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803042646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:26,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:26,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:19:26,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741840810] [2024-06-04 17:19:26,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:26,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:19:26,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:26,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:19:26,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:19:27,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:19:27,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 158 transitions, 1383 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:27,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:27,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:19:27,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:27,424 INFO L124 PetriNetUnfolderBase]: 393/722 cut-off events. [2024-06-04 17:19:27,424 INFO L125 PetriNetUnfolderBase]: For 30067/30067 co-relation queries the response was YES. [2024-06-04 17:19:27,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4768 conditions, 722 events. 393/722 cut-off events. For 30067/30067 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3303 event pairs, 96 based on Foata normal form. 1/723 useless extension candidates. Maximal degree in co-relation 4688. Up to 643 conditions per place. [2024-06-04 17:19:27,430 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 147 selfloop transitions, 24 changer transitions 0/174 dead transitions. [2024-06-04 17:19:27,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 174 transitions, 1785 flow [2024-06-04 17:19:27,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:19:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:19:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 17:19:27,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36470588235294116 [2024-06-04 17:19:27,432 INFO L175 Difference]: Start difference. First operand has 172 places, 158 transitions, 1383 flow. Second operand 10 states and 124 transitions. [2024-06-04 17:19:27,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 174 transitions, 1785 flow [2024-06-04 17:19:27,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 174 transitions, 1700 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 17:19:27,466 INFO L231 Difference]: Finished difference. Result has 174 places, 160 transitions, 1379 flow [2024-06-04 17:19:27,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1379, PETRI_PLACES=174, PETRI_TRANSITIONS=160} [2024-06-04 17:19:27,467 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 141 predicate places. [2024-06-04 17:19:27,467 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 160 transitions, 1379 flow [2024-06-04 17:19:27,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:27,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:27,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:27,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 17:19:27,467 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:19:27,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:27,467 INFO L85 PathProgramCache]: Analyzing trace with hash 181185077, now seen corresponding path program 3 times [2024-06-04 17:19:27,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:27,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861235487] [2024-06-04 17:19:27,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:27,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:19:37,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:37,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861235487] [2024-06-04 17:19:37,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861235487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:37,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:37,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:19:37,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5047104] [2024-06-04 17:19:37,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:37,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:19:37,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:37,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:19:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:19:37,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:19:37,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 160 transitions, 1379 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:37,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:37,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:19:37,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:38,273 INFO L124 PetriNetUnfolderBase]: 409/749 cut-off events. [2024-06-04 17:19:38,274 INFO L125 PetriNetUnfolderBase]: For 33970/33970 co-relation queries the response was YES. [2024-06-04 17:19:38,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5050 conditions, 749 events. 409/749 cut-off events. For 33970/33970 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3467 event pairs, 85 based on Foata normal form. 2/751 useless extension candidates. Maximal degree in co-relation 4969. Up to 601 conditions per place. [2024-06-04 17:19:38,280 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 138 selfloop transitions, 41 changer transitions 0/182 dead transitions. [2024-06-04 17:19:38,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 182 transitions, 1949 flow [2024-06-04 17:19:38,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:19:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:19:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-04 17:19:38,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38823529411764707 [2024-06-04 17:19:38,285 INFO L175 Difference]: Start difference. First operand has 174 places, 160 transitions, 1379 flow. Second operand 10 states and 132 transitions. [2024-06-04 17:19:38,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 182 transitions, 1949 flow [2024-06-04 17:19:38,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 182 transitions, 1884 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 17:19:38,323 INFO L231 Difference]: Finished difference. Result has 176 places, 164 transitions, 1481 flow [2024-06-04 17:19:38,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1481, PETRI_PLACES=176, PETRI_TRANSITIONS=164} [2024-06-04 17:19:38,323 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 143 predicate places. [2024-06-04 17:19:38,323 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 164 transitions, 1481 flow [2024-06-04 17:19:38,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:38,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:38,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:38,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 17:19:38,324 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:19:38,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:38,325 INFO L85 PathProgramCache]: Analyzing trace with hash -363721453, now seen corresponding path program 4 times [2024-06-04 17:19:38,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:38,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131790809] [2024-06-04 17:19:38,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:38,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:19:48,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:48,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131790809] [2024-06-04 17:19:48,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131790809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:48,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:48,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:19:48,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508537510] [2024-06-04 17:19:48,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:48,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:19:48,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:48,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:19:48,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:19:48,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:19:48,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 164 transitions, 1481 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:48,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:48,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:19:48,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:49,053 INFO L124 PetriNetUnfolderBase]: 410/751 cut-off events. [2024-06-04 17:19:49,053 INFO L125 PetriNetUnfolderBase]: For 35262/35262 co-relation queries the response was YES. [2024-06-04 17:19:49,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5146 conditions, 751 events. 410/751 cut-off events. For 35262/35262 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3480 event pairs, 87 based on Foata normal form. 2/753 useless extension candidates. Maximal degree in co-relation 5064. Up to 604 conditions per place. [2024-06-04 17:19:49,059 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 141 selfloop transitions, 40 changer transitions 0/184 dead transitions. [2024-06-04 17:19:49,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 184 transitions, 2023 flow [2024-06-04 17:19:49,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:19:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:19:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-04 17:19:49,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911764705882353 [2024-06-04 17:19:49,062 INFO L175 Difference]: Start difference. First operand has 176 places, 164 transitions, 1481 flow. Second operand 10 states and 133 transitions. [2024-06-04 17:19:49,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 184 transitions, 2023 flow [2024-06-04 17:19:49,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 184 transitions, 1942 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-04 17:19:49,102 INFO L231 Difference]: Finished difference. Result has 180 places, 166 transitions, 1527 flow [2024-06-04 17:19:49,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1527, PETRI_PLACES=180, PETRI_TRANSITIONS=166} [2024-06-04 17:19:49,103 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 147 predicate places. [2024-06-04 17:19:49,103 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 166 transitions, 1527 flow [2024-06-04 17:19:49,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:49,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:49,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:49,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 17:19:49,103 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:19:49,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash -437920109, now seen corresponding path program 5 times [2024-06-04 17:19:49,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:49,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591089519] [2024-06-04 17:19:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:49,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:19:58,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:58,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591089519] [2024-06-04 17:19:58,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591089519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:58,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:58,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:19:58,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886956764] [2024-06-04 17:19:58,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:58,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:19:58,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:58,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:19:58,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:19:58,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:19:58,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 166 transitions, 1527 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:58,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:58,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:19:58,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:58,895 INFO L124 PetriNetUnfolderBase]: 416/764 cut-off events. [2024-06-04 17:19:58,895 INFO L125 PetriNetUnfolderBase]: For 36892/36892 co-relation queries the response was YES. [2024-06-04 17:19:58,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5288 conditions, 764 events. 416/764 cut-off events. For 36892/36892 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3571 event pairs, 54 based on Foata normal form. 2/766 useless extension candidates. Maximal degree in co-relation 5204. Up to 655 conditions per place. [2024-06-04 17:19:58,901 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 153 selfloop transitions, 28 changer transitions 0/184 dead transitions. [2024-06-04 17:19:58,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 184 transitions, 1981 flow [2024-06-04 17:19:58,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:19:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:19:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-04 17:19:58,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37941176470588234 [2024-06-04 17:19:58,902 INFO L175 Difference]: Start difference. First operand has 180 places, 166 transitions, 1527 flow. Second operand 10 states and 129 transitions. [2024-06-04 17:19:58,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 184 transitions, 1981 flow [2024-06-04 17:19:58,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 184 transitions, 1885 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-04 17:19:58,938 INFO L231 Difference]: Finished difference. Result has 183 places, 168 transitions, 1538 flow [2024-06-04 17:19:58,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1431, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1538, PETRI_PLACES=183, PETRI_TRANSITIONS=168} [2024-06-04 17:19:58,939 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 150 predicate places. [2024-06-04 17:19:58,939 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 168 transitions, 1538 flow [2024-06-04 17:19:58,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:58,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:58,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:58,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 17:19:58,940 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:19:58,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:58,940 INFO L85 PathProgramCache]: Analyzing trace with hash 257278715, now seen corresponding path program 6 times [2024-06-04 17:19:58,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:58,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638028977] [2024-06-04 17:19:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:58,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:20:07,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:07,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638028977] [2024-06-04 17:20:07,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638028977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:07,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:07,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:20:07,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035358037] [2024-06-04 17:20:07,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:07,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:20:07,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:07,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:20:07,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:20:07,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:20:07,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 168 transitions, 1538 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:07,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:07,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:20:07,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:07,799 INFO L124 PetriNetUnfolderBase]: 432/792 cut-off events. [2024-06-04 17:20:07,799 INFO L125 PetriNetUnfolderBase]: For 40895/40895 co-relation queries the response was YES. [2024-06-04 17:20:07,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5598 conditions, 792 events. 432/792 cut-off events. For 40895/40895 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3734 event pairs, 54 based on Foata normal form. 2/794 useless extension candidates. Maximal degree in co-relation 5513. Up to 652 conditions per place. [2024-06-04 17:20:07,806 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 150 selfloop transitions, 36 changer transitions 0/189 dead transitions. [2024-06-04 17:20:07,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 189 transitions, 2142 flow [2024-06-04 17:20:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:20:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:20:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-04 17:20:07,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911764705882353 [2024-06-04 17:20:07,807 INFO L175 Difference]: Start difference. First operand has 183 places, 168 transitions, 1538 flow. Second operand 10 states and 133 transitions. [2024-06-04 17:20:07,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 189 transitions, 2142 flow [2024-06-04 17:20:07,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 189 transitions, 2051 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-04 17:20:07,850 INFO L231 Difference]: Finished difference. Result has 185 places, 172 transitions, 1620 flow [2024-06-04 17:20:07,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1447, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1620, PETRI_PLACES=185, PETRI_TRANSITIONS=172} [2024-06-04 17:20:07,850 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 152 predicate places. [2024-06-04 17:20:07,850 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 172 transitions, 1620 flow [2024-06-04 17:20:07,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:07,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:07,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:07,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 17:20:07,851 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:20:07,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:07,851 INFO L85 PathProgramCache]: Analyzing trace with hash 257272205, now seen corresponding path program 7 times [2024-06-04 17:20:07,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:07,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006305006] [2024-06-04 17:20:07,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:07,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:20:16,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:16,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006305006] [2024-06-04 17:20:16,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006305006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:16,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:16,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:20:16,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920800065] [2024-06-04 17:20:16,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:16,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:20:16,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:16,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:20:16,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:20:16,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:20:16,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 172 transitions, 1620 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:16,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:16,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:20:16,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:16,626 INFO L124 PetriNetUnfolderBase]: 428/788 cut-off events. [2024-06-04 17:20:16,627 INFO L125 PetriNetUnfolderBase]: For 40883/40883 co-relation queries the response was YES. [2024-06-04 17:20:16,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5516 conditions, 788 events. 428/788 cut-off events. For 40883/40883 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3728 event pairs, 56 based on Foata normal form. 2/790 useless extension candidates. Maximal degree in co-relation 5430. Up to 649 conditions per place. [2024-06-04 17:20:16,633 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 150 selfloop transitions, 35 changer transitions 0/188 dead transitions. [2024-06-04 17:20:16,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 188 transitions, 2042 flow [2024-06-04 17:20:16,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:20:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:20:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-04 17:20:16,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911764705882353 [2024-06-04 17:20:16,634 INFO L175 Difference]: Start difference. First operand has 185 places, 172 transitions, 1620 flow. Second operand 10 states and 133 transitions. [2024-06-04 17:20:16,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 188 transitions, 2042 flow [2024-06-04 17:20:16,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 188 transitions, 1929 flow, removed 38 selfloop flow, removed 6 redundant places. [2024-06-04 17:20:16,678 INFO L231 Difference]: Finished difference. Result has 189 places, 172 transitions, 1582 flow [2024-06-04 17:20:16,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1582, PETRI_PLACES=189, PETRI_TRANSITIONS=172} [2024-06-04 17:20:16,678 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 156 predicate places. [2024-06-04 17:20:16,678 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 172 transitions, 1582 flow [2024-06-04 17:20:16,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:16,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:16,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:16,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 17:20:16,679 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:20:16,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:16,680 INFO L85 PathProgramCache]: Analyzing trace with hash 430007863, now seen corresponding path program 3 times [2024-06-04 17:20:16,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:16,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572753760] [2024-06-04 17:20:16,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:16,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:20:26,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:26,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572753760] [2024-06-04 17:20:26,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572753760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:26,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:26,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:20:26,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881447818] [2024-06-04 17:20:26,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:26,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:20:26,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:26,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:20:26,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:20:26,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:20:26,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 172 transitions, 1582 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:26,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:26,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:20:26,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:27,322 INFO L124 PetriNetUnfolderBase]: 436/799 cut-off events. [2024-06-04 17:20:27,322 INFO L125 PetriNetUnfolderBase]: For 42069/42069 co-relation queries the response was YES. [2024-06-04 17:20:27,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5647 conditions, 799 events. 436/799 cut-off events. For 42069/42069 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3757 event pairs, 96 based on Foata normal form. 1/800 useless extension candidates. Maximal degree in co-relation 5559. Up to 678 conditions per place. [2024-06-04 17:20:27,328 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 144 selfloop transitions, 42 changer transitions 0/189 dead transitions. [2024-06-04 17:20:27,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 189 transitions, 2132 flow [2024-06-04 17:20:27,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:20:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:20:27,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 17:20:27,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3735294117647059 [2024-06-04 17:20:27,329 INFO L175 Difference]: Start difference. First operand has 189 places, 172 transitions, 1582 flow. Second operand 10 states and 127 transitions. [2024-06-04 17:20:27,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 189 transitions, 2132 flow [2024-06-04 17:20:27,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 189 transitions, 2048 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 17:20:27,380 INFO L231 Difference]: Finished difference. Result has 190 places, 176 transitions, 1647 flow [2024-06-04 17:20:27,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1647, PETRI_PLACES=190, PETRI_TRANSITIONS=176} [2024-06-04 17:20:27,381 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 157 predicate places. [2024-06-04 17:20:27,381 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 176 transitions, 1647 flow [2024-06-04 17:20:27,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:27,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:27,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:27,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 17:20:27,382 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:20:27,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:27,383 INFO L85 PathProgramCache]: Analyzing trace with hash 430008173, now seen corresponding path program 1 times [2024-06-04 17:20:27,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:27,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952019713] [2024-06-04 17:20:27,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:27,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:36,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-04 17:20:36,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:36,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952019713] [2024-06-04 17:20:36,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952019713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:36,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:36,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:20:36,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088497622] [2024-06-04 17:20:36,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:36,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:20:36,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:36,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:20:36,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:20:36,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:20:36,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 176 transitions, 1647 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:36,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:36,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:20:36,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:37,117 INFO L124 PetriNetUnfolderBase]: 415/775 cut-off events. [2024-06-04 17:20:37,118 INFO L125 PetriNetUnfolderBase]: For 44701/44702 co-relation queries the response was YES. [2024-06-04 17:20:37,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5524 conditions, 775 events. 415/775 cut-off events. For 44701/44702 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3729 event pairs, 110 based on Foata normal form. 2/773 useless extension candidates. Maximal degree in co-relation 5435. Up to 649 conditions per place. [2024-06-04 17:20:37,124 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 143 selfloop transitions, 19 changer transitions 0/190 dead transitions. [2024-06-04 17:20:37,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 190 transitions, 2021 flow [2024-06-04 17:20:37,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:20:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:20:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-04 17:20:37,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-04 17:20:37,125 INFO L175 Difference]: Start difference. First operand has 190 places, 176 transitions, 1647 flow. Second operand 10 states and 130 transitions. [2024-06-04 17:20:37,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 190 transitions, 2021 flow [2024-06-04 17:20:37,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 190 transitions, 1951 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 17:20:37,182 INFO L231 Difference]: Finished difference. Result has 194 places, 178 transitions, 1644 flow [2024-06-04 17:20:37,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1577, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1644, PETRI_PLACES=194, PETRI_TRANSITIONS=178} [2024-06-04 17:20:37,182 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 161 predicate places. [2024-06-04 17:20:37,183 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 178 transitions, 1644 flow [2024-06-04 17:20:37,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:37,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:37,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:37,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 17:20:37,183 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:20:37,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:37,183 INFO L85 PathProgramCache]: Analyzing trace with hash 429999245, now seen corresponding path program 8 times [2024-06-04 17:20:37,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:37,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059033524] [2024-06-04 17:20:37,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:37,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:46,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-04 17:20:46,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:46,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059033524] [2024-06-04 17:20:46,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059033524] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:46,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:46,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:20:46,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921964426] [2024-06-04 17:20:46,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:46,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:20:46,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:46,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:20:46,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:20:46,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:20:46,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 178 transitions, 1644 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:46,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:46,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:20:46,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:47,180 INFO L124 PetriNetUnfolderBase]: 455/832 cut-off events. [2024-06-04 17:20:47,180 INFO L125 PetriNetUnfolderBase]: For 49488/49488 co-relation queries the response was YES. [2024-06-04 17:20:47,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6120 conditions, 832 events. 455/832 cut-off events. For 49488/49488 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3957 event pairs, 54 based on Foata normal form. 2/834 useless extension candidates. Maximal degree in co-relation 6029. Up to 598 conditions per place. [2024-06-04 17:20:47,187 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 130 selfloop transitions, 65 changer transitions 0/198 dead transitions. [2024-06-04 17:20:47,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 198 transitions, 2278 flow [2024-06-04 17:20:47,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:20:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:20:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-04 17:20:47,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911764705882353 [2024-06-04 17:20:47,188 INFO L175 Difference]: Start difference. First operand has 194 places, 178 transitions, 1644 flow. Second operand 10 states and 133 transitions. [2024-06-04 17:20:47,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 198 transitions, 2278 flow [2024-06-04 17:20:47,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 198 transitions, 2227 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 17:20:47,242 INFO L231 Difference]: Finished difference. Result has 196 places, 182 transitions, 1832 flow [2024-06-04 17:20:47,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1832, PETRI_PLACES=196, PETRI_TRANSITIONS=182} [2024-06-04 17:20:47,242 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 163 predicate places. [2024-06-04 17:20:47,242 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 182 transitions, 1832 flow [2024-06-04 17:20:47,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:47,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:47,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:47,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 17:20:47,243 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:20:47,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:47,243 INFO L85 PathProgramCache]: Analyzing trace with hash 429768853, now seen corresponding path program 4 times [2024-06-04 17:20:47,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:47,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092991438] [2024-06-04 17:20:47,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:47,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:20:57,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:57,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092991438] [2024-06-04 17:20:57,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092991438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:57,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:57,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:20:57,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425912607] [2024-06-04 17:20:57,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:57,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:20:57,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:57,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:20:57,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:20:57,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:20:57,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 182 transitions, 1832 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:57,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:57,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:20:57,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:58,182 INFO L124 PetriNetUnfolderBase]: 458/838 cut-off events. [2024-06-04 17:20:58,183 INFO L125 PetriNetUnfolderBase]: For 50968/50968 co-relation queries the response was YES. [2024-06-04 17:20:58,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6344 conditions, 838 events. 458/838 cut-off events. For 50968/50968 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3991 event pairs, 98 based on Foata normal form. 1/839 useless extension candidates. Maximal degree in co-relation 6252. Up to 713 conditions per place. [2024-06-04 17:20:58,189 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 155 selfloop transitions, 39 changer transitions 0/197 dead transitions. [2024-06-04 17:20:58,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 197 transitions, 2378 flow [2024-06-04 17:20:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:20:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:20:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-04 17:20:58,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37941176470588234 [2024-06-04 17:20:58,190 INFO L175 Difference]: Start difference. First operand has 196 places, 182 transitions, 1832 flow. Second operand 10 states and 129 transitions. [2024-06-04 17:20:58,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 197 transitions, 2378 flow [2024-06-04 17:20:58,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 197 transitions, 2270 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-04 17:20:58,258 INFO L231 Difference]: Finished difference. Result has 200 places, 184 transitions, 1837 flow [2024-06-04 17:20:58,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1837, PETRI_PLACES=200, PETRI_TRANSITIONS=184} [2024-06-04 17:20:58,258 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 167 predicate places. [2024-06-04 17:20:58,258 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 184 transitions, 1837 flow [2024-06-04 17:20:58,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:58,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:58,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:58,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 17:20:58,259 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:20:58,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:58,259 INFO L85 PathProgramCache]: Analyzing trace with hash 429999493, now seen corresponding path program 5 times [2024-06-04 17:20:58,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:58,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703718354] [2024-06-04 17:20:58,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:58,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:21:08,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:08,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703718354] [2024-06-04 17:21:08,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703718354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:08,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:08,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:21:08,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799230578] [2024-06-04 17:21:08,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:08,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:21:08,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:08,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:21:08,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:21:08,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:21:08,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 184 transitions, 1837 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:08,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:08,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:21:08,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:09,142 INFO L124 PetriNetUnfolderBase]: 456/834 cut-off events. [2024-06-04 17:21:09,143 INFO L125 PetriNetUnfolderBase]: For 50706/50706 co-relation queries the response was YES. [2024-06-04 17:21:09,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6250 conditions, 834 events. 456/834 cut-off events. For 50706/50706 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3977 event pairs, 98 based on Foata normal form. 1/835 useless extension candidates. Maximal degree in co-relation 6156. Up to 711 conditions per place. [2024-06-04 17:21:09,150 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 152 selfloop transitions, 41 changer transitions 0/196 dead transitions. [2024-06-04 17:21:09,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 196 transitions, 2253 flow [2024-06-04 17:21:09,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:21:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:21:09,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 17:21:09,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3735294117647059 [2024-06-04 17:21:09,153 INFO L175 Difference]: Start difference. First operand has 200 places, 184 transitions, 1837 flow. Second operand 10 states and 127 transitions. [2024-06-04 17:21:09,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 196 transitions, 2253 flow [2024-06-04 17:21:09,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 196 transitions, 2144 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-04 17:21:09,221 INFO L231 Difference]: Finished difference. Result has 203 places, 184 transitions, 1815 flow [2024-06-04 17:21:09,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1728, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1815, PETRI_PLACES=203, PETRI_TRANSITIONS=184} [2024-06-04 17:21:09,222 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 170 predicate places. [2024-06-04 17:21:09,222 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 184 transitions, 1815 flow [2024-06-04 17:21:09,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:09,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:09,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:09,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 17:21:09,222 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:21:09,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:09,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1604021997, now seen corresponding path program 9 times [2024-06-04 17:21:09,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:09,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221596755] [2024-06-04 17:21:09,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:09,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:21:18,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:18,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221596755] [2024-06-04 17:21:18,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221596755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:18,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:18,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:21:18,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217671254] [2024-06-04 17:21:18,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:18,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:21:18,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:18,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:21:18,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:21:18,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:21:18,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 184 transitions, 1815 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:18,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:18,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:21:18,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:18,865 INFO L124 PetriNetUnfolderBase]: 462/847 cut-off events. [2024-06-04 17:21:18,865 INFO L125 PetriNetUnfolderBase]: For 53972/53972 co-relation queries the response was YES. [2024-06-04 17:21:18,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6362 conditions, 847 events. 462/847 cut-off events. For 53972/53972 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4072 event pairs, 62 based on Foata normal form. 2/849 useless extension candidates. Maximal degree in co-relation 6267. Up to 606 conditions per place. [2024-06-04 17:21:18,870 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 141 selfloop transitions, 59 changer transitions 0/203 dead transitions. [2024-06-04 17:21:18,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 203 transitions, 2521 flow [2024-06-04 17:21:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:21:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:21:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2024-06-04 17:21:18,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41830065359477125 [2024-06-04 17:21:18,873 INFO L175 Difference]: Start difference. First operand has 203 places, 184 transitions, 1815 flow. Second operand 9 states and 128 transitions. [2024-06-04 17:21:18,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 203 transitions, 2521 flow [2024-06-04 17:21:18,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 203 transitions, 2417 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-04 17:21:18,944 INFO L231 Difference]: Finished difference. Result has 202 places, 186 transitions, 1888 flow [2024-06-04 17:21:18,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1711, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1888, PETRI_PLACES=202, PETRI_TRANSITIONS=186} [2024-06-04 17:21:18,945 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 169 predicate places. [2024-06-04 17:21:18,945 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 186 transitions, 1888 flow [2024-06-04 17:21:18,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:18,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:18,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:18,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 17:21:18,945 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:21:18,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:18,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1604028507, now seen corresponding path program 10 times [2024-06-04 17:21:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:18,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330618361] [2024-06-04 17:21:18,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:18,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:21:28,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:28,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330618361] [2024-06-04 17:21:28,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330618361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:28,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:28,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:21:28,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996141686] [2024-06-04 17:21:28,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:28,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:21:28,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:28,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:21:28,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:21:28,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:21:28,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 186 transitions, 1888 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:28,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:28,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:21:28,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:28,767 INFO L124 PetriNetUnfolderBase]: 458/841 cut-off events. [2024-06-04 17:21:28,767 INFO L125 PetriNetUnfolderBase]: For 53718/53718 co-relation queries the response was YES. [2024-06-04 17:21:28,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6302 conditions, 841 events. 458/841 cut-off events. For 53718/53718 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4050 event pairs, 61 based on Foata normal form. 2/843 useless extension candidates. Maximal degree in co-relation 6207. Up to 603 conditions per place. [2024-06-04 17:21:28,773 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 141 selfloop transitions, 59 changer transitions 0/203 dead transitions. [2024-06-04 17:21:28,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 203 transitions, 2446 flow [2024-06-04 17:21:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:21:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:21:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-04 17:21:28,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 17:21:28,775 INFO L175 Difference]: Start difference. First operand has 202 places, 186 transitions, 1888 flow. Second operand 10 states and 136 transitions. [2024-06-04 17:21:28,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 203 transitions, 2446 flow [2024-06-04 17:21:28,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 203 transitions, 2201 flow, removed 45 selfloop flow, removed 8 redundant places. [2024-06-04 17:21:28,855 INFO L231 Difference]: Finished difference. Result has 204 places, 186 transitions, 1766 flow [2024-06-04 17:21:28,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1643, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1766, PETRI_PLACES=204, PETRI_TRANSITIONS=186} [2024-06-04 17:21:28,855 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 171 predicate places. [2024-06-04 17:21:28,855 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 186 transitions, 1766 flow [2024-06-04 17:21:28,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:28,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:28,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:28,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 17:21:28,856 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:21:28,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:28,856 INFO L85 PathProgramCache]: Analyzing trace with hash -425594963, now seen corresponding path program 11 times [2024-06-04 17:21:28,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:28,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094741867] [2024-06-04 17:21:28,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:28,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:21:38,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:38,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094741867] [2024-06-04 17:21:38,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094741867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:38,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:38,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:21:38,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533139073] [2024-06-04 17:21:38,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:38,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:21:38,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:38,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:21:38,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:21:38,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:21:38,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 186 transitions, 1766 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:38,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:38,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:21:38,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:39,429 INFO L124 PetriNetUnfolderBase]: 462/846 cut-off events. [2024-06-04 17:21:39,429 INFO L125 PetriNetUnfolderBase]: For 55122/55122 co-relation queries the response was YES. [2024-06-04 17:21:39,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6112 conditions, 846 events. 462/846 cut-off events. For 55122/55122 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4073 event pairs, 96 based on Foata normal form. 3/849 useless extension candidates. Maximal degree in co-relation 6017. Up to 690 conditions per place. [2024-06-04 17:21:39,437 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 157 selfloop transitions, 44 changer transitions 0/204 dead transitions. [2024-06-04 17:21:39,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 204 transitions, 2262 flow [2024-06-04 17:21:39,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:21:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:21:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 17:21:39,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38562091503267976 [2024-06-04 17:21:39,438 INFO L175 Difference]: Start difference. First operand has 204 places, 186 transitions, 1766 flow. Second operand 9 states and 118 transitions. [2024-06-04 17:21:39,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 204 transitions, 2262 flow [2024-06-04 17:21:39,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 204 transitions, 2079 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-06-04 17:21:39,514 INFO L231 Difference]: Finished difference. Result has 203 places, 188 transitions, 1737 flow [2024-06-04 17:21:39,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1737, PETRI_PLACES=203, PETRI_TRANSITIONS=188} [2024-06-04 17:21:39,515 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 170 predicate places. [2024-06-04 17:21:39,515 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 188 transitions, 1737 flow [2024-06-04 17:21:39,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:39,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:39,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:39,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 17:21:39,516 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:21:39,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:39,516 INFO L85 PathProgramCache]: Analyzing trace with hash -591649253, now seen corresponding path program 12 times [2024-06-04 17:21:39,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:39,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786746119] [2024-06-04 17:21:39,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:39,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:21:49,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:49,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786746119] [2024-06-04 17:21:49,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786746119] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:49,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:49,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:21:49,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881151398] [2024-06-04 17:21:49,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:49,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:21:49,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:49,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:21:49,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:21:49,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:21:49,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 188 transitions, 1737 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:49,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:49,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:21:49,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:50,126 INFO L124 PetriNetUnfolderBase]: 478/872 cut-off events. [2024-06-04 17:21:50,127 INFO L125 PetriNetUnfolderBase]: For 58864/58864 co-relation queries the response was YES. [2024-06-04 17:21:50,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6447 conditions, 872 events. 478/872 cut-off events. For 58864/58864 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4198 event pairs, 86 based on Foata normal form. 2/874 useless extension candidates. Maximal degree in co-relation 6351. Up to 635 conditions per place. [2024-06-04 17:21:50,134 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 138 selfloop transitions, 67 changer transitions 0/208 dead transitions. [2024-06-04 17:21:50,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 208 transitions, 2403 flow [2024-06-04 17:21:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:21:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:21:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-04 17:21:50,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2024-06-04 17:21:50,135 INFO L175 Difference]: Start difference. First operand has 203 places, 188 transitions, 1737 flow. Second operand 9 states and 120 transitions. [2024-06-04 17:21:50,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 208 transitions, 2403 flow [2024-06-04 17:21:50,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 208 transitions, 2255 flow, removed 37 selfloop flow, removed 7 redundant places. [2024-06-04 17:21:50,217 INFO L231 Difference]: Finished difference. Result has 205 places, 192 transitions, 1844 flow [2024-06-04 17:21:50,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1615, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1844, PETRI_PLACES=205, PETRI_TRANSITIONS=192} [2024-06-04 17:21:50,218 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 172 predicate places. [2024-06-04 17:21:50,218 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 192 transitions, 1844 flow [2024-06-04 17:21:50,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:50,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:50,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:50,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 17:21:50,219 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:21:50,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:50,219 INFO L85 PathProgramCache]: Analyzing trace with hash -591649005, now seen corresponding path program 6 times [2024-06-04 17:21:50,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:50,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127058203] [2024-06-04 17:21:50,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:50,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:00,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:00,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127058203] [2024-06-04 17:22:00,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127058203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:00,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:00,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:22:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97417526] [2024-06-04 17:22:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:00,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:22:00,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:00,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:22:00,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:22:00,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:22:00,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 192 transitions, 1844 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:00,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:00,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:22:00,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:01,019 INFO L124 PetriNetUnfolderBase]: 481/878 cut-off events. [2024-06-04 17:22:01,019 INFO L125 PetriNetUnfolderBase]: For 53321/53321 co-relation queries the response was YES. [2024-06-04 17:22:01,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6383 conditions, 878 events. 481/878 cut-off events. For 53321/53321 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4241 event pairs, 112 based on Foata normal form. 1/879 useless extension candidates. Maximal degree in co-relation 6286. Up to 771 conditions per place. [2024-06-04 17:22:01,025 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 168 selfloop transitions, 35 changer transitions 0/206 dead transitions. [2024-06-04 17:22:01,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 206 transitions, 2312 flow [2024-06-04 17:22:01,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:22:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:22:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-04 17:22:01,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.369281045751634 [2024-06-04 17:22:01,026 INFO L175 Difference]: Start difference. First operand has 205 places, 192 transitions, 1844 flow. Second operand 9 states and 113 transitions. [2024-06-04 17:22:01,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 206 transitions, 2312 flow [2024-06-04 17:22:01,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 206 transitions, 2202 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-04 17:22:01,104 INFO L231 Difference]: Finished difference. Result has 206 places, 194 transitions, 1851 flow [2024-06-04 17:22:01,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1851, PETRI_PLACES=206, PETRI_TRANSITIONS=194} [2024-06-04 17:22:01,105 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 173 predicate places. [2024-06-04 17:22:01,105 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 194 transitions, 1851 flow [2024-06-04 17:22:01,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:01,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:01,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:01,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 17:22:01,106 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:22:01,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:01,106 INFO L85 PathProgramCache]: Analyzing trace with hash -591655763, now seen corresponding path program 13 times [2024-06-04 17:22:01,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:01,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128877327] [2024-06-04 17:22:01,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:01,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:11,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-04 17:22:11,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:11,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128877327] [2024-06-04 17:22:11,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128877327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:11,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:11,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:22:11,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612472706] [2024-06-04 17:22:11,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:11,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:22:11,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:11,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:22:11,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:22:11,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:22:11,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 194 transitions, 1851 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:11,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:11,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:22:11,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:11,866 INFO L124 PetriNetUnfolderBase]: 477/875 cut-off events. [2024-06-04 17:22:11,867 INFO L125 PetriNetUnfolderBase]: For 49645/49645 co-relation queries the response was YES. [2024-06-04 17:22:11,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6209 conditions, 875 events. 477/875 cut-off events. For 49645/49645 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4277 event pairs, 92 based on Foata normal form. 2/877 useless extension candidates. Maximal degree in co-relation 6113. Up to 637 conditions per place. [2024-06-04 17:22:11,874 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 144 selfloop transitions, 62 changer transitions 0/209 dead transitions. [2024-06-04 17:22:11,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 209 transitions, 2311 flow [2024-06-04 17:22:11,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:22:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:22:11,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-04 17:22:11,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2024-06-04 17:22:11,875 INFO L175 Difference]: Start difference. First operand has 206 places, 194 transitions, 1851 flow. Second operand 9 states and 120 transitions. [2024-06-04 17:22:11,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 209 transitions, 2311 flow [2024-06-04 17:22:11,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 209 transitions, 2200 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-04 17:22:11,950 INFO L231 Difference]: Finished difference. Result has 208 places, 194 transitions, 1875 flow [2024-06-04 17:22:11,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1740, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1875, PETRI_PLACES=208, PETRI_TRANSITIONS=194} [2024-06-04 17:22:11,950 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 175 predicate places. [2024-06-04 17:22:11,951 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 194 transitions, 1875 flow [2024-06-04 17:22:11,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:11,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:11,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:11,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 17:22:11,951 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:22:11,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:11,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1416685633, now seen corresponding path program 14 times [2024-06-04 17:22:11,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:11,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955700856] [2024-06-04 17:22:11,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:11,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:22,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:22,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955700856] [2024-06-04 17:22:22,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955700856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:22,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:22,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:22:22,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297074324] [2024-06-04 17:22:22,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:22,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:22:22,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:22,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:22:22,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:22:22,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:22:22,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 194 transitions, 1875 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:22,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:22,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:22:22,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:22,813 INFO L124 PetriNetUnfolderBase]: 503/920 cut-off events. [2024-06-04 17:22:22,813 INFO L125 PetriNetUnfolderBase]: For 53598/53598 co-relation queries the response was YES. [2024-06-04 17:22:22,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6697 conditions, 920 events. 503/920 cut-off events. For 53598/53598 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4523 event pairs, 66 based on Foata normal form. 2/922 useless extension candidates. Maximal degree in co-relation 6600. Up to 591 conditions per place. [2024-06-04 17:22:22,821 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 133 selfloop transitions, 80 changer transitions 0/216 dead transitions. [2024-06-04 17:22:22,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 216 transitions, 2681 flow [2024-06-04 17:22:22,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:22:22,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:22:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2024-06-04 17:22:22,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40522875816993464 [2024-06-04 17:22:22,822 INFO L175 Difference]: Start difference. First operand has 208 places, 194 transitions, 1875 flow. Second operand 9 states and 124 transitions. [2024-06-04 17:22:22,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 216 transitions, 2681 flow [2024-06-04 17:22:22,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 216 transitions, 2494 flow, removed 14 selfloop flow, removed 12 redundant places. [2024-06-04 17:22:22,894 INFO L231 Difference]: Finished difference. Result has 205 places, 200 transitions, 2000 flow [2024-06-04 17:22:22,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1696, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2000, PETRI_PLACES=205, PETRI_TRANSITIONS=200} [2024-06-04 17:22:22,895 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 172 predicate places. [2024-06-04 17:22:22,895 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 200 transitions, 2000 flow [2024-06-04 17:22:22,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:22,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:22,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:22,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 17:22:22,896 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:22:22,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:22,896 INFO L85 PathProgramCache]: Analyzing trace with hash -419159115, now seen corresponding path program 7 times [2024-06-04 17:22:22,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:22,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287038500] [2024-06-04 17:22:22,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:22,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:33,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:33,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287038500] [2024-06-04 17:22:33,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287038500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:33,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:33,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:22:33,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049746989] [2024-06-04 17:22:33,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:33,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:22:33,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:33,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:22:33,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:22:33,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:22:33,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 200 transitions, 2000 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:33,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:33,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:22:33,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:33,814 INFO L124 PetriNetUnfolderBase]: 511/934 cut-off events. [2024-06-04 17:22:33,814 INFO L125 PetriNetUnfolderBase]: For 51944/51944 co-relation queries the response was YES. [2024-06-04 17:22:33,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6816 conditions, 934 events. 511/934 cut-off events. For 51944/51944 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4601 event pairs, 105 based on Foata normal form. 1/935 useless extension candidates. Maximal degree in co-relation 6722. Up to 766 conditions per place. [2024-06-04 17:22:33,822 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 158 selfloop transitions, 54 changer transitions 0/215 dead transitions. [2024-06-04 17:22:33,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 215 transitions, 2602 flow [2024-06-04 17:22:33,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:22:33,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:22:33,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-04 17:22:33,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-04 17:22:33,825 INFO L175 Difference]: Start difference. First operand has 205 places, 200 transitions, 2000 flow. Second operand 9 states and 117 transitions. [2024-06-04 17:22:33,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 215 transitions, 2602 flow [2024-06-04 17:22:33,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 215 transitions, 2431 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-04 17:22:33,898 INFO L231 Difference]: Finished difference. Result has 208 places, 204 transitions, 2007 flow [2024-06-04 17:22:33,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1831, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2007, PETRI_PLACES=208, PETRI_TRANSITIONS=204} [2024-06-04 17:22:33,898 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 175 predicate places. [2024-06-04 17:22:33,898 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 204 transitions, 2007 flow [2024-06-04 17:22:33,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:33,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:33,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:33,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 17:22:33,899 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:22:33,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:33,899 INFO L85 PathProgramCache]: Analyzing trace with hash -419165873, now seen corresponding path program 15 times [2024-06-04 17:22:33,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:33,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786388420] [2024-06-04 17:22:33,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:33,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:44,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:44,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786388420] [2024-06-04 17:22:44,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786388420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:44,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:44,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:22:44,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514797980] [2024-06-04 17:22:44,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:44,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:22:44,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:44,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:22:44,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:22:44,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:22:44,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 204 transitions, 2007 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:44,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:44,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:22:44,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:44,855 INFO L124 PetriNetUnfolderBase]: 507/928 cut-off events. [2024-06-04 17:22:44,855 INFO L125 PetriNetUnfolderBase]: For 49937/49937 co-relation queries the response was YES. [2024-06-04 17:22:44,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6559 conditions, 928 events. 507/928 cut-off events. For 49937/49937 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4599 event pairs, 66 based on Foata normal form. 2/930 useless extension candidates. Maximal degree in co-relation 6465. Up to 601 conditions per place. [2024-06-04 17:22:44,863 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 133 selfloop transitions, 82 changer transitions 0/218 dead transitions. [2024-06-04 17:22:44,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 218 transitions, 2577 flow [2024-06-04 17:22:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:22:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:22:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-04 17:22:44,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3954248366013072 [2024-06-04 17:22:44,864 INFO L175 Difference]: Start difference. First operand has 208 places, 204 transitions, 2007 flow. Second operand 9 states and 121 transitions. [2024-06-04 17:22:44,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 218 transitions, 2577 flow [2024-06-04 17:22:44,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 218 transitions, 2468 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-04 17:22:44,937 INFO L231 Difference]: Finished difference. Result has 211 places, 204 transitions, 2072 flow [2024-06-04 17:22:44,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1900, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2072, PETRI_PLACES=211, PETRI_TRANSITIONS=204} [2024-06-04 17:22:44,937 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 178 predicate places. [2024-06-04 17:22:44,938 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 204 transitions, 2072 flow [2024-06-04 17:22:44,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:44,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:44,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:44,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 17:22:44,938 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:22:44,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:44,938 INFO L85 PathProgramCache]: Analyzing trace with hash -418928723, now seen corresponding path program 16 times [2024-06-04 17:22:44,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:44,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750261927] [2024-06-04 17:22:44,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:44,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:55,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:55,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750261927] [2024-06-04 17:22:55,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750261927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:55,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:55,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:22:55,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777357646] [2024-06-04 17:22:55,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:55,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:22:55,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:55,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:22:55,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:22:55,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:22:55,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 204 transitions, 2072 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:55,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:55,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:22:55,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:55,847 INFO L124 PetriNetUnfolderBase]: 503/920 cut-off events. [2024-06-04 17:22:55,847 INFO L125 PetriNetUnfolderBase]: For 47574/47574 co-relation queries the response was YES. [2024-06-04 17:22:55,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6521 conditions, 920 events. 503/920 cut-off events. For 47574/47574 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4544 event pairs, 53 based on Foata normal form. 2/922 useless extension candidates. Maximal degree in co-relation 6426. Up to 598 conditions per place. [2024-06-04 17:22:55,854 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 123 selfloop transitions, 91 changer transitions 0/217 dead transitions. [2024-06-04 17:22:55,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 217 transitions, 2542 flow [2024-06-04 17:22:55,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:22:55,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:22:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-04 17:22:55,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-04 17:22:55,855 INFO L175 Difference]: Start difference. First operand has 211 places, 204 transitions, 2072 flow. Second operand 9 states and 119 transitions. [2024-06-04 17:22:55,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 217 transitions, 2542 flow [2024-06-04 17:22:55,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 217 transitions, 2355 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-04 17:22:55,921 INFO L231 Difference]: Finished difference. Result has 212 places, 204 transitions, 2075 flow [2024-06-04 17:22:55,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2075, PETRI_PLACES=212, PETRI_TRANSITIONS=204} [2024-06-04 17:22:55,922 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 179 predicate places. [2024-06-04 17:22:55,922 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 204 transitions, 2075 flow [2024-06-04 17:22:55,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:55,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:55,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:55,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 17:22:55,923 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:22:55,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:55,923 INFO L85 PathProgramCache]: Analyzing trace with hash -418928475, now seen corresponding path program 8 times [2024-06-04 17:22:55,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:55,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274003279] [2024-06-04 17:22:55,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:55,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:23:06,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:06,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274003279] [2024-06-04 17:23:06,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274003279] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:06,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:06,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:23:06,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519529955] [2024-06-04 17:23:06,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:06,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:23:06,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:06,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:23:06,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:23:06,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:23:06,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 204 transitions, 2075 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:06,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:06,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:23:06,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:06,797 INFO L124 PetriNetUnfolderBase]: 506/927 cut-off events. [2024-06-04 17:23:06,797 INFO L125 PetriNetUnfolderBase]: For 46318/46318 co-relation queries the response was YES. [2024-06-04 17:23:06,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6561 conditions, 927 events. 506/927 cut-off events. For 46318/46318 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4575 event pairs, 103 based on Foata normal form. 1/928 useless extension candidates. Maximal degree in co-relation 6466. Up to 758 conditions per place. [2024-06-04 17:23:06,805 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 155 selfloop transitions, 59 changer transitions 0/217 dead transitions. [2024-06-04 17:23:06,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 217 transitions, 2655 flow [2024-06-04 17:23:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:23:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:23:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-04 17:23:06,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790849673202614 [2024-06-04 17:23:06,807 INFO L175 Difference]: Start difference. First operand has 212 places, 204 transitions, 2075 flow. Second operand 9 states and 116 transitions. [2024-06-04 17:23:06,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 217 transitions, 2655 flow [2024-06-04 17:23:06,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 217 transitions, 2436 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:23:06,879 INFO L231 Difference]: Finished difference. Result has 211 places, 206 transitions, 2014 flow [2024-06-04 17:23:06,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2014, PETRI_PLACES=211, PETRI_TRANSITIONS=206} [2024-06-04 17:23:06,880 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 178 predicate places. [2024-06-04 17:23:06,880 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 206 transitions, 2014 flow [2024-06-04 17:23:06,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:06,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:06,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:06,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 17:23:06,881 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:23:06,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:06,882 INFO L85 PathProgramCache]: Analyzing trace with hash -418920105, now seen corresponding path program 9 times [2024-06-04 17:23:06,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:06,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60310322] [2024-06-04 17:23:06,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:06,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:23:17,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:17,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60310322] [2024-06-04 17:23:17,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60310322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:17,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:17,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:23:17,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011961615] [2024-06-04 17:23:17,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:17,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:23:17,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:17,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:23:17,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:23:17,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:23:17,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 206 transitions, 2014 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:17,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:17,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:23:17,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:17,867 INFO L124 PetriNetUnfolderBase]: 504/923 cut-off events. [2024-06-04 17:23:17,867 INFO L125 PetriNetUnfolderBase]: For 44733/44733 co-relation queries the response was YES. [2024-06-04 17:23:17,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6366 conditions, 923 events. 504/923 cut-off events. For 44733/44733 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4573 event pairs, 103 based on Foata normal form. 1/924 useless extension candidates. Maximal degree in co-relation 6271. Up to 756 conditions per place. [2024-06-04 17:23:17,875 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 149 selfloop transitions, 64 changer transitions 0/216 dead transitions. [2024-06-04 17:23:17,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 216 transitions, 2464 flow [2024-06-04 17:23:17,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:23:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:23:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 17:23:17,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-04 17:23:17,876 INFO L175 Difference]: Start difference. First operand has 211 places, 206 transitions, 2014 flow. Second operand 9 states and 114 transitions. [2024-06-04 17:23:17,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 216 transitions, 2464 flow [2024-06-04 17:23:17,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 216 transitions, 2305 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-04 17:23:17,940 INFO L231 Difference]: Finished difference. Result has 212 places, 206 transitions, 1991 flow [2024-06-04 17:23:17,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1855, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1991, PETRI_PLACES=212, PETRI_TRANSITIONS=206} [2024-06-04 17:23:17,941 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 179 predicate places. [2024-06-04 17:23:17,941 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 206 transitions, 1991 flow [2024-06-04 17:23:17,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:17,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:17,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:17,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 17:23:17,942 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:23:17,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:17,943 INFO L85 PathProgramCache]: Analyzing trace with hash -418919795, now seen corresponding path program 2 times [2024-06-04 17:23:17,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:17,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349191672] [2024-06-04 17:23:17,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:17,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:28,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-04 17:23:28,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:28,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349191672] [2024-06-04 17:23:28,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349191672] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:28,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:28,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:23:28,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928007772] [2024-06-04 17:23:28,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:28,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:23:28,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:28,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:23:28,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:23:28,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:23:28,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 206 transitions, 1991 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:28,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:28,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:23:28,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:29,054 INFO L124 PetriNetUnfolderBase]: 480/896 cut-off events. [2024-06-04 17:23:29,054 INFO L125 PetriNetUnfolderBase]: For 44990/44991 co-relation queries the response was YES. [2024-06-04 17:23:29,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6167 conditions, 896 events. 480/896 cut-off events. For 44990/44991 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4535 event pairs, 118 based on Foata normal form. 2/894 useless extension candidates. Maximal degree in co-relation 6072. Up to 737 conditions per place. [2024-06-04 17:23:29,061 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 159 selfloop transitions, 26 changer transitions 0/218 dead transitions. [2024-06-04 17:23:29,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 218 transitions, 2409 flow [2024-06-04 17:23:29,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:23:29,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:23:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 17:23:29,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38562091503267976 [2024-06-04 17:23:29,063 INFO L175 Difference]: Start difference. First operand has 212 places, 206 transitions, 1991 flow. Second operand 9 states and 118 transitions. [2024-06-04 17:23:29,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 218 transitions, 2409 flow [2024-06-04 17:23:29,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 218 transitions, 2268 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:23:29,131 INFO L231 Difference]: Finished difference. Result has 212 places, 208 transitions, 1938 flow [2024-06-04 17:23:29,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1850, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1938, PETRI_PLACES=212, PETRI_TRANSITIONS=208} [2024-06-04 17:23:29,132 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 179 predicate places. [2024-06-04 17:23:29,132 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 208 transitions, 1938 flow [2024-06-04 17:23:29,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:29,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:29,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:29,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 17:23:29,132 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:23:29,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:29,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1087904843, now seen corresponding path program 10 times [2024-06-04 17:23:29,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:29,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303863862] [2024-06-04 17:23:29,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:29,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:23:40,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:40,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303863862] [2024-06-04 17:23:40,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303863862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:40,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:40,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:23:40,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746177100] [2024-06-04 17:23:40,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:40,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:23:40,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:40,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:23:40,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:23:40,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:23:40,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 208 transitions, 1938 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:40,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:40,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:23:40,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:40,645 INFO L124 PetriNetUnfolderBase]: 510/932 cut-off events. [2024-06-04 17:23:40,645 INFO L125 PetriNetUnfolderBase]: For 44399/44399 co-relation queries the response was YES. [2024-06-04 17:23:40,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6360 conditions, 932 events. 510/932 cut-off events. For 44399/44399 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4606 event pairs, 103 based on Foata normal form. 1/933 useless extension candidates. Maximal degree in co-relation 6265. Up to 712 conditions per place. [2024-06-04 17:23:40,653 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 152 selfloop transitions, 69 changer transitions 0/224 dead transitions. [2024-06-04 17:23:40,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 224 transitions, 2560 flow [2024-06-04 17:23:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:23:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:23:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-04 17:23:40,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-04 17:23:40,654 INFO L175 Difference]: Start difference. First operand has 212 places, 208 transitions, 1938 flow. Second operand 10 states and 130 transitions. [2024-06-04 17:23:40,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 224 transitions, 2560 flow [2024-06-04 17:23:40,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 224 transitions, 2490 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-04 17:23:40,723 INFO L231 Difference]: Finished difference. Result has 215 places, 212 transitions, 2073 flow [2024-06-04 17:23:40,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1870, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2073, PETRI_PLACES=215, PETRI_TRANSITIONS=212} [2024-06-04 17:23:40,723 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 182 predicate places. [2024-06-04 17:23:40,724 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 212 transitions, 2073 flow [2024-06-04 17:23:40,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:40,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:40,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:40,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 17:23:40,724 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:23:40,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:40,724 INFO L85 PathProgramCache]: Analyzing trace with hash 176540483, now seen corresponding path program 17 times [2024-06-04 17:23:40,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:40,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311391080] [2024-06-04 17:23:40,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:40,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:23:51,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:51,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311391080] [2024-06-04 17:23:51,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311391080] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:51,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:51,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:23:51,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661046044] [2024-06-04 17:23:51,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:51,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:23:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:51,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:23:51,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:23:51,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:23:51,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 212 transitions, 2073 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:51,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:51,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:23:51,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:51,717 INFO L124 PetriNetUnfolderBase]: 531/972 cut-off events. [2024-06-04 17:23:51,717 INFO L125 PetriNetUnfolderBase]: For 50106/50106 co-relation queries the response was YES. [2024-06-04 17:23:51,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6843 conditions, 972 events. 531/972 cut-off events. For 50106/50106 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4912 event pairs, 70 based on Foata normal form. 2/974 useless extension candidates. Maximal degree in co-relation 6747. Up to 583 conditions per place. [2024-06-04 17:23:51,725 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 141 selfloop transitions, 91 changer transitions 0/235 dead transitions. [2024-06-04 17:23:51,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 235 transitions, 2903 flow [2024-06-04 17:23:51,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:23:51,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:23:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-04 17:23:51,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 17:23:51,727 INFO L175 Difference]: Start difference. First operand has 215 places, 212 transitions, 2073 flow. Second operand 10 states and 136 transitions. [2024-06-04 17:23:51,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 235 transitions, 2903 flow [2024-06-04 17:23:51,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 235 transitions, 2757 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-04 17:23:51,796 INFO L231 Difference]: Finished difference. Result has 218 places, 218 transitions, 2238 flow [2024-06-04 17:23:51,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1927, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2238, PETRI_PLACES=218, PETRI_TRANSITIONS=218} [2024-06-04 17:23:51,796 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 185 predicate places. [2024-06-04 17:23:51,797 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 218 transitions, 2238 flow [2024-06-04 17:23:51,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:51,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:51,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:51,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 17:23:51,797 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:23:51,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:51,798 INFO L85 PathProgramCache]: Analyzing trace with hash 176771123, now seen corresponding path program 18 times [2024-06-04 17:23:51,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:51,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088282584] [2024-06-04 17:23:51,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:51,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:24:02,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:02,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088282584] [2024-06-04 17:24:02,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088282584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:02,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:02,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:24:02,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534141658] [2024-06-04 17:24:02,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:02,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:24:02,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:02,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:24:02,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:24:02,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:24:02,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 218 transitions, 2238 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:02,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:02,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:24:02,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:03,272 INFO L124 PetriNetUnfolderBase]: 537/984 cut-off events. [2024-06-04 17:24:03,273 INFO L125 PetriNetUnfolderBase]: For 52690/52690 co-relation queries the response was YES. [2024-06-04 17:24:03,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7067 conditions, 984 events. 537/984 cut-off events. For 52690/52690 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4975 event pairs, 70 based on Foata normal form. 2/986 useless extension candidates. Maximal degree in co-relation 6970. Up to 589 conditions per place. [2024-06-04 17:24:03,281 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 142 selfloop transitions, 92 changer transitions 0/237 dead transitions. [2024-06-04 17:24:03,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 237 transitions, 3000 flow [2024-06-04 17:24:03,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:24:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:24:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-04 17:24:03,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40294117647058825 [2024-06-04 17:24:03,282 INFO L175 Difference]: Start difference. First operand has 218 places, 218 transitions, 2238 flow. Second operand 10 states and 137 transitions. [2024-06-04 17:24:03,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 237 transitions, 3000 flow [2024-06-04 17:24:03,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 237 transitions, 2791 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-04 17:24:03,359 INFO L231 Difference]: Finished difference. Result has 222 places, 220 transitions, 2262 flow [2024-06-04 17:24:03,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2262, PETRI_PLACES=222, PETRI_TRANSITIONS=220} [2024-06-04 17:24:03,359 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 189 predicate places. [2024-06-04 17:24:03,360 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 220 transitions, 2262 flow [2024-06-04 17:24:03,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:03,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:03,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:03,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 17:24:03,360 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:24:03,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:03,360 INFO L85 PathProgramCache]: Analyzing trace with hash 176780051, now seen corresponding path program 3 times [2024-06-04 17:24:03,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:03,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887639330] [2024-06-04 17:24:03,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:03,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:24:14,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:14,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887639330] [2024-06-04 17:24:14,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887639330] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:14,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:14,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:24:14,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321256806] [2024-06-04 17:24:14,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:14,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:24:14,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:14,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:24:14,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:24:14,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:24:14,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 220 transitions, 2262 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:14,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:14,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:24:14,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:14,822 INFO L124 PetriNetUnfolderBase]: 511/953 cut-off events. [2024-06-04 17:24:14,822 INFO L125 PetriNetUnfolderBase]: For 53325/53326 co-relation queries the response was YES. [2024-06-04 17:24:14,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6867 conditions, 953 events. 511/953 cut-off events. For 53325/53326 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4909 event pairs, 122 based on Foata normal form. 2/951 useless extension candidates. Maximal degree in co-relation 6769. Up to 746 conditions per place. [2024-06-04 17:24:14,830 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 163 selfloop transitions, 38 changer transitions 0/236 dead transitions. [2024-06-04 17:24:14,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 236 transitions, 2840 flow [2024-06-04 17:24:14,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:24:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:24:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-04 17:24:14,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40294117647058825 [2024-06-04 17:24:14,832 INFO L175 Difference]: Start difference. First operand has 222 places, 220 transitions, 2262 flow. Second operand 10 states and 137 transitions. [2024-06-04 17:24:14,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 236 transitions, 2840 flow [2024-06-04 17:24:14,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 236 transitions, 2639 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 17:24:14,916 INFO L231 Difference]: Finished difference. Result has 225 places, 224 transitions, 2194 flow [2024-06-04 17:24:14,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2061, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2194, PETRI_PLACES=225, PETRI_TRANSITIONS=224} [2024-06-04 17:24:14,917 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 192 predicate places. [2024-06-04 17:24:14,917 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 224 transitions, 2194 flow [2024-06-04 17:24:14,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:14,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:14,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:14,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 17:24:14,917 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:24:14,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1868531477, now seen corresponding path program 19 times [2024-06-04 17:24:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:14,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525930558] [2024-06-04 17:24:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:24:26,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:26,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525930558] [2024-06-04 17:24:26,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525930558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:26,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:26,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:24:26,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222982028] [2024-06-04 17:24:26,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:26,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:24:26,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:26,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:24:26,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:24:26,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:24:26,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 224 transitions, 2194 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:26,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:26,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:24:26,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:26,995 INFO L124 PetriNetUnfolderBase]: 536/982 cut-off events. [2024-06-04 17:24:26,995 INFO L125 PetriNetUnfolderBase]: For 53165/53165 co-relation queries the response was YES. [2024-06-04 17:24:27,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6822 conditions, 982 events. 536/982 cut-off events. For 53165/53165 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4969 event pairs, 70 based on Foata normal form. 2/984 useless extension candidates. Maximal degree in co-relation 6723. Up to 591 conditions per place. [2024-06-04 17:24:27,005 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 141 selfloop transitions, 95 changer transitions 0/239 dead transitions. [2024-06-04 17:24:27,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 239 transitions, 2814 flow [2024-06-04 17:24:27,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:24:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:24:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-04 17:24:27,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911764705882353 [2024-06-04 17:24:27,006 INFO L175 Difference]: Start difference. First operand has 225 places, 224 transitions, 2194 flow. Second operand 10 states and 133 transitions. [2024-06-04 17:24:27,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 239 transitions, 2814 flow [2024-06-04 17:24:27,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 239 transitions, 2729 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-04 17:24:27,089 INFO L231 Difference]: Finished difference. Result has 229 places, 224 transitions, 2304 flow [2024-06-04 17:24:27,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2304, PETRI_PLACES=229, PETRI_TRANSITIONS=224} [2024-06-04 17:24:27,089 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 196 predicate places. [2024-06-04 17:24:27,089 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 224 transitions, 2304 flow [2024-06-04 17:24:27,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:27,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:27,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:27,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 17:24:27,090 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:24:27,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:27,090 INFO L85 PathProgramCache]: Analyzing trace with hash 176779741, now seen corresponding path program 11 times [2024-06-04 17:24:27,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:27,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437130850] [2024-06-04 17:24:27,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:27,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:24:38,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:38,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437130850] [2024-06-04 17:24:38,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437130850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:38,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:38,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:24:38,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667239633] [2024-06-04 17:24:38,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:38,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:24:38,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:38,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:24:38,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:24:38,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:24:38,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 224 transitions, 2304 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:38,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:38,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:24:38,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:38,631 INFO L124 PetriNetUnfolderBase]: 544/995 cut-off events. [2024-06-04 17:24:38,631 INFO L125 PetriNetUnfolderBase]: For 55484/55484 co-relation queries the response was YES. [2024-06-04 17:24:38,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7164 conditions, 995 events. 544/995 cut-off events. For 55484/55484 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5024 event pairs, 106 based on Foata normal form. 1/996 useless extension candidates. Maximal degree in co-relation 7063. Up to 765 conditions per place. [2024-06-04 17:24:38,640 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 167 selfloop transitions, 71 changer transitions 0/241 dead transitions. [2024-06-04 17:24:38,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 241 transitions, 3070 flow [2024-06-04 17:24:38,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:24:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:24:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-04 17:24:38,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38823529411764707 [2024-06-04 17:24:38,642 INFO L175 Difference]: Start difference. First operand has 229 places, 224 transitions, 2304 flow. Second operand 10 states and 132 transitions. [2024-06-04 17:24:38,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 241 transitions, 3070 flow [2024-06-04 17:24:38,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 241 transitions, 2885 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-04 17:24:38,732 INFO L231 Difference]: Finished difference. Result has 231 places, 228 transitions, 2318 flow [2024-06-04 17:24:38,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2119, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2318, PETRI_PLACES=231, PETRI_TRANSITIONS=228} [2024-06-04 17:24:38,733 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 198 predicate places. [2024-06-04 17:24:38,733 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 228 transitions, 2318 flow [2024-06-04 17:24:38,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:38,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:38,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:38,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 17:24:38,734 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:24:38,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:38,734 INFO L85 PathProgramCache]: Analyzing trace with hash 176771371, now seen corresponding path program 12 times [2024-06-04 17:24:38,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:38,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120947486] [2024-06-04 17:24:38,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:38,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:24:49,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:49,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120947486] [2024-06-04 17:24:49,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120947486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:49,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:49,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:24:49,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161228674] [2024-06-04 17:24:49,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:49,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:24:49,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:49,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:24:49,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:24:49,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:24:49,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 228 transitions, 2318 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:49,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:49,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:24:49,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:49,922 INFO L124 PetriNetUnfolderBase]: 542/992 cut-off events. [2024-06-04 17:24:49,922 INFO L125 PetriNetUnfolderBase]: For 55932/55932 co-relation queries the response was YES. [2024-06-04 17:24:49,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7044 conditions, 992 events. 542/992 cut-off events. For 55932/55932 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5004 event pairs, 106 based on Foata normal form. 1/993 useless extension candidates. Maximal degree in co-relation 6942. Up to 763 conditions per place. [2024-06-04 17:24:49,931 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 167 selfloop transitions, 70 changer transitions 0/240 dead transitions. [2024-06-04 17:24:49,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 240 transitions, 2926 flow [2024-06-04 17:24:49,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:24:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:24:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-04 17:24:49,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38823529411764707 [2024-06-04 17:24:49,933 INFO L175 Difference]: Start difference. First operand has 231 places, 228 transitions, 2318 flow. Second operand 10 states and 132 transitions. [2024-06-04 17:24:49,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 240 transitions, 2926 flow [2024-06-04 17:24:50,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 240 transitions, 2771 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-04 17:24:50,027 INFO L231 Difference]: Finished difference. Result has 235 places, 228 transitions, 2308 flow [2024-06-04 17:24:50,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2163, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2308, PETRI_PLACES=235, PETRI_TRANSITIONS=228} [2024-06-04 17:24:50,028 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 202 predicate places. [2024-06-04 17:24:50,028 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 228 transitions, 2308 flow [2024-06-04 17:24:50,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:50,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:50,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:50,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 17:24:50,029 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:24:50,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:50,029 INFO L85 PathProgramCache]: Analyzing trace with hash 471998941, now seen corresponding path program 13 times [2024-06-04 17:24:50,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:50,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337773913] [2024-06-04 17:24:50,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:50,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15