./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.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.oepc.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.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix031.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 21:42:36,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 21:42:37,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 21:42:37,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 21:42:37,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 21:42:37,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 21:42:37,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 21:42:37,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 21:42:37,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 21:42:37,073 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 21:42:37,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 21:42:37,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 21:42:37,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 21:42:37,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 21:42:37,075 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 21:42:37,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 21:42:37,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 21:42:37,084 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 21:42:37,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 21:42:37,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 21:42:37,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 21:42:37,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 21:42:37,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 21:42:37,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 21:42:37,087 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 21:42:37,087 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 21:42:37,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 21:42:37,087 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 21:42:37,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 21:42:37,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 21:42:37,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 21:42:37,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 21:42:37,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:42:37,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 21:42:37,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 21:42:37,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 21:42:37,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 21:42:37,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 21:42:37,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 21:42:37,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 21:42:37,090 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 21:42:37,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 21:42:37,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 21:42:37,091 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-03 21:42:37,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 21:42:37,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 21:42:37,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 21:42:37,297 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 21:42:37,298 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 21:42:37,299 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.oepc.yml/witness.yml [2024-06-03 21:42:37,501 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 21:42:37,501 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 21:42:37,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2024-06-03 21:42:38,966 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 21:42:39,235 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 21:42:39,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2024-06-03 21:42:39,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7917baa28/a4c18b29915042fe970b3f7c4b3ce157/FLAGb952b99f3 [2024-06-03 21:42:39,258 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7917baa28/a4c18b29915042fe970b3f7c4b3ce157 [2024-06-03 21:42:39,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 21:42:39,259 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 21:42:39,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 21:42:39,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 21:42:39,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 21:42:39,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:42:37" (1/2) ... [2024-06-03 21:42:39,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f31aa9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:42:39, skipping insertion in model container [2024-06-03 21:42:39,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:42:37" (1/2) ... [2024-06-03 21:42:39,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@12eadcd9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:42:39, skipping insertion in model container [2024-06-03 21:42:39,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:42:39" (2/2) ... [2024-06-03 21:42:39,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f31aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:42:39, skipping insertion in model container [2024-06-03 21:42:39,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:42:39" (2/2) ... [2024-06-03 21:42:39,273 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 21:42:39,328 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 21:42:39,330 INFO L97 edCorrectnessWitness]: Location invariant before [L831-L831] (((((((((((((((((((! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 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 )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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 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 )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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff1 >= 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 )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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff1 >= 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 )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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff1 >= 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 )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 )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 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 )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (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 )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 )z >= 0LL) && (long long )y + (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 )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 )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$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)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 21:42:39,330 INFO L97 edCorrectnessWitness]: Location invariant before [L830-L830] (((((((((((((((((((! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 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 )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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 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 )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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff1 >= 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 )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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff1 >= 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 )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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff1 >= 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 )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 )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 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 )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (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 )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 )z >= 0LL) && (long long )y + (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 )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 )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$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)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 21:42:39,331 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 21:42:39,331 INFO L106 edCorrectnessWitness]: ghost_update [L828-L828] multithreaded = 1; [2024-06-03 21:42:39,369 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 21:42:39,666 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:42:39,679 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 21:42:39,931 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:42:39,965 INFO L206 MainTranslator]: Completed translation [2024-06-03 21:42:39,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:42:39 WrapperNode [2024-06-03 21:42:39,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 21:42:39,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 21:42:39,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 21:42:39,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 21:42:39,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:42:39" (1/1) ... [2024-06-03 21:42:40,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:42:39" (1/1) ... [2024-06-03 21:42:40,079 INFO L138 Inliner]: procedures = 174, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 123 [2024-06-03 21:42:40,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 21:42:40,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 21:42:40,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 21:42:40,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 21:42:40,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:42:39" (1/1) ... [2024-06-03 21:42:40,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:42:39" (1/1) ... [2024-06-03 21:42:40,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:42:39" (1/1) ... [2024-06-03 21:42:40,120 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-03 21:42:40,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:42:39" (1/1) ... [2024-06-03 21:42:40,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:42:39" (1/1) ... [2024-06-03 21:42:40,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:42:39" (1/1) ... [2024-06-03 21:42:40,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:42:39" (1/1) ... [2024-06-03 21:42:40,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:42:39" (1/1) ... [2024-06-03 21:42:40,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:42:39" (1/1) ... [2024-06-03 21:42:40,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 21:42:40,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 21:42:40,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 21:42:40,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 21:42:40,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:42:39" (1/1) ... [2024-06-03 21:42:40,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:42:40,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:42:40,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-03 21:42:40,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-03 21:42:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 21:42:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 21:42:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 21:42:40,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 21:42:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 21:42:40,211 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 21:42:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 21:42:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 21:42:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 21:42:40,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 21:42:40,212 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 21:42:40,342 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 21:42:40,344 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 21:42:41,267 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 21:42:41,267 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 21:42:41,463 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 21:42:41,463 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 21:42:41,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:42:41 BoogieIcfgContainer [2024-06-03 21:42:41,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 21:42:41,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 21:42:41,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 21:42:41,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 21:42:41,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:42:37" (1/4) ... [2024-06-03 21:42:41,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24644356 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:42:41, skipping insertion in model container [2024-06-03 21:42:41,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 09:42:39" (2/4) ... [2024-06-03 21:42:41,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24644356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:42:41, skipping insertion in model container [2024-06-03 21:42:41,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:42:39" (3/4) ... [2024-06-03 21:42:41,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24644356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:42:41, skipping insertion in model container [2024-06-03 21:42:41,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:42:41" (4/4) ... [2024-06-03 21:42:41,473 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2024-06-03 21:42:41,486 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 21:42:41,487 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 21:42:41,487 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 21:42:41,557 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 21:42:41,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 76 flow [2024-06-03 21:42:41,623 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2024-06-03 21:42:41,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:42:41,625 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 47 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-03 21:42:41,625 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 34 transitions, 76 flow [2024-06-03 21:42:41,627 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 58 flow [2024-06-03 21:42:41,638 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 21:42:41,645 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;@79c12e45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 21:42:41,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 21:42:41,651 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 21:42:41,651 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-03 21:42:41,651 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:42:41,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:42:41,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 21:42:41,652 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:42:41,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:42:41,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1966790300, now seen corresponding path program 1 times [2024-06-03 21:42:41,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:42:41,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841484993] [2024-06-03 21:42:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:42:41,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:42:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:42:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:42:46,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:42:46,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841484993] [2024-06-03 21:42:46,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841484993] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:42:46,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:42:46,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 21:42:46,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342721451] [2024-06-03 21:42:46,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:42:46,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 21:42:46,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:42:46,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 21:42:46,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 21:42:46,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-06-03 21:42:46,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:42:46,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:42:46,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-06-03 21:42:46,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:42:46,804 INFO L124 PetriNetUnfolderBase]: 189/360 cut-off events. [2024-06-03 21:42:46,804 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-03 21:42:46,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 360 events. 189/360 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1418 event pairs, 115 based on Foata normal form. 1/348 useless extension candidates. Maximal degree in co-relation 704. Up to 333 conditions per place. [2024-06-03 21:42:46,809 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 24 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2024-06-03 21:42:46,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 127 flow [2024-06-03 21:42:46,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 21:42:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 21:42:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-06-03 21:42:46,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2024-06-03 21:42:46,820 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 58 flow. Second operand 3 states and 59 transitions. [2024-06-03 21:42:46,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 127 flow [2024-06-03 21:42:46,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 21:42:46,824 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 77 flow [2024-06-03 21:42:46,825 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-03 21:42:46,828 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2024-06-03 21:42:46,829 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 77 flow [2024-06-03 21:42:46,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:42:46,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:42:46,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:42:46,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 21:42:46,830 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:42:46,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:42:46,830 INFO L85 PathProgramCache]: Analyzing trace with hash 299908411, now seen corresponding path program 1 times [2024-06-03 21:42:46,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:42:46,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361739655] [2024-06-03 21:42:46,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:42:46,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:42:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:42:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:42:50,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:42:50,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361739655] [2024-06-03 21:42:50,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361739655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:42:50,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:42:50,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 21:42:50,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59203135] [2024-06-03 21:42:50,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:42:50,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 21:42:50,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:42:50,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 21:42:50,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 21:42:50,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-06-03 21:42:50,822 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-03 21:42:50,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:42:50,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-06-03 21:42:50,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:42:51,128 INFO L124 PetriNetUnfolderBase]: 186/355 cut-off events. [2024-06-03 21:42:51,128 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-06-03 21:42:51,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 355 events. 186/355 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1411 event pairs, 94 based on Foata normal form. 2/349 useless extension candidates. Maximal degree in co-relation 784. Up to 319 conditions per place. [2024-06-03 21:42:51,131 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 28 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2024-06-03 21:42:51,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 169 flow [2024-06-03 21:42:51,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 21:42:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 21:42:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2024-06-03 21:42:51,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5514705882352942 [2024-06-03 21:42:51,133 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 77 flow. Second operand 4 states and 75 transitions. [2024-06-03 21:42:51,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 169 flow [2024-06-03 21:42:51,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 21:42:51,135 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2024-06-03 21:42:51,135 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-03 21:42:51,136 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2024-06-03 21:42:51,136 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2024-06-03 21:42:51,136 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-03 21:42:51,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:42:51,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:42:51,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 21:42:51,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:42:51,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:42:51,137 INFO L85 PathProgramCache]: Analyzing trace with hash 707227471, now seen corresponding path program 1 times [2024-06-03 21:42:51,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:42:51,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279519162] [2024-06-03 21:42:51,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:42:51,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:42:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:42:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:42:55,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:42:55,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279519162] [2024-06-03 21:42:55,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279519162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:42:55,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:42:55,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 21:42:55,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759392279] [2024-06-03 21:42:55,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:42:55,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 21:42:55,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:42:55,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 21:42:55,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 21:42:55,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-06-03 21:42:55,155 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-03 21:42:55,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:42:55,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-06-03 21:42:55,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:42:55,476 INFO L124 PetriNetUnfolderBase]: 219/413 cut-off events. [2024-06-03 21:42:55,476 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2024-06-03 21:42:55,478 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 1636 event pairs, 99 based on Foata normal form. 2/412 useless extension candidates. Maximal degree in co-relation 1004. Up to 366 conditions per place. [2024-06-03 21:42:55,480 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 33 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2024-06-03 21:42:55,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 219 flow [2024-06-03 21:42:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:42:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:42:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-06-03 21:42:55,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117647058823529 [2024-06-03 21:42:55,482 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 5 states and 87 transitions. [2024-06-03 21:42:55,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 219 flow [2024-06-03 21:42:55,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 210 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 21:42:55,483 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 125 flow [2024-06-03 21:42:55,484 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-03 21:42:55,484 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2024-06-03 21:42:55,484 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 125 flow [2024-06-03 21:42:55,485 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-03 21:42:55,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:42:55,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:42:55,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 21:42:55,485 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:42:55,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:42:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash 449216474, now seen corresponding path program 1 times [2024-06-03 21:42:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:42:55,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114378648] [2024-06-03 21:42:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:42:55,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:42:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:42:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:42:59,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:42:59,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114378648] [2024-06-03 21:42:59,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114378648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:42:59,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:42:59,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:42:59,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389788828] [2024-06-03 21:42:59,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:42:59,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:42:59,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:42:59,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:42:59,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:42:59,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-06-03 21:42:59,235 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-03 21:42:59,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:42:59,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-06-03 21:42:59,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:42:59,497 INFO L124 PetriNetUnfolderBase]: 216/410 cut-off events. [2024-06-03 21:42:59,498 INFO L125 PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES. [2024-06-03 21:42:59,499 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 1612 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-03 21:42:59,501 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 37 selfloop transitions, 9 changer transitions 0/50 dead transitions. [2024-06-03 21:42:59,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 267 flow [2024-06-03 21:42:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:42:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:42:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-03 21:42:59,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-03 21:42:59,503 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 125 flow. Second operand 6 states and 102 transitions. [2024-06-03 21:42:59,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 267 flow [2024-06-03 21:42:59,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 252 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 21:42:59,506 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 149 flow [2024-06-03 21:42:59,506 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-03 21:42:59,506 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2024-06-03 21:42:59,506 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 149 flow [2024-06-03 21:42:59,507 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-03 21:42:59,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:42:59,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:42:59,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 21:42:59,507 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:42:59,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:42:59,508 INFO L85 PathProgramCache]: Analyzing trace with hash 198722588, now seen corresponding path program 1 times [2024-06-03 21:42:59,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:42:59,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329453957] [2024-06-03 21:42:59,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:42:59,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:42:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:43:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:43:08,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:43:08,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329453957] [2024-06-03 21:43:08,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329453957] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:43:08,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:43:08,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:43:08,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408630091] [2024-06-03 21:43:08,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:43:08,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:43:08,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:43:08,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:43:08,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:43:08,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-03 21:43:08,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:43:08,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:43:08,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-03 21:43:08,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:43:08,651 INFO L124 PetriNetUnfolderBase]: 230/443 cut-off events. [2024-06-03 21:43:08,651 INFO L125 PetriNetUnfolderBase]: For 629/629 co-relation queries the response was YES. [2024-06-03 21:43:08,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 443 events. 230/443 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1732 event pairs, 100 based on Foata normal form. 1/444 useless extension candidates. Maximal degree in co-relation 1249. Up to 402 conditions per place. [2024-06-03 21:43:08,654 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 30 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2024-06-03 21:43:08,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 239 flow [2024-06-03 21:43:08,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:43:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:43:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2024-06-03 21:43:08,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4235294117647059 [2024-06-03 21:43:08,656 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 149 flow. Second operand 5 states and 72 transitions. [2024-06-03 21:43:08,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 239 flow [2024-06-03 21:43:08,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 218 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 21:43:08,658 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 155 flow [2024-06-03 21:43:08,658 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2024-06-03 21:43:08,659 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2024-06-03 21:43:08,659 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 155 flow [2024-06-03 21:43:08,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:43:08,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:43:08,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:43:08,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 21:43:08,660 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:43:08,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:43:08,660 INFO L85 PathProgramCache]: Analyzing trace with hash -420875807, now seen corresponding path program 1 times [2024-06-03 21:43:08,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:43:08,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425645781] [2024-06-03 21:43:08,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:43:08,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:43:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:43:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:43:13,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:43:13,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425645781] [2024-06-03 21:43:13,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425645781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:43:13,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:43:13,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:43:13,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541280337] [2024-06-03 21:43:13,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:43:13,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:43:13,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:43:13,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:43:13,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:43:13,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-03 21:43:13,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 155 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:43:13,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:43:13,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-03 21:43:13,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:43:13,701 INFO L124 PetriNetUnfolderBase]: 244/454 cut-off events. [2024-06-03 21:43:13,701 INFO L125 PetriNetUnfolderBase]: For 839/839 co-relation queries the response was YES. [2024-06-03 21:43:13,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 454 events. 244/454 cut-off events. For 839/839 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1735 event pairs, 61 based on Foata normal form. 2/456 useless extension candidates. Maximal degree in co-relation 1348. Up to 382 conditions per place. [2024-06-03 21:43:13,706 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 48 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2024-06-03 21:43:13,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 355 flow [2024-06-03 21:43:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:43:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:43:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-03 21:43:13,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45955882352941174 [2024-06-03 21:43:13,709 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 155 flow. Second operand 8 states and 125 transitions. [2024-06-03 21:43:13,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 355 flow [2024-06-03 21:43:13,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 344 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 21:43:13,714 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 204 flow [2024-06-03 21:43:13,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=204, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-06-03 21:43:13,717 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2024-06-03 21:43:13,717 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 204 flow [2024-06-03 21:43:13,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:43:13,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:43:13,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:43:13,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 21:43:13,718 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:43:13,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:43:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1846665422, now seen corresponding path program 1 times [2024-06-03 21:43:13,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:43:13,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591403975] [2024-06-03 21:43:13,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:43:13,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:43:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:43:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:43:23,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:43:23,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591403975] [2024-06-03 21:43:23,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591403975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:43:23,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:43:23,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:43:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552088025] [2024-06-03 21:43:23,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:43:23,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:43:23,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:43:23,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:43:23,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:43:23,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:43:23,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 204 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:43:23,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:43:23,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:43:23,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:43:23,966 INFO L124 PetriNetUnfolderBase]: 258/473 cut-off events. [2024-06-03 21:43:23,966 INFO L125 PetriNetUnfolderBase]: For 1313/1313 co-relation queries the response was YES. [2024-06-03 21:43:23,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 473 events. 258/473 cut-off events. For 1313/1313 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1789 event pairs, 71 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 1575. Up to 449 conditions per place. [2024-06-03 21:43:23,969 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 36 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2024-06-03 21:43:23,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 314 flow [2024-06-03 21:43:23,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:43:23,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:43:23,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-06-03 21:43:23,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-03 21:43:23,970 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 204 flow. Second operand 6 states and 78 transitions. [2024-06-03 21:43:23,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 314 flow [2024-06-03 21:43:23,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 285 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 21:43:23,972 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 208 flow [2024-06-03 21:43:23,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=175, 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=208, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-03 21:43:23,973 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2024-06-03 21:43:23,973 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 208 flow [2024-06-03 21:43:23,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:43:23,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:43:23,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:43:23,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 21:43:23,974 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:43:23,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:43:23,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1993595485, now seen corresponding path program 1 times [2024-06-03 21:43:23,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:43:23,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784736788] [2024-06-03 21:43:23,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:43:23,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:43:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:43:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:43:31,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:43:31,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784736788] [2024-06-03 21:43:31,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784736788] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:43:31,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:43:31,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:43:31,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734505015] [2024-06-03 21:43:31,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:43:31,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:43:31,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:43:31,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:43:31,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:43:31,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-03 21:43:31,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:43:31,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:43:31,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-03 21:43:31,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:43:31,887 INFO L124 PetriNetUnfolderBase]: 244/461 cut-off events. [2024-06-03 21:43:31,887 INFO L125 PetriNetUnfolderBase]: For 1717/1717 co-relation queries the response was YES. [2024-06-03 21:43:31,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1619 conditions, 461 events. 244/461 cut-off events. For 1717/1717 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1777 event pairs, 68 based on Foata normal form. 1/462 useless extension candidates. Maximal degree in co-relation 1595. Up to 399 conditions per place. [2024-06-03 21:43:31,890 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 39 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2024-06-03 21:43:31,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 362 flow [2024-06-03 21:43:31,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:43:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:43:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2024-06-03 21:43:31,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4362745098039216 [2024-06-03 21:43:31,893 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 208 flow. Second operand 6 states and 89 transitions. [2024-06-03 21:43:31,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 362 flow [2024-06-03 21:43:31,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 345 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 21:43:31,896 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 238 flow [2024-06-03 21:43:31,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-03 21:43:31,901 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2024-06-03 21:43:31,902 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 238 flow [2024-06-03 21:43:31,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:43:31,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:43:31,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:43:31,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 21:43:31,903 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-03 21:43:31,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:43:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash -162246683, now seen corresponding path program 1 times [2024-06-03 21:43:31,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:43:31,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988084692] [2024-06-03 21:43:31,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:43:31,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:43:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:43:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:43:36,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:43:36,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988084692] [2024-06-03 21:43:36,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988084692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:43:36,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:43:36,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:43:36,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041345217] [2024-06-03 21:43:36,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:43:36,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:43:36,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:43:36,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:43:36,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:43:36,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-03 21:43:36,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 238 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:43:36,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:43:36,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-03 21:43:36,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:43:37,357 INFO L124 PetriNetUnfolderBase]: 258/471 cut-off events. [2024-06-03 21:43:37,357 INFO L125 PetriNetUnfolderBase]: For 2159/2159 co-relation queries the response was YES. [2024-06-03 21:43:37,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 471 events. 258/471 cut-off events. For 2159/2159 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1748 event pairs, 45 based on Foata normal form. 4/475 useless extension candidates. Maximal degree in co-relation 1708. Up to 376 conditions per place. [2024-06-03 21:43:37,360 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 53 selfloop transitions, 14 changer transitions 0/71 dead transitions. [2024-06-03 21:43:37,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 424 flow [2024-06-03 21:43:37,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:43:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:43:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2024-06-03 21:43:37,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43790849673202614 [2024-06-03 21:43:37,362 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 238 flow. Second operand 9 states and 134 transitions. [2024-06-03 21:43:37,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 424 flow [2024-06-03 21:43:37,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 414 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-03 21:43:37,365 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 248 flow [2024-06-03 21:43:37,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=248, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2024-06-03 21:43:37,365 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2024-06-03 21:43:37,365 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 248 flow [2024-06-03 21:43:37,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:43:37,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:43:37,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:43:37,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 21:43:37,366 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:43:37,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:43:37,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1993862395, now seen corresponding path program 2 times [2024-06-03 21:43:37,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:43:37,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631213779] [2024-06-03 21:43:37,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:43:37,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:43:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:43:44,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-03 21:43:44,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:43:44,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631213779] [2024-06-03 21:43:44,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631213779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:43:44,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:43:44,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:43:44,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249432051] [2024-06-03 21:43:44,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:43:44,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:43:44,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:43:44,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:43:44,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:43:44,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-03 21:43:44,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:43:44,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:43:44,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-03 21:43:44,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:43:45,089 INFO L124 PetriNetUnfolderBase]: 239/451 cut-off events. [2024-06-03 21:43:45,090 INFO L125 PetriNetUnfolderBase]: For 2534/2534 co-relation queries the response was YES. [2024-06-03 21:43:45,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 451 events. 239/451 cut-off events. For 2534/2534 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1707 event pairs, 64 based on Foata normal form. 1/452 useless extension candidates. Maximal degree in co-relation 1729. Up to 402 conditions per place. [2024-06-03 21:43:45,094 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 37 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2024-06-03 21:43:45,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 51 transitions, 352 flow [2024-06-03 21:43:45,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:43:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:43:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2024-06-03 21:43:45,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4019607843137255 [2024-06-03 21:43:45,095 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 248 flow. Second operand 6 states and 82 transitions. [2024-06-03 21:43:45,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 51 transitions, 352 flow [2024-06-03 21:43:45,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 314 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-03 21:43:45,098 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 231 flow [2024-06-03 21:43:45,099 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=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2024-06-03 21:43:45,100 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2024-06-03 21:43:45,100 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 231 flow [2024-06-03 21:43:45,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:43:45,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:43:45,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:43:45,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 21:43:45,100 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:43:45,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:43:45,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1993872315, now seen corresponding path program 1 times [2024-06-03 21:43:45,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:43:45,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362786476] [2024-06-03 21:43:45,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:43:45,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:43:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:43:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:43:55,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:43:55,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362786476] [2024-06-03 21:43:55,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362786476] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:43:55,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:43:55,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:43:55,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301932947] [2024-06-03 21:43:55,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:43:55,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:43:55,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:43:55,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:43:55,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:43:55,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:43:55,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 231 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:43:55,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:43:55,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:43:55,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:43:55,765 INFO L124 PetriNetUnfolderBase]: 250/459 cut-off events. [2024-06-03 21:43:55,765 INFO L125 PetriNetUnfolderBase]: For 2935/2935 co-relation queries the response was YES. [2024-06-03 21:43:55,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 459 events. 250/459 cut-off events. For 2935/2935 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1683 event pairs, 63 based on Foata normal form. 3/462 useless extension candidates. Maximal degree in co-relation 1748. Up to 425 conditions per place. [2024-06-03 21:43:55,768 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 42 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2024-06-03 21:43:55,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 365 flow [2024-06-03 21:43:55,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:43:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:43:55,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-03 21:43:55,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3739495798319328 [2024-06-03 21:43:55,770 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 231 flow. Second operand 7 states and 89 transitions. [2024-06-03 21:43:55,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 365 flow [2024-06-03 21:43:55,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 56 transitions, 344 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-03 21:43:55,773 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 249 flow [2024-06-03 21:43:55,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=53, 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=249, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2024-06-03 21:43:55,774 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2024-06-03 21:43:55,774 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 249 flow [2024-06-03 21:43:55,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:43:55,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:43:55,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:43:55,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 21:43:55,775 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:43:55,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:43:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash 587341877, now seen corresponding path program 1 times [2024-06-03 21:43:55,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:43:55,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178737200] [2024-06-03 21:43:55,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:43:55,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:43:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:44:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:44:03,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:44:03,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178737200] [2024-06-03 21:44:03,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178737200] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:44:03,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:44:03,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:44:03,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964803973] [2024-06-03 21:44:03,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:44:03,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:44:03,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:44:03,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:44:03,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:44:03,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:44:03,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 249 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:44:03,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:44:03,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:44:03,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:44:03,897 INFO L124 PetriNetUnfolderBase]: 253/464 cut-off events. [2024-06-03 21:44:03,897 INFO L125 PetriNetUnfolderBase]: For 3391/3391 co-relation queries the response was YES. [2024-06-03 21:44:03,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1872 conditions, 464 events. 253/464 cut-off events. For 3391/3391 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1701 event pairs, 61 based on Foata normal form. 1/465 useless extension candidates. Maximal degree in co-relation 1843. Up to 396 conditions per place. [2024-06-03 21:44:03,901 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 45 selfloop transitions, 16 changer transitions 0/65 dead transitions. [2024-06-03 21:44:03,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 447 flow [2024-06-03 21:44:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:44:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:44:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-03 21:44:03,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40756302521008403 [2024-06-03 21:44:03,902 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 249 flow. Second operand 7 states and 97 transitions. [2024-06-03 21:44:03,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 447 flow [2024-06-03 21:44:03,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 424 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 21:44:03,911 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 287 flow [2024-06-03 21:44:03,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=287, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-06-03 21:44:03,912 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 29 predicate places. [2024-06-03 21:44:03,912 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 287 flow [2024-06-03 21:44:03,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:44:03,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:44:03,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:44:03,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 21:44:03,913 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:44:03,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:44:03,914 INFO L85 PathProgramCache]: Analyzing trace with hash 587521615, now seen corresponding path program 1 times [2024-06-03 21:44:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:44:03,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845218657] [2024-06-03 21:44:03,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:44:03,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:44:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:44:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:44:11,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:44:11,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845218657] [2024-06-03 21:44:11,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845218657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:44:11,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:44:11,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:44:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617527486] [2024-06-03 21:44:11,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:44:11,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:44:11,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:44:11,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:44:11,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:44:11,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:44:11,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 287 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:44:11,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:44:11,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:44:11,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:44:12,013 INFO L124 PetriNetUnfolderBase]: 260/473 cut-off events. [2024-06-03 21:44:12,013 INFO L125 PetriNetUnfolderBase]: For 3882/3882 co-relation queries the response was YES. [2024-06-03 21:44:12,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1977 conditions, 473 events. 260/473 cut-off events. For 3882/3882 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1727 event pairs, 63 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 1947. Up to 418 conditions per place. [2024-06-03 21:44:12,016 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 45 selfloop transitions, 15 changer transitions 0/66 dead transitions. [2024-06-03 21:44:12,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 66 transitions, 477 flow [2024-06-03 21:44:12,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:44:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:44:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-03 21:44:12,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39915966386554624 [2024-06-03 21:44:12,018 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 287 flow. Second operand 7 states and 95 transitions. [2024-06-03 21:44:12,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 66 transitions, 477 flow [2024-06-03 21:44:12,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 66 transitions, 456 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-03 21:44:12,021 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 325 flow [2024-06-03 21:44:12,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=325, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-06-03 21:44:12,022 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 33 predicate places. [2024-06-03 21:44:12,022 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 325 flow [2024-06-03 21:44:12,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:44:12,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:44:12,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:44:12,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 21:44:12,023 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:44:12,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:44:12,024 INFO L85 PathProgramCache]: Analyzing trace with hash 587521367, now seen corresponding path program 2 times [2024-06-03 21:44:12,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:44:12,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984944948] [2024-06-03 21:44:12,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:44:12,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:44:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:44:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:44:19,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:44:19,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984944948] [2024-06-03 21:44:19,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984944948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:44:19,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:44:19,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:44:19,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107523407] [2024-06-03 21:44:19,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:44:19,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:44:19,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:44:19,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:44:19,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:44:19,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:44:19,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 325 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:44:19,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:44:19,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:44:19,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:44:20,103 INFO L124 PetriNetUnfolderBase]: 261/476 cut-off events. [2024-06-03 21:44:20,103 INFO L125 PetriNetUnfolderBase]: For 4694/4694 co-relation queries the response was YES. [2024-06-03 21:44:20,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2105 conditions, 476 events. 261/476 cut-off events. For 4694/4694 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1748 event pairs, 60 based on Foata normal form. 1/477 useless extension candidates. Maximal degree in co-relation 2073. Up to 405 conditions per place. [2024-06-03 21:44:20,106 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 45 selfloop transitions, 17 changer transitions 0/68 dead transitions. [2024-06-03 21:44:20,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 513 flow [2024-06-03 21:44:20,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:44:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:44:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-03 21:44:20,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39915966386554624 [2024-06-03 21:44:20,107 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 325 flow. Second operand 7 states and 95 transitions. [2024-06-03 21:44:20,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 513 flow [2024-06-03 21:44:20,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 68 transitions, 497 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-03 21:44:20,111 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 360 flow [2024-06-03 21:44:20,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=360, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2024-06-03 21:44:20,113 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 37 predicate places. [2024-06-03 21:44:20,113 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 360 flow [2024-06-03 21:44:20,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:44:20,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:44:20,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:44:20,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 21:44:20,114 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:44:20,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:44:20,114 INFO L85 PathProgramCache]: Analyzing trace with hash -872308357, now seen corresponding path program 3 times [2024-06-03 21:44:20,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:44:20,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578531531] [2024-06-03 21:44:20,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:44:20,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:44:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:44:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:44:27,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:44:27,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578531531] [2024-06-03 21:44:27,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578531531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:44:27,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:44:27,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:44:27,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053813324] [2024-06-03 21:44:27,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:44:27,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:44:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:44:27,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:44:27,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:44:27,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:44:27,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 360 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:44:27,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:44:27,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:44:27,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:44:28,249 INFO L124 PetriNetUnfolderBase]: 259/473 cut-off events. [2024-06-03 21:44:28,250 INFO L125 PetriNetUnfolderBase]: For 5312/5312 co-relation queries the response was YES. [2024-06-03 21:44:28,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2165 conditions, 473 events. 259/473 cut-off events. For 5312/5312 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1733 event pairs, 59 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 2131. Up to 430 conditions per place. [2024-06-03 21:44:28,253 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 48 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2024-06-03 21:44:28,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 64 transitions, 492 flow [2024-06-03 21:44:28,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:44:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:44:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-03 21:44:28,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36554621848739494 [2024-06-03 21:44:28,254 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 360 flow. Second operand 7 states and 87 transitions. [2024-06-03 21:44:28,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 64 transitions, 492 flow [2024-06-03 21:44:28,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 463 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 21:44:28,258 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 356 flow [2024-06-03 21:44:28,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=356, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2024-06-03 21:44:28,259 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2024-06-03 21:44:28,259 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 356 flow [2024-06-03 21:44:28,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:44:28,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:44:28,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:44:28,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 21:44:28,260 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:44:28,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:44:28,260 INFO L85 PathProgramCache]: Analyzing trace with hash -891961799, now seen corresponding path program 2 times [2024-06-03 21:44:28,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:44:28,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674785271] [2024-06-03 21:44:28,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:44:28,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:44:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:44:35,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:44:35,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:44:35,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674785271] [2024-06-03 21:44:35,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674785271] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:44:35,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:44:35,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:44:35,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012828247] [2024-06-03 21:44:35,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:44:35,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:44:35,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:44:35,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:44:35,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:44:35,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:44:35,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 356 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:44:35,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:44:35,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:44:35,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:44:36,184 INFO L124 PetriNetUnfolderBase]: 264/480 cut-off events. [2024-06-03 21:44:36,184 INFO L125 PetriNetUnfolderBase]: For 5908/5908 co-relation queries the response was YES. [2024-06-03 21:44:36,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 480 events. 264/480 cut-off events. For 5908/5908 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1762 event pairs, 61 based on Foata normal form. 1/481 useless extension candidates. Maximal degree in co-relation 2186. Up to 445 conditions per place. [2024-06-03 21:44:36,187 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 49 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2024-06-03 21:44:36,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 66 transitions, 504 flow [2024-06-03 21:44:36,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:44:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:44:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-03 21:44:36,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36554621848739494 [2024-06-03 21:44:36,189 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 356 flow. Second operand 7 states and 87 transitions. [2024-06-03 21:44:36,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 66 transitions, 504 flow [2024-06-03 21:44:36,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 468 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-03 21:44:36,194 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 363 flow [2024-06-03 21:44:36,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=363, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2024-06-03 21:44:36,194 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2024-06-03 21:44:36,194 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 363 flow [2024-06-03 21:44:36,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:44:36,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:44:36,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:44:36,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 21:44:36,195 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:44:36,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:44:36,196 INFO L85 PathProgramCache]: Analyzing trace with hash -891970169, now seen corresponding path program 3 times [2024-06-03 21:44:36,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:44:36,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955660103] [2024-06-03 21:44:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:44:36,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:44:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:44:43,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-03 21:44:43,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:44:43,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955660103] [2024-06-03 21:44:43,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955660103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:44:43,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:44:43,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:44:43,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106346037] [2024-06-03 21:44:43,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:44:43,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:44:43,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:44:43,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:44:43,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:44:43,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:44:43,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 363 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:44:43,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:44:43,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:44:43,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:44:44,355 INFO L124 PetriNetUnfolderBase]: 262/477 cut-off events. [2024-06-03 21:44:44,355 INFO L125 PetriNetUnfolderBase]: For 6550/6550 co-relation queries the response was YES. [2024-06-03 21:44:44,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 477 events. 262/477 cut-off events. For 6550/6550 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1755 event pairs, 61 based on Foata normal form. 1/478 useless extension candidates. Maximal degree in co-relation 2200. Up to 436 conditions per place. [2024-06-03 21:44:44,359 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 46 selfloop transitions, 13 changer transitions 0/66 dead transitions. [2024-06-03 21:44:44,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 66 transitions, 497 flow [2024-06-03 21:44:44,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:44:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:44:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-03 21:44:44,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3739495798319328 [2024-06-03 21:44:44,360 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 363 flow. Second operand 7 states and 89 transitions. [2024-06-03 21:44:44,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 66 transitions, 497 flow [2024-06-03 21:44:44,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 66 transitions, 472 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 21:44:44,365 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 369 flow [2024-06-03 21:44:44,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2024-06-03 21:44:44,365 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 42 predicate places. [2024-06-03 21:44:44,365 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 369 flow [2024-06-03 21:44:44,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:44:44,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:44:44,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:44:44,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 21:44:44,366 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:44:44,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:44:44,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1350389632, now seen corresponding path program 1 times [2024-06-03 21:44:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:44:44,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098571333] [2024-06-03 21:44:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:44:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:44:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:44:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:44:51,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:44:51,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098571333] [2024-06-03 21:44:51,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098571333] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:44:51,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:44:51,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:44:51,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063428488] [2024-06-03 21:44:51,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:44:51,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:44:51,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:44:51,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:44:51,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:44:51,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-03 21:44:51,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 369 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-03 21:44:51,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:44:51,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-03 21:44:51,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:44:52,262 INFO L124 PetriNetUnfolderBase]: 263/480 cut-off events. [2024-06-03 21:44:52,262 INFO L125 PetriNetUnfolderBase]: For 7521/7521 co-relation queries the response was YES. [2024-06-03 21:44:52,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2310 conditions, 480 events. 263/480 cut-off events. For 7521/7521 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1773 event pairs, 59 based on Foata normal form. 1/481 useless extension candidates. Maximal degree in co-relation 2273. Up to 389 conditions per place. [2024-06-03 21:44:52,265 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 51 selfloop transitions, 23 changer transitions 0/81 dead transitions. [2024-06-03 21:44:52,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 619 flow [2024-06-03 21:44:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:44:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:44:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2024-06-03 21:44:52,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-03 21:44:52,267 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 369 flow. Second operand 8 states and 119 transitions. [2024-06-03 21:44:52,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 619 flow [2024-06-03 21:44:52,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 81 transitions, 578 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 21:44:52,272 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 407 flow [2024-06-03 21:44:52,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=407, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2024-06-03 21:44:52,272 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 44 predicate places. [2024-06-03 21:44:52,273 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 407 flow [2024-06-03 21:44:52,273 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-03 21:44:52,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:44:52,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:44:52,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 21:44:52,273 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:44:52,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:44:52,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1350539579, now seen corresponding path program 1 times [2024-06-03 21:44:52,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:44:52,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809494766] [2024-06-03 21:44:52,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:44:52,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:44:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:45:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:45:00,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:45:00,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809494766] [2024-06-03 21:45:00,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809494766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:45:00,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:45:00,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:45:00,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103376712] [2024-06-03 21:45:00,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:45:00,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:45:00,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:45:00,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:45:00,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:45:00,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:45:00,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 407 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:45:00,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:45:00,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:45:00,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:45:00,678 INFO L124 PetriNetUnfolderBase]: 284/503 cut-off events. [2024-06-03 21:45:00,678 INFO L125 PetriNetUnfolderBase]: For 8311/8311 co-relation queries the response was YES. [2024-06-03 21:45:00,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2499 conditions, 503 events. 284/503 cut-off events. For 8311/8311 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1825 event pairs, 61 based on Foata normal form. 1/504 useless extension candidates. Maximal degree in co-relation 2461. Up to 431 conditions per place. [2024-06-03 21:45:00,681 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 55 selfloop transitions, 25 changer transitions 0/82 dead transitions. [2024-06-03 21:45:00,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 663 flow [2024-06-03 21:45:00,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:45:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:45:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-03 21:45:00,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3786764705882353 [2024-06-03 21:45:00,684 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 407 flow. Second operand 8 states and 103 transitions. [2024-06-03 21:45:00,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 663 flow [2024-06-03 21:45:00,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 82 transitions, 626 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-03 21:45:00,689 INFO L231 Difference]: Finished difference. Result has 81 places, 67 transitions, 453 flow [2024-06-03 21:45:00,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=453, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2024-06-03 21:45:00,690 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 48 predicate places. [2024-06-03 21:45:00,690 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 453 flow [2024-06-03 21:45:00,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:45:00,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:45:00,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:45:00,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 21:45:00,691 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:45:00,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:45:00,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1350539362, now seen corresponding path program 2 times [2024-06-03 21:45:00,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:45:00,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982229743] [2024-06-03 21:45:00,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:45:00,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:45:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:45:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:45:08,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:45:08,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982229743] [2024-06-03 21:45:08,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982229743] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:45:08,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:45:08,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:45:08,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753519484] [2024-06-03 21:45:08,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:45:08,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:45:08,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:45:08,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:45:08,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:45:08,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-03 21:45:08,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 67 transitions, 453 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-03 21:45:08,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:45:08,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-03 21:45:08,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:45:08,647 INFO L124 PetriNetUnfolderBase]: 271/492 cut-off events. [2024-06-03 21:45:08,648 INFO L125 PetriNetUnfolderBase]: For 9387/9387 co-relation queries the response was YES. [2024-06-03 21:45:08,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2544 conditions, 492 events. 271/492 cut-off events. For 9387/9387 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1818 event pairs, 58 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 2504. Up to 398 conditions per place. [2024-06-03 21:45:08,651 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 52 selfloop transitions, 23 changer transitions 0/84 dead transitions. [2024-06-03 21:45:08,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 84 transitions, 689 flow [2024-06-03 21:45:08,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:45:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:45:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2024-06-03 21:45:08,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43014705882352944 [2024-06-03 21:45:08,655 INFO L175 Difference]: Start difference. First operand has 81 places, 67 transitions, 453 flow. Second operand 8 states and 117 transitions. [2024-06-03 21:45:08,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 84 transitions, 689 flow [2024-06-03 21:45:08,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 84 transitions, 657 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-03 21:45:08,660 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 484 flow [2024-06-03 21:45:08,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=484, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2024-06-03 21:45:08,661 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 52 predicate places. [2024-06-03 21:45:08,661 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 484 flow [2024-06-03 21:45:08,661 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-03 21:45:08,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:45:08,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:45:08,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 21:45:08,662 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:45:08,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:45:08,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1033294013, now seen corresponding path program 2 times [2024-06-03 21:45:08,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:45:08,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841038873] [2024-06-03 21:45:08,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:45:08,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:45:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:45:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:45:16,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:45:16,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841038873] [2024-06-03 21:45:16,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841038873] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:45:16,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:45:16,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:45:16,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032220173] [2024-06-03 21:45:16,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:45:16,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:45:16,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:45:16,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:45:16,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:45:16,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:45:16,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 484 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:45:16,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:45:16,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:45:16,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:45:16,923 INFO L124 PetriNetUnfolderBase]: 295/521 cut-off events. [2024-06-03 21:45:16,923 INFO L125 PetriNetUnfolderBase]: For 10423/10423 co-relation queries the response was YES. [2024-06-03 21:45:16,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 521 events. 295/521 cut-off events. For 10423/10423 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1900 event pairs, 61 based on Foata normal form. 1/522 useless extension candidates. Maximal degree in co-relation 2724. Up to 446 conditions per place. [2024-06-03 21:45:16,927 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 58 selfloop transitions, 26 changer transitions 0/86 dead transitions. [2024-06-03 21:45:16,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 790 flow [2024-06-03 21:45:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:45:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:45:16,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-03 21:45:16,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3786764705882353 [2024-06-03 21:45:16,928 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 484 flow. Second operand 8 states and 103 transitions. [2024-06-03 21:45:16,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 86 transitions, 790 flow [2024-06-03 21:45:16,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 86 transitions, 753 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-03 21:45:16,935 INFO L231 Difference]: Finished difference. Result has 88 places, 73 transitions, 532 flow [2024-06-03 21:45:16,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=532, PETRI_PLACES=88, PETRI_TRANSITIONS=73} [2024-06-03 21:45:16,936 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 55 predicate places. [2024-06-03 21:45:16,936 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 73 transitions, 532 flow [2024-06-03 21:45:16,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:45:16,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:45:16,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:45:16,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 21:45:16,937 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:45:16,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:45:16,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1033293796, now seen corresponding path program 3 times [2024-06-03 21:45:16,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:45:16,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986422861] [2024-06-03 21:45:16,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:45:16,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:45:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:45:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:45:25,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:45:25,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986422861] [2024-06-03 21:45:25,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986422861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:45:25,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:45:25,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:45:25,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295093761] [2024-06-03 21:45:25,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:45:25,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:45:25,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:45:25,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:45:25,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:45:25,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:45:25,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 73 transitions, 532 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:45:25,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:45:25,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:45:25,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:45:26,311 INFO L124 PetriNetUnfolderBase]: 282/510 cut-off events. [2024-06-03 21:45:26,312 INFO L125 PetriNetUnfolderBase]: For 11640/11640 co-relation queries the response was YES. [2024-06-03 21:45:26,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 510 events. 282/510 cut-off events. For 11640/11640 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1899 event pairs, 58 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 2736. Up to 410 conditions per place. [2024-06-03 21:45:26,316 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 52 selfloop transitions, 24 changer transitions 0/87 dead transitions. [2024-06-03 21:45:26,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 87 transitions, 768 flow [2024-06-03 21:45:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:45:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:45:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-03 21:45:26,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39338235294117646 [2024-06-03 21:45:26,319 INFO L175 Difference]: Start difference. First operand has 88 places, 73 transitions, 532 flow. Second operand 8 states and 107 transitions. [2024-06-03 21:45:26,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 87 transitions, 768 flow [2024-06-03 21:45:26,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 87 transitions, 730 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 21:45:26,332 INFO L231 Difference]: Finished difference. Result has 92 places, 75 transitions, 561 flow [2024-06-03 21:45:26,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=561, PETRI_PLACES=92, PETRI_TRANSITIONS=75} [2024-06-03 21:45:26,333 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 59 predicate places. [2024-06-03 21:45:26,333 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 75 transitions, 561 flow [2024-06-03 21:45:26,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:45:26,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:45:26,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:45:26,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 21:45:26,334 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:45:26,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:45:26,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1033301732, now seen corresponding path program 1 times [2024-06-03 21:45:26,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:45:26,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366680515] [2024-06-03 21:45:26,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:45:26,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:45:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:45:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:45:34,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:45:34,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366680515] [2024-06-03 21:45:34,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366680515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:45:34,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:45:34,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:45:34,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914026298] [2024-06-03 21:45:34,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:45:34,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:45:34,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:45:34,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:45:34,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:45:34,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:45:34,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 75 transitions, 561 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:45:34,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:45:34,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:45:34,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:45:34,927 INFO L124 PetriNetUnfolderBase]: 300/540 cut-off events. [2024-06-03 21:45:34,928 INFO L125 PetriNetUnfolderBase]: For 13637/13637 co-relation queries the response was YES. [2024-06-03 21:45:34,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2962 conditions, 540 events. 300/540 cut-off events. For 13637/13637 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2049 event pairs, 64 based on Foata normal form. 3/543 useless extension candidates. Maximal degree in co-relation 2918. Up to 445 conditions per place. [2024-06-03 21:45:34,932 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 66 selfloop transitions, 20 changer transitions 0/97 dead transitions. [2024-06-03 21:45:34,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 97 transitions, 843 flow [2024-06-03 21:45:34,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:45:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:45:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-06-03 21:45:34,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40808823529411764 [2024-06-03 21:45:34,934 INFO L175 Difference]: Start difference. First operand has 92 places, 75 transitions, 561 flow. Second operand 8 states and 111 transitions. [2024-06-03 21:45:34,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 97 transitions, 843 flow [2024-06-03 21:45:34,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 97 transitions, 804 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-03 21:45:34,945 INFO L231 Difference]: Finished difference. Result has 96 places, 81 transitions, 611 flow [2024-06-03 21:45:34,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=611, PETRI_PLACES=96, PETRI_TRANSITIONS=81} [2024-06-03 21:45:34,946 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 63 predicate places. [2024-06-03 21:45:34,946 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 81 transitions, 611 flow [2024-06-03 21:45:34,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:45:34,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:45:34,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:45:34,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 21:45:34,947 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:45:34,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:45:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1033301453, now seen corresponding path program 3 times [2024-06-03 21:45:34,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:45:34,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654787845] [2024-06-03 21:45:34,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:45:34,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:45:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:45:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:45:43,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:45:43,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654787845] [2024-06-03 21:45:43,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654787845] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:45:43,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:45:43,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:45:43,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226748912] [2024-06-03 21:45:43,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:45:43,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:45:43,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:45:43,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:45:43,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:45:43,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:45:43,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 81 transitions, 611 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:45:43,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:45:43,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:45:43,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:45:43,859 INFO L124 PetriNetUnfolderBase]: 315/554 cut-off events. [2024-06-03 21:45:43,860 INFO L125 PetriNetUnfolderBase]: For 14079/14079 co-relation queries the response was YES. [2024-06-03 21:45:43,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3161 conditions, 554 events. 315/554 cut-off events. For 14079/14079 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2052 event pairs, 63 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 3115. Up to 480 conditions per place. [2024-06-03 21:45:43,864 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 64 selfloop transitions, 27 changer transitions 0/93 dead transitions. [2024-06-03 21:45:43,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 93 transitions, 867 flow [2024-06-03 21:45:43,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:45:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:45:43,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-03 21:45:43,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3713235294117647 [2024-06-03 21:45:43,865 INFO L175 Difference]: Start difference. First operand has 96 places, 81 transitions, 611 flow. Second operand 8 states and 101 transitions. [2024-06-03 21:45:43,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 93 transitions, 867 flow [2024-06-03 21:45:43,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 93 transitions, 847 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-03 21:45:43,876 INFO L231 Difference]: Finished difference. Result has 101 places, 81 transitions, 650 flow [2024-06-03 21:45:43,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=650, PETRI_PLACES=101, PETRI_TRANSITIONS=81} [2024-06-03 21:45:43,877 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 68 predicate places. [2024-06-03 21:45:43,877 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 81 transitions, 650 flow [2024-06-03 21:45:43,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:45:43,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:45:43,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:45:43,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 21:45:43,877 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:45:43,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:45:43,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2023699770, now seen corresponding path program 2 times [2024-06-03 21:45:43,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:45:43,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052962158] [2024-06-03 21:45:43,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:45:43,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:45:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:45:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:45:52,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:45:52,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052962158] [2024-06-03 21:45:52,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052962158] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:45:52,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:45:52,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:45:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722212515] [2024-06-03 21:45:52,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:45:52,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:45:52,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:45:52,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:45:52,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:45:52,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:45:52,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 81 transitions, 650 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:45:52,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:45:52,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:45:52,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:45:52,904 INFO L124 PetriNetUnfolderBase]: 307/552 cut-off events. [2024-06-03 21:45:52,904 INFO L125 PetriNetUnfolderBase]: For 15996/15996 co-relation queries the response was YES. [2024-06-03 21:45:52,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3217 conditions, 552 events. 307/552 cut-off events. For 15996/15996 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2082 event pairs, 61 based on Foata normal form. 3/555 useless extension candidates. Maximal degree in co-relation 3168. Up to 500 conditions per place. [2024-06-03 21:45:52,925 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 70 selfloop transitions, 12 changer transitions 0/93 dead transitions. [2024-06-03 21:45:52,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 93 transitions, 854 flow [2024-06-03 21:45:52,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:45:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:45:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-03 21:45:52,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3639705882352941 [2024-06-03 21:45:52,928 INFO L175 Difference]: Start difference. First operand has 101 places, 81 transitions, 650 flow. Second operand 8 states and 99 transitions. [2024-06-03 21:45:52,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 93 transitions, 854 flow [2024-06-03 21:45:52,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 93 transitions, 795 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-03 21:45:52,939 INFO L231 Difference]: Finished difference. Result has 102 places, 83 transitions, 640 flow [2024-06-03 21:45:52,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=640, PETRI_PLACES=102, PETRI_TRANSITIONS=83} [2024-06-03 21:45:52,940 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 69 predicate places. [2024-06-03 21:45:52,940 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 83 transitions, 640 flow [2024-06-03 21:45:52,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:45:52,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:45:52,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:45:52,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 21:45:52,941 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:45:52,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:45:52,944 INFO L85 PathProgramCache]: Analyzing trace with hash 546365914, now seen corresponding path program 4 times [2024-06-03 21:45:52,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:45:52,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212371785] [2024-06-03 21:45:52,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:45:52,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:45:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:46:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:46:01,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:46:01,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212371785] [2024-06-03 21:46:01,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212371785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:46:01,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:46:01,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:46:01,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806621629] [2024-06-03 21:46:01,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:46:01,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:46:01,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:46:01,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:46:01,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:46:01,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:46:01,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 83 transitions, 640 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:46:01,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:46:01,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:46:01,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:46:01,670 INFO L124 PetriNetUnfolderBase]: 305/549 cut-off events. [2024-06-03 21:46:01,671 INFO L125 PetriNetUnfolderBase]: For 16531/16531 co-relation queries the response was YES. [2024-06-03 21:46:01,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3237 conditions, 549 events. 305/549 cut-off events. For 16531/16531 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2072 event pairs, 59 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 3187. Up to 496 conditions per place. [2024-06-03 21:46:01,674 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 68 selfloop transitions, 12 changer transitions 0/91 dead transitions. [2024-06-03 21:46:01,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 91 transitions, 818 flow [2024-06-03 21:46:01,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:46:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:46:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-03 21:46:01,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35661764705882354 [2024-06-03 21:46:01,676 INFO L175 Difference]: Start difference. First operand has 102 places, 83 transitions, 640 flow. Second operand 8 states and 97 transitions. [2024-06-03 21:46:01,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 91 transitions, 818 flow [2024-06-03 21:46:01,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 91 transitions, 784 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 21:46:01,687 INFO L231 Difference]: Finished difference. Result has 104 places, 83 transitions, 635 flow [2024-06-03 21:46:01,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=635, PETRI_PLACES=104, PETRI_TRANSITIONS=83} [2024-06-03 21:46:01,688 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 71 predicate places. [2024-06-03 21:46:01,688 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 83 transitions, 635 flow [2024-06-03 21:46:01,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:46:01,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:46:01,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:46:01,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 21:46:01,689 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:46:01,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:46:01,689 INFO L85 PathProgramCache]: Analyzing trace with hash 546366131, now seen corresponding path program 4 times [2024-06-03 21:46:01,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:46:01,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251601806] [2024-06-03 21:46:01,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:46:01,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:46:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:46:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:46:09,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:46:09,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251601806] [2024-06-03 21:46:09,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251601806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:46:09,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:46:09,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:46:09,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974279239] [2024-06-03 21:46:09,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:46:09,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:46:09,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:46:09,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:46:09,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:46:09,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:46:09,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 83 transitions, 635 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:46:09,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:46:09,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:46:09,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:46:10,343 INFO L124 PetriNetUnfolderBase]: 325/571 cut-off events. [2024-06-03 21:46:10,344 INFO L125 PetriNetUnfolderBase]: For 17510/17510 co-relation queries the response was YES. [2024-06-03 21:46:10,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3360 conditions, 571 events. 325/571 cut-off events. For 17510/17510 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2109 event pairs, 61 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 3310. Up to 535 conditions per place. [2024-06-03 21:46:10,347 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 74 selfloop transitions, 18 changer transitions 0/94 dead transitions. [2024-06-03 21:46:10,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 94 transitions, 907 flow [2024-06-03 21:46:10,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:46:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:46:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-03 21:46:10,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34558823529411764 [2024-06-03 21:46:10,349 INFO L175 Difference]: Start difference. First operand has 104 places, 83 transitions, 635 flow. Second operand 8 states and 94 transitions. [2024-06-03 21:46:10,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 94 transitions, 907 flow [2024-06-03 21:46:10,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 94 transitions, 847 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-03 21:46:10,360 INFO L231 Difference]: Finished difference. Result has 102 places, 85 transitions, 632 flow [2024-06-03 21:46:10,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=632, PETRI_PLACES=102, PETRI_TRANSITIONS=85} [2024-06-03 21:46:10,360 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 69 predicate places. [2024-06-03 21:46:10,360 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 85 transitions, 632 flow [2024-06-03 21:46:10,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:46:10,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:46:10,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:46:10,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 21:46:10,361 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:46:10,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:46:10,362 INFO L85 PathProgramCache]: Analyzing trace with hash -235196979, now seen corresponding path program 5 times [2024-06-03 21:46:10,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:46:10,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303138586] [2024-06-03 21:46:10,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:46:10,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:46:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:46:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:46:18,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:46:18,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303138586] [2024-06-03 21:46:18,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303138586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:46:18,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:46:18,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:46:18,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28685020] [2024-06-03 21:46:18,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:46:18,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:46:18,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:46:18,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:46:18,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:46:18,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:46:18,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 85 transitions, 632 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:46:18,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:46:18,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:46:18,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:46:18,889 INFO L124 PetriNetUnfolderBase]: 328/576 cut-off events. [2024-06-03 21:46:18,889 INFO L125 PetriNetUnfolderBase]: For 18818/18818 co-relation queries the response was YES. [2024-06-03 21:46:18,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3417 conditions, 576 events. 328/576 cut-off events. For 18818/18818 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2152 event pairs, 61 based on Foata normal form. 1/577 useless extension candidates. Maximal degree in co-relation 3367. Up to 539 conditions per place. [2024-06-03 21:46:18,892 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 75 selfloop transitions, 19 changer transitions 0/96 dead transitions. [2024-06-03 21:46:18,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 96 transitions, 914 flow [2024-06-03 21:46:18,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:46:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:46:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-03 21:46:18,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3492647058823529 [2024-06-03 21:46:18,908 INFO L175 Difference]: Start difference. First operand has 102 places, 85 transitions, 632 flow. Second operand 8 states and 95 transitions. [2024-06-03 21:46:18,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 96 transitions, 914 flow [2024-06-03 21:46:18,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 96 transitions, 845 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 21:46:18,938 INFO L231 Difference]: Finished difference. Result has 103 places, 87 transitions, 626 flow [2024-06-03 21:46:18,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=626, PETRI_PLACES=103, PETRI_TRANSITIONS=87} [2024-06-03 21:46:18,943 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 70 predicate places. [2024-06-03 21:46:18,943 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 87 transitions, 626 flow [2024-06-03 21:46:18,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:46:18,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:46:18,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:46:18,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 21:46:18,944 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:46:18,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:46:18,944 INFO L85 PathProgramCache]: Analyzing trace with hash 555570620, now seen corresponding path program 3 times [2024-06-03 21:46:18,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:46:18,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220430959] [2024-06-03 21:46:18,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:46:18,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:46:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:46:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:46:26,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:46:26,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220430959] [2024-06-03 21:46:26,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220430959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:46:26,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:46:26,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:46:26,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507824812] [2024-06-03 21:46:26,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:46:26,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:46:26,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:46:26,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:46:26,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:46:27,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:46:27,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 87 transitions, 626 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:46:27,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:46:27,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:46:27,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:46:27,477 INFO L124 PetriNetUnfolderBase]: 320/574 cut-off events. [2024-06-03 21:46:27,477 INFO L125 PetriNetUnfolderBase]: For 20996/20996 co-relation queries the response was YES. [2024-06-03 21:46:27,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3420 conditions, 574 events. 320/574 cut-off events. For 20996/20996 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2196 event pairs, 61 based on Foata normal form. 3/577 useless extension candidates. Maximal degree in co-relation 3369. Up to 506 conditions per place. [2024-06-03 21:46:27,481 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 73 selfloop transitions, 15 changer transitions 0/101 dead transitions. [2024-06-03 21:46:27,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 101 transitions, 852 flow [2024-06-03 21:46:27,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:46:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:46:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-03 21:46:27,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3786764705882353 [2024-06-03 21:46:27,482 INFO L175 Difference]: Start difference. First operand has 103 places, 87 transitions, 626 flow. Second operand 8 states and 103 transitions. [2024-06-03 21:46:27,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 101 transitions, 852 flow [2024-06-03 21:46:27,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 101 transitions, 819 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 21:46:27,497 INFO L231 Difference]: Finished difference. Result has 106 places, 89 transitions, 652 flow [2024-06-03 21:46:27,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=652, PETRI_PLACES=106, PETRI_TRANSITIONS=89} [2024-06-03 21:46:27,499 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 73 predicate places. [2024-06-03 21:46:27,500 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 89 transitions, 652 flow [2024-06-03 21:46:27,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:46:27,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:46:27,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:46:27,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 21:46:27,500 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:46:27,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:46:27,501 INFO L85 PathProgramCache]: Analyzing trace with hash 546373850, now seen corresponding path program 4 times [2024-06-03 21:46:27,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:46:27,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580015724] [2024-06-03 21:46:27,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:46:27,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:46:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:46:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:46:35,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:46:35,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580015724] [2024-06-03 21:46:35,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580015724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:46:35,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:46:35,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:46:35,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356030121] [2024-06-03 21:46:35,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:46:35,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:46:35,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:46:35,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:46:35,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:46:35,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:46:35,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 89 transitions, 652 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:46:35,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:46:35,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:46:35,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:46:36,315 INFO L124 PetriNetUnfolderBase]: 314/565 cut-off events. [2024-06-03 21:46:36,316 INFO L125 PetriNetUnfolderBase]: For 21262/21262 co-relation queries the response was YES. [2024-06-03 21:46:36,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3360 conditions, 565 events. 314/565 cut-off events. For 21262/21262 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2155 event pairs, 59 based on Foata normal form. 3/568 useless extension candidates. Maximal degree in co-relation 3308. Up to 482 conditions per place. [2024-06-03 21:46:36,320 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 69 selfloop transitions, 19 changer transitions 0/101 dead transitions. [2024-06-03 21:46:36,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 101 transitions, 858 flow [2024-06-03 21:46:36,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:46:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:46:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-03 21:46:36,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3860294117647059 [2024-06-03 21:46:36,322 INFO L175 Difference]: Start difference. First operand has 106 places, 89 transitions, 652 flow. Second operand 8 states and 105 transitions. [2024-06-03 21:46:36,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 101 transitions, 858 flow [2024-06-03 21:46:36,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 101 transitions, 817 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 21:46:36,338 INFO L231 Difference]: Finished difference. Result has 108 places, 89 transitions, 654 flow [2024-06-03 21:46:36,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=654, PETRI_PLACES=108, PETRI_TRANSITIONS=89} [2024-06-03 21:46:36,339 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 75 predicate places. [2024-06-03 21:46:36,339 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 89 transitions, 654 flow [2024-06-03 21:46:36,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:46:36,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:46:36,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:46:36,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 21:46:36,340 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:46:36,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:46:36,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1881011421, now seen corresponding path program 6 times [2024-06-03 21:46:36,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:46:36,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31204137] [2024-06-03 21:46:36,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:46:36,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:46:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:46:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:46:44,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:46:44,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31204137] [2024-06-03 21:46:44,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31204137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:46:44,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:46:44,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:46:44,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240269640] [2024-06-03 21:46:44,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:46:44,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:46:44,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:46:44,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:46:44,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:46:44,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:46:44,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 89 transitions, 654 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:46:44,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:46:44,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:46:44,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:46:44,869 INFO L124 PetriNetUnfolderBase]: 329/582 cut-off events. [2024-06-03 21:46:44,869 INFO L125 PetriNetUnfolderBase]: For 21382/21382 co-relation queries the response was YES. [2024-06-03 21:46:44,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3456 conditions, 582 events. 329/582 cut-off events. For 21382/21382 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2198 event pairs, 131 based on Foata normal form. 1/583 useless extension candidates. Maximal degree in co-relation 3403. Up to 558 conditions per place. [2024-06-03 21:46:44,872 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 82 selfloop transitions, 14 changer transitions 0/98 dead transitions. [2024-06-03 21:46:44,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 98 transitions, 874 flow [2024-06-03 21:46:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:46:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:46:44,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-03 21:46:44,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31699346405228757 [2024-06-03 21:46:44,874 INFO L175 Difference]: Start difference. First operand has 108 places, 89 transitions, 654 flow. Second operand 9 states and 97 transitions. [2024-06-03 21:46:44,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 98 transitions, 874 flow [2024-06-03 21:46:44,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 98 transitions, 803 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-03 21:46:44,892 INFO L231 Difference]: Finished difference. Result has 111 places, 91 transitions, 633 flow [2024-06-03 21:46:44,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=633, PETRI_PLACES=111, PETRI_TRANSITIONS=91} [2024-06-03 21:46:44,893 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 78 predicate places. [2024-06-03 21:46:44,893 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 91 transitions, 633 flow [2024-06-03 21:46:44,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:46:44,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:46:44,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:46:44,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 21:46:44,894 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:46:44,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:46:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash 476405116, now seen corresponding path program 1 times [2024-06-03 21:46:44,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:46:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181994031] [2024-06-03 21:46:44,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:46:44,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:46:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:46:56,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-03 21:46:56,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:46:56,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181994031] [2024-06-03 21:46:56,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181994031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:46:56,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:46:56,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:46:56,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173627298] [2024-06-03 21:46:56,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:46:56,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:46:56,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:46:56,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:46:56,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:46:56,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:46:56,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 91 transitions, 633 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:46:56,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:46:56,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:46:56,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:46:56,807 INFO L124 PetriNetUnfolderBase]: 337/610 cut-off events. [2024-06-03 21:46:56,808 INFO L125 PetriNetUnfolderBase]: For 22774/22776 co-relation queries the response was YES. [2024-06-03 21:46:56,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3539 conditions, 610 events. 337/610 cut-off events. For 22774/22776 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2434 event pairs, 57 based on Foata normal form. 3/613 useless extension candidates. Maximal degree in co-relation 3484. Up to 501 conditions per place. [2024-06-03 21:46:56,812 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 84 selfloop transitions, 24 changer transitions 0/121 dead transitions. [2024-06-03 21:46:56,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 975 flow [2024-06-03 21:46:56,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:46:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:46:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-03 21:46:56,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3954248366013072 [2024-06-03 21:46:56,814 INFO L175 Difference]: Start difference. First operand has 111 places, 91 transitions, 633 flow. Second operand 9 states and 121 transitions. [2024-06-03 21:46:56,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 975 flow [2024-06-03 21:46:56,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 121 transitions, 933 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-03 21:46:56,827 INFO L231 Difference]: Finished difference. Result has 114 places, 104 transitions, 745 flow [2024-06-03 21:46:56,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=745, PETRI_PLACES=114, PETRI_TRANSITIONS=104} [2024-06-03 21:46:56,828 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 81 predicate places. [2024-06-03 21:46:56,828 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 104 transitions, 745 flow [2024-06-03 21:46:56,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:46:56,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:46:56,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:46:56,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 21:46:56,829 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:46:56,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:46:56,829 INFO L85 PathProgramCache]: Analyzing trace with hash 176463930, now seen corresponding path program 2 times [2024-06-03 21:46:56,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:46:56,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497876057] [2024-06-03 21:46:56,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:46:56,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:46:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:47:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:47:08,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:47:08,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497876057] [2024-06-03 21:47:08,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497876057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:47:08,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:47:08,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:47:08,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676337051] [2024-06-03 21:47:08,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:47:08,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:47:08,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:47:08,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:47:08,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:47:08,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:47:08,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 104 transitions, 745 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:08,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:47:08,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:47:08,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:47:09,265 INFO L124 PetriNetUnfolderBase]: 356/645 cut-off events. [2024-06-03 21:47:09,265 INFO L125 PetriNetUnfolderBase]: For 24318/24318 co-relation queries the response was YES. [2024-06-03 21:47:09,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3856 conditions, 645 events. 356/645 cut-off events. For 24318/24318 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2616 event pairs, 109 based on Foata normal form. 1/646 useless extension candidates. Maximal degree in co-relation 3798. Up to 566 conditions per place. [2024-06-03 21:47:09,275 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 99 selfloop transitions, 18 changer transitions 0/130 dead transitions. [2024-06-03 21:47:09,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 130 transitions, 1114 flow [2024-06-03 21:47:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:47:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:47:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 21:47:09,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36470588235294116 [2024-06-03 21:47:09,277 INFO L175 Difference]: Start difference. First operand has 114 places, 104 transitions, 745 flow. Second operand 10 states and 124 transitions. [2024-06-03 21:47:09,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 130 transitions, 1114 flow [2024-06-03 21:47:09,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 130 transitions, 1071 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-03 21:47:09,307 INFO L231 Difference]: Finished difference. Result has 124 places, 115 transitions, 868 flow [2024-06-03 21:47:09,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=868, PETRI_PLACES=124, PETRI_TRANSITIONS=115} [2024-06-03 21:47:09,308 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 91 predicate places. [2024-06-03 21:47:09,308 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 115 transitions, 868 flow [2024-06-03 21:47:09,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:09,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:47:09,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:47:09,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 21:47:09,309 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:47:09,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:47:09,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1778204934, now seen corresponding path program 3 times [2024-06-03 21:47:09,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:47:09,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411983188] [2024-06-03 21:47:09,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:47:09,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:47:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:47:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:47:19,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:47:19,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411983188] [2024-06-03 21:47:19,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411983188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:47:19,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:47:19,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:47:19,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456517712] [2024-06-03 21:47:19,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:47:19,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:47:19,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:47:19,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:47:19,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:47:19,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:47:19,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 115 transitions, 868 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:19,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:47:19,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:47:19,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:47:20,293 INFO L124 PetriNetUnfolderBase]: 364/655 cut-off events. [2024-06-03 21:47:20,294 INFO L125 PetriNetUnfolderBase]: For 27887/27889 co-relation queries the response was YES. [2024-06-03 21:47:20,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4087 conditions, 655 events. 364/655 cut-off events. For 27887/27889 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2716 event pairs, 90 based on Foata normal form. 1/654 useless extension candidates. Maximal degree in co-relation 4024. Up to 531 conditions per place. [2024-06-03 21:47:20,298 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 91 selfloop transitions, 32 changer transitions 0/136 dead transitions. [2024-06-03 21:47:20,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 136 transitions, 1203 flow [2024-06-03 21:47:20,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:47:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:47:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-03 21:47:20,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2024-06-03 21:47:20,301 INFO L175 Difference]: Start difference. First operand has 124 places, 115 transitions, 868 flow. Second operand 9 states and 120 transitions. [2024-06-03 21:47:20,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 136 transitions, 1203 flow [2024-06-03 21:47:20,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 136 transitions, 1161 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-03 21:47:20,329 INFO L231 Difference]: Finished difference. Result has 130 places, 120 transitions, 963 flow [2024-06-03 21:47:20,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=963, PETRI_PLACES=130, PETRI_TRANSITIONS=120} [2024-06-03 21:47:20,329 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 97 predicate places. [2024-06-03 21:47:20,329 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 120 transitions, 963 flow [2024-06-03 21:47:20,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:20,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:47:20,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:47:20,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 21:47:20,330 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:47:20,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:47:20,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1298493426, now seen corresponding path program 4 times [2024-06-03 21:47:20,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:47:20,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935518276] [2024-06-03 21:47:20,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:47:20,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:47:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:47:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:47:30,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:47:30,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935518276] [2024-06-03 21:47:30,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935518276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:47:30,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:47:30,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:47:30,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205509344] [2024-06-03 21:47:30,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:47:30,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:47:30,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:47:30,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:47:30,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:47:30,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:47:30,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 120 transitions, 963 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:30,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:47:30,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:47:30,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:47:31,001 INFO L124 PetriNetUnfolderBase]: 373/673 cut-off events. [2024-06-03 21:47:31,002 INFO L125 PetriNetUnfolderBase]: For 28556/28557 co-relation queries the response was YES. [2024-06-03 21:47:31,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4304 conditions, 673 events. 373/673 cut-off events. For 28556/28557 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2827 event pairs, 93 based on Foata normal form. 1/673 useless extension candidates. Maximal degree in co-relation 4239. Up to 521 conditions per place. [2024-06-03 21:47:31,007 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 90 selfloop transitions, 44 changer transitions 0/147 dead transitions. [2024-06-03 21:47:31,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 147 transitions, 1370 flow [2024-06-03 21:47:31,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:47:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:47:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2024-06-03 21:47:31,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-03 21:47:31,036 INFO L175 Difference]: Start difference. First operand has 130 places, 120 transitions, 963 flow. Second operand 12 states and 152 transitions. [2024-06-03 21:47:31,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 147 transitions, 1370 flow [2024-06-03 21:47:31,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 147 transitions, 1290 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-03 21:47:31,068 INFO L231 Difference]: Finished difference. Result has 140 places, 128 transitions, 1104 flow [2024-06-03 21:47:31,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1104, PETRI_PLACES=140, PETRI_TRANSITIONS=128} [2024-06-03 21:47:31,069 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 107 predicate places. [2024-06-03 21:47:31,069 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 128 transitions, 1104 flow [2024-06-03 21:47:31,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:31,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:47:31,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:47:31,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 21:47:31,069 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:47:31,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:47:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1358895648, now seen corresponding path program 1 times [2024-06-03 21:47:31,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:47:31,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140597753] [2024-06-03 21:47:31,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:47:31,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:47:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:47:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:47:40,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:47:40,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140597753] [2024-06-03 21:47:40,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140597753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:47:40,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:47:40,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:47:40,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113347043] [2024-06-03 21:47:40,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:47:40,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:47:40,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:47:40,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:47:40,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:47:40,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:47:40,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 128 transitions, 1104 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:40,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:47:40,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:47:40,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:47:41,386 INFO L124 PetriNetUnfolderBase]: 393/695 cut-off events. [2024-06-03 21:47:41,387 INFO L125 PetriNetUnfolderBase]: For 29077/29077 co-relation queries the response was YES. [2024-06-03 21:47:41,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4507 conditions, 695 events. 393/695 cut-off events. For 29077/29077 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2845 event pairs, 97 based on Foata normal form. 1/696 useless extension candidates. Maximal degree in co-relation 4438. Up to 531 conditions per place. [2024-06-03 21:47:41,397 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 96 selfloop transitions, 51 changer transitions 0/149 dead transitions. [2024-06-03 21:47:41,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 149 transitions, 1536 flow [2024-06-03 21:47:41,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:47:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:47:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-03 21:47:41,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3735294117647059 [2024-06-03 21:47:41,398 INFO L175 Difference]: Start difference. First operand has 140 places, 128 transitions, 1104 flow. Second operand 10 states and 127 transitions. [2024-06-03 21:47:41,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 149 transitions, 1536 flow [2024-06-03 21:47:41,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 149 transitions, 1452 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-03 21:47:41,432 INFO L231 Difference]: Finished difference. Result has 145 places, 132 transitions, 1155 flow [2024-06-03 21:47:41,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1155, PETRI_PLACES=145, PETRI_TRANSITIONS=132} [2024-06-03 21:47:41,433 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 112 predicate places. [2024-06-03 21:47:41,433 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 132 transitions, 1155 flow [2024-06-03 21:47:41,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:41,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:47:41,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:47:41,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 21:47:41,434 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:47:41,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:47:41,434 INFO L85 PathProgramCache]: Analyzing trace with hash 875132374, now seen corresponding path program 2 times [2024-06-03 21:47:41,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:47:41,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413576489] [2024-06-03 21:47:41,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:47:41,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:47:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:47:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:47:52,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:47:52,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413576489] [2024-06-03 21:47:52,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413576489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:47:52,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:47:52,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:47:52,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838023571] [2024-06-03 21:47:52,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:47:52,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:47:52,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:47:52,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:47:52,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:47:52,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:47:52,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 132 transitions, 1155 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:52,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:47:52,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:47:52,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:47:53,392 INFO L124 PetriNetUnfolderBase]: 410/723 cut-off events. [2024-06-03 21:47:53,392 INFO L125 PetriNetUnfolderBase]: For 31421/31421 co-relation queries the response was YES. [2024-06-03 21:47:53,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4763 conditions, 723 events. 410/723 cut-off events. For 31421/31421 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 99 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 4693. Up to 545 conditions per place. [2024-06-03 21:47:53,398 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 108 selfloop transitions, 50 changer transitions 0/160 dead transitions. [2024-06-03 21:47:53,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 160 transitions, 1752 flow [2024-06-03 21:47:53,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:47:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:47:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-03 21:47:53,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-03 21:47:53,415 INFO L175 Difference]: Start difference. First operand has 145 places, 132 transitions, 1155 flow. Second operand 10 states and 130 transitions. [2024-06-03 21:47:53,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 160 transitions, 1752 flow [2024-06-03 21:47:53,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 160 transitions, 1676 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-03 21:47:53,457 INFO L231 Difference]: Finished difference. Result has 150 places, 141 transitions, 1276 flow [2024-06-03 21:47:53,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1276, PETRI_PLACES=150, PETRI_TRANSITIONS=141} [2024-06-03 21:47:53,458 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 117 predicate places. [2024-06-03 21:47:53,458 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 141 transitions, 1276 flow [2024-06-03 21:47:53,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:53,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:47:53,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:47:53,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 21:47:53,459 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:47:53,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:47:53,459 INFO L85 PathProgramCache]: Analyzing trace with hash 875132188, now seen corresponding path program 5 times [2024-06-03 21:47:53,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:47:53,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825632667] [2024-06-03 21:47:53,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:47:53,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:47:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:48:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:48:03,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:48:03,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825632667] [2024-06-03 21:48:03,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825632667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:48:03,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:48:03,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:48:03,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426517598] [2024-06-03 21:48:03,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:48:03,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:48:03,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:48:03,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:48:03,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:48:03,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:48:03,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 141 transitions, 1276 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:48:03,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:48:03,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:48:03,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:48:04,204 INFO L124 PetriNetUnfolderBase]: 402/720 cut-off events. [2024-06-03 21:48:04,205 INFO L125 PetriNetUnfolderBase]: For 34201/34201 co-relation queries the response was YES. [2024-06-03 21:48:04,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4934 conditions, 720 events. 402/720 cut-off events. For 34201/34201 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3050 event pairs, 89 based on Foata normal form. 1/721 useless extension candidates. Maximal degree in co-relation 4861. Up to 539 conditions per place. [2024-06-03 21:48:04,210 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 98 selfloop transitions, 52 changer transitions 0/168 dead transitions. [2024-06-03 21:48:04,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 168 transitions, 1781 flow [2024-06-03 21:48:04,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-03 21:48:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-03 21:48:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 167 transitions. [2024-06-03 21:48:04,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778280542986425 [2024-06-03 21:48:04,212 INFO L175 Difference]: Start difference. First operand has 150 places, 141 transitions, 1276 flow. Second operand 13 states and 167 transitions. [2024-06-03 21:48:04,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 168 transitions, 1781 flow [2024-06-03 21:48:04,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 168 transitions, 1722 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 21:48:04,261 INFO L231 Difference]: Finished difference. Result has 159 places, 147 transitions, 1405 flow [2024-06-03 21:48:04,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1405, PETRI_PLACES=159, PETRI_TRANSITIONS=147} [2024-06-03 21:48:04,262 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 126 predicate places. [2024-06-03 21:48:04,262 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 147 transitions, 1405 flow [2024-06-03 21:48:04,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:48:04,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:48:04,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:48:04,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 21:48:04,263 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:48:04,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:48:04,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1481260804, now seen corresponding path program 3 times [2024-06-03 21:48:04,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:48:04,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872748770] [2024-06-03 21:48:04,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:48:04,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:48:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:48:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:48:15,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:48:15,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872748770] [2024-06-03 21:48:15,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872748770] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:48:15,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:48:15,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:48:15,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822969548] [2024-06-03 21:48:15,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:48:15,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:48:15,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:48:15,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:48:15,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:48:15,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:48:15,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 147 transitions, 1405 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:48:15,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:48:15,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:48:15,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:48:15,952 INFO L124 PetriNetUnfolderBase]: 421/742 cut-off events. [2024-06-03 21:48:15,952 INFO L125 PetriNetUnfolderBase]: For 36063/36063 co-relation queries the response was YES. [2024-06-03 21:48:15,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5154 conditions, 742 events. 421/742 cut-off events. For 36063/36063 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3104 event pairs, 97 based on Foata normal form. 1/743 useless extension candidates. Maximal degree in co-relation 5080. Up to 562 conditions per place. [2024-06-03 21:48:15,958 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 108 selfloop transitions, 55 changer transitions 0/165 dead transitions. [2024-06-03 21:48:15,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 165 transitions, 1937 flow [2024-06-03 21:48:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:48:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:48:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-03 21:48:15,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3735294117647059 [2024-06-03 21:48:15,965 INFO L175 Difference]: Start difference. First operand has 159 places, 147 transitions, 1405 flow. Second operand 10 states and 127 transitions. [2024-06-03 21:48:15,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 165 transitions, 1937 flow [2024-06-03 21:48:16,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 165 transitions, 1867 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-03 21:48:16,012 INFO L231 Difference]: Finished difference. Result has 163 places, 149 transitions, 1464 flow [2024-06-03 21:48:16,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1464, PETRI_PLACES=163, PETRI_TRANSITIONS=149} [2024-06-03 21:48:16,012 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 130 predicate places. [2024-06-03 21:48:16,012 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 149 transitions, 1464 flow [2024-06-03 21:48:16,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:48:16,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:48:16,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:48:16,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 21:48:16,013 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:48:16,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:48:16,014 INFO L85 PathProgramCache]: Analyzing trace with hash 879780762, now seen corresponding path program 1 times [2024-06-03 21:48:16,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:48:16,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055720796] [2024-06-03 21:48:16,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:48:16,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:48:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:48:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:48:26,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:48:26,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055720796] [2024-06-03 21:48:26,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055720796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:48:26,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:48:26,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:48:26,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757888093] [2024-06-03 21:48:26,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:48:26,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:48:26,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:48:26,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:48:26,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:48:26,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:48:26,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 149 transitions, 1464 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:48:26,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:48:26,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:48:26,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:48:27,481 INFO L124 PetriNetUnfolderBase]: 430/757 cut-off events. [2024-06-03 21:48:27,481 INFO L125 PetriNetUnfolderBase]: For 39664/39664 co-relation queries the response was YES. [2024-06-03 21:48:27,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5321 conditions, 757 events. 430/757 cut-off events. For 39664/39664 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3186 event pairs, 106 based on Foata normal form. 3/760 useless extension candidates. Maximal degree in co-relation 5245. Up to 610 conditions per place. [2024-06-03 21:48:27,487 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 131 selfloop transitions, 42 changer transitions 0/175 dead transitions. [2024-06-03 21:48:27,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 175 transitions, 1982 flow [2024-06-03 21:48:27,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:48:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:48:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-03 21:48:27,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3735294117647059 [2024-06-03 21:48:27,488 INFO L175 Difference]: Start difference. First operand has 163 places, 149 transitions, 1464 flow. Second operand 10 states and 127 transitions. [2024-06-03 21:48:27,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 175 transitions, 1982 flow [2024-06-03 21:48:27,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 175 transitions, 1898 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 21:48:27,532 INFO L231 Difference]: Finished difference. Result has 170 places, 158 transitions, 1577 flow [2024-06-03 21:48:27,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1577, PETRI_PLACES=170, PETRI_TRANSITIONS=158} [2024-06-03 21:48:27,532 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 137 predicate places. [2024-06-03 21:48:27,532 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 158 transitions, 1577 flow [2024-06-03 21:48:27,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:48:27,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:48:27,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:48:27,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 21:48:27,533 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:48:27,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:48:27,533 INFO L85 PathProgramCache]: Analyzing trace with hash 879773818, now seen corresponding path program 6 times [2024-06-03 21:48:27,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:48:27,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630831496] [2024-06-03 21:48:27,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:48:27,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:48:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:48:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:48:37,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:48:37,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630831496] [2024-06-03 21:48:37,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630831496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:48:37,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:48:37,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:48:37,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565115816] [2024-06-03 21:48:37,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:48:37,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:48:37,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:48:37,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:48:37,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:48:37,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:48:37,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 158 transitions, 1577 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:48:37,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:48:37,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:48:37,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:48:38,553 INFO L124 PetriNetUnfolderBase]: 411/737 cut-off events. [2024-06-03 21:48:38,553 INFO L125 PetriNetUnfolderBase]: For 39514/39514 co-relation queries the response was YES. [2024-06-03 21:48:38,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5370 conditions, 737 events. 411/737 cut-off events. For 39514/39514 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3151 event pairs, 88 based on Foata normal form. 1/738 useless extension candidates. Maximal degree in co-relation 5291. Up to 554 conditions per place. [2024-06-03 21:48:38,559 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 102 selfloop transitions, 54 changer transitions 0/175 dead transitions. [2024-06-03 21:48:38,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 175 transitions, 1933 flow [2024-06-03 21:48:38,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:48:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:48:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 151 transitions. [2024-06-03 21:48:38,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3700980392156863 [2024-06-03 21:48:38,562 INFO L175 Difference]: Start difference. First operand has 170 places, 158 transitions, 1577 flow. Second operand 12 states and 151 transitions. [2024-06-03 21:48:38,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 175 transitions, 1933 flow [2024-06-03 21:48:38,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 175 transitions, 1822 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-03 21:48:38,613 INFO L231 Difference]: Finished difference. Result has 174 places, 158 transitions, 1579 flow [2024-06-03 21:48:38,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1579, PETRI_PLACES=174, PETRI_TRANSITIONS=158} [2024-06-03 21:48:38,614 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 141 predicate places. [2024-06-03 21:48:38,614 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 158 transitions, 1579 flow [2024-06-03 21:48:38,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:48:38,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:48:38,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:48:38,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 21:48:38,615 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:48:38,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:48:38,615 INFO L85 PathProgramCache]: Analyzing trace with hash -757798452, now seen corresponding path program 4 times [2024-06-03 21:48:38,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:48:38,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348461112] [2024-06-03 21:48:38,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:48:38,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:48:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:48:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:48:49,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:48:49,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348461112] [2024-06-03 21:48:49,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348461112] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:48:49,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:48:49,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:48:49,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620164131] [2024-06-03 21:48:49,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:48:49,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:48:49,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:48:49,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:48:49,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:48:49,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:48:49,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 158 transitions, 1579 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:48:49,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:48:49,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:48:49,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:48:49,806 INFO L124 PetriNetUnfolderBase]: 426/751 cut-off events. [2024-06-03 21:48:49,807 INFO L125 PetriNetUnfolderBase]: For 40089/40089 co-relation queries the response was YES. [2024-06-03 21:48:49,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5450 conditions, 751 events. 426/751 cut-off events. For 40089/40089 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3138 event pairs, 96 based on Foata normal form. 1/752 useless extension candidates. Maximal degree in co-relation 5372. Up to 572 conditions per place. [2024-06-03 21:48:49,812 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 118 selfloop transitions, 53 changer transitions 0/173 dead transitions. [2024-06-03 21:48:49,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 173 transitions, 2041 flow [2024-06-03 21:48:49,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:48:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:48:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-03 21:48:49,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3735294117647059 [2024-06-03 21:48:49,815 INFO L175 Difference]: Start difference. First operand has 174 places, 158 transitions, 1579 flow. Second operand 10 states and 127 transitions. [2024-06-03 21:48:49,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 173 transitions, 2041 flow [2024-06-03 21:48:49,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 173 transitions, 1931 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 21:48:49,879 INFO L231 Difference]: Finished difference. Result has 175 places, 158 transitions, 1580 flow [2024-06-03 21:48:49,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1580, PETRI_PLACES=175, PETRI_TRANSITIONS=158} [2024-06-03 21:48:49,880 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 142 predicate places. [2024-06-03 21:48:49,880 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 158 transitions, 1580 flow [2024-06-03 21:48:49,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:48:49,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:48:49,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:48:49,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 21:48:49,881 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:48:49,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:48:49,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1460988370, now seen corresponding path program 5 times [2024-06-03 21:48:49,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:48:49,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319416107] [2024-06-03 21:48:49,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:48:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:48:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:49:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:49:01,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:49:01,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319416107] [2024-06-03 21:49:01,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319416107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:49:01,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:49:01,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:49:01,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327743252] [2024-06-03 21:49:01,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:49:01,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:49:01,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:49:01,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:49:01,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:49:01,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:49:01,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 158 transitions, 1580 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:01,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:49:01,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:49:01,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:49:01,811 INFO L124 PetriNetUnfolderBase]: 464/814 cut-off events. [2024-06-03 21:49:01,811 INFO L125 PetriNetUnfolderBase]: For 43216/43216 co-relation queries the response was YES. [2024-06-03 21:49:01,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5922 conditions, 814 events. 464/814 cut-off events. For 43216/43216 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3499 event pairs, 124 based on Foata normal form. 1/815 useless extension candidates. Maximal degree in co-relation 5843. Up to 711 conditions per place. [2024-06-03 21:49:01,817 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 155 selfloop transitions, 40 changer transitions 0/197 dead transitions. [2024-06-03 21:49:01,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 197 transitions, 2354 flow [2024-06-03 21:49:01,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:49:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:49:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-03 21:49:01,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36764705882352944 [2024-06-03 21:49:01,819 INFO L175 Difference]: Start difference. First operand has 175 places, 158 transitions, 1580 flow. Second operand 10 states and 125 transitions. [2024-06-03 21:49:01,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 197 transitions, 2354 flow [2024-06-03 21:49:01,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 197 transitions, 2203 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-03 21:49:01,881 INFO L231 Difference]: Finished difference. Result has 178 places, 177 transitions, 1781 flow [2024-06-03 21:49:01,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1781, PETRI_PLACES=178, PETRI_TRANSITIONS=177} [2024-06-03 21:49:01,882 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 145 predicate places. [2024-06-03 21:49:01,882 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 177 transitions, 1781 flow [2024-06-03 21:49:01,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:01,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:49:01,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:49:01,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 21:49:01,883 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:49:01,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:49:01,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1460988556, now seen corresponding path program 7 times [2024-06-03 21:49:01,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:49:01,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62018040] [2024-06-03 21:49:01,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:49:01,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:49:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:49:13,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:49:13,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:49:13,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62018040] [2024-06-03 21:49:13,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62018040] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:49:13,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:49:13,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:49:13,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625967043] [2024-06-03 21:49:13,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:49:13,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:49:13,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:49:13,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:49:13,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:49:13,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:49:13,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 177 transitions, 1781 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:13,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:49:13,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:49:13,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:49:14,056 INFO L124 PetriNetUnfolderBase]: 455/810 cut-off events. [2024-06-03 21:49:14,057 INFO L125 PetriNetUnfolderBase]: For 46501/46501 co-relation queries the response was YES. [2024-06-03 21:49:14,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6012 conditions, 810 events. 455/810 cut-off events. For 46501/46501 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3536 event pairs, 114 based on Foata normal form. 1/811 useless extension candidates. Maximal degree in co-relation 5929. Up to 671 conditions per place. [2024-06-03 21:49:14,063 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 143 selfloop transitions, 33 changer transitions 0/201 dead transitions. [2024-06-03 21:49:14,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 201 transitions, 2375 flow [2024-06-03 21:49:14,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:49:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:49:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-03 21:49:14,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38529411764705884 [2024-06-03 21:49:14,066 INFO L175 Difference]: Start difference. First operand has 178 places, 177 transitions, 1781 flow. Second operand 10 states and 131 transitions. [2024-06-03 21:49:14,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 201 transitions, 2375 flow [2024-06-03 21:49:14,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 201 transitions, 2363 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-03 21:49:14,136 INFO L231 Difference]: Finished difference. Result has 188 places, 186 transitions, 1985 flow [2024-06-03 21:49:14,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1769, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1985, PETRI_PLACES=188, PETRI_TRANSITIONS=186} [2024-06-03 21:49:14,136 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 155 predicate places. [2024-06-03 21:49:14,137 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 186 transitions, 1985 flow [2024-06-03 21:49:14,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:14,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:49:14,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:49:14,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 21:49:14,137 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:49:14,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:49:14,138 INFO L85 PathProgramCache]: Analyzing trace with hash 181232226, now seen corresponding path program 6 times [2024-06-03 21:49:14,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:49:14,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343260190] [2024-06-03 21:49:14,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:49:14,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:49:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:49:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:49:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:49:25,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343260190] [2024-06-03 21:49:25,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343260190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:49:25,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:49:25,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:49:25,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056744333] [2024-06-03 21:49:25,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:49:25,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:49:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:49:25,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:49:25,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:49:25,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:49:25,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 186 transitions, 1985 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:25,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:49:25,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:49:25,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:49:26,186 INFO L124 PetriNetUnfolderBase]: 480/840 cut-off events. [2024-06-03 21:49:26,186 INFO L125 PetriNetUnfolderBase]: For 49702/49702 co-relation queries the response was YES. [2024-06-03 21:49:26,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6418 conditions, 840 events. 480/840 cut-off events. For 49702/49702 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3639 event pairs, 124 based on Foata normal form. 1/841 useless extension candidates. Maximal degree in co-relation 6331. Up to 734 conditions per place. [2024-06-03 21:49:26,193 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 161 selfloop transitions, 42 changer transitions 0/205 dead transitions. [2024-06-03 21:49:26,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 205 transitions, 2645 flow [2024-06-03 21:49:26,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:49:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:49:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-03 21:49:26,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37058823529411766 [2024-06-03 21:49:26,196 INFO L175 Difference]: Start difference. First operand has 188 places, 186 transitions, 1985 flow. Second operand 10 states and 126 transitions. [2024-06-03 21:49:26,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 205 transitions, 2645 flow [2024-06-03 21:49:26,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 205 transitions, 2598 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-03 21:49:26,269 INFO L231 Difference]: Finished difference. Result has 195 places, 190 transitions, 2067 flow [2024-06-03 21:49:26,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2067, PETRI_PLACES=195, PETRI_TRANSITIONS=190} [2024-06-03 21:49:26,271 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 162 predicate places. [2024-06-03 21:49:26,271 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 190 transitions, 2067 flow [2024-06-03 21:49:26,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:26,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:49:26,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:49:26,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 21:49:26,271 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:49:26,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:49:26,273 INFO L85 PathProgramCache]: Analyzing trace with hash 347466254, now seen corresponding path program 2 times [2024-06-03 21:49:26,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:49:26,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020405535] [2024-06-03 21:49:26,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:49:26,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:49:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:49:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:49:37,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:49:37,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020405535] [2024-06-03 21:49:37,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020405535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:49:37,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:49:37,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:49:37,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110895804] [2024-06-03 21:49:37,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:49:37,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:49:37,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:49:37,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:49:37,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:49:37,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:49:37,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 190 transitions, 2067 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:37,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:49:37,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:49:37,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:49:38,131 INFO L124 PetriNetUnfolderBase]: 513/894 cut-off events. [2024-06-03 21:49:38,131 INFO L125 PetriNetUnfolderBase]: For 57191/57191 co-relation queries the response was YES. [2024-06-03 21:49:38,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6882 conditions, 894 events. 513/894 cut-off events. For 57191/57191 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3938 event pairs, 130 based on Foata normal form. 3/897 useless extension candidates. Maximal degree in co-relation 6793. Up to 765 conditions per place. [2024-06-03 21:49:38,138 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 176 selfloop transitions, 41 changer transitions 0/219 dead transitions. [2024-06-03 21:49:38,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 219 transitions, 2727 flow [2024-06-03 21:49:38,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:49:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:49:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-03 21:49:38,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38823529411764707 [2024-06-03 21:49:38,139 INFO L175 Difference]: Start difference. First operand has 195 places, 190 transitions, 2067 flow. Second operand 10 states and 132 transitions. [2024-06-03 21:49:38,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 219 transitions, 2727 flow [2024-06-03 21:49:38,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 219 transitions, 2667 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 21:49:38,225 INFO L231 Difference]: Finished difference. Result has 202 places, 200 transitions, 2215 flow [2024-06-03 21:49:38,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2007, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2215, PETRI_PLACES=202, PETRI_TRANSITIONS=200} [2024-06-03 21:49:38,225 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 169 predicate places. [2024-06-03 21:49:38,225 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 200 transitions, 2215 flow [2024-06-03 21:49:38,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:38,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:49:38,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:49:38,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 21:49:38,226 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:49:38,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:49:38,227 INFO L85 PathProgramCache]: Analyzing trace with hash 181225530, now seen corresponding path program 8 times [2024-06-03 21:49:38,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:49:38,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557452589] [2024-06-03 21:49:38,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:49:38,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:49:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:49:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:49:49,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:49:49,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557452589] [2024-06-03 21:49:49,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557452589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:49:49,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:49:49,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:49:49,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468153459] [2024-06-03 21:49:49,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:49:49,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:49:49,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:49:49,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:49:49,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:49:49,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:49:49,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 200 transitions, 2215 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:49,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:49:49,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:49:49,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:49:50,211 INFO L124 PetriNetUnfolderBase]: 496/879 cut-off events. [2024-06-03 21:49:50,212 INFO L125 PetriNetUnfolderBase]: For 58205/58205 co-relation queries the response was YES. [2024-06-03 21:49:50,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6982 conditions, 879 events. 496/879 cut-off events. For 58205/58205 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3939 event pairs, 116 based on Foata normal form. 1/880 useless extension candidates. Maximal degree in co-relation 6890. Up to 734 conditions per place. [2024-06-03 21:49:50,222 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 155 selfloop transitions, 34 changer transitions 0/216 dead transitions. [2024-06-03 21:49:50,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 216 transitions, 2757 flow [2024-06-03 21:49:50,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:49:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:49:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-03 21:49:50,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38529411764705884 [2024-06-03 21:49:50,229 INFO L175 Difference]: Start difference. First operand has 202 places, 200 transitions, 2215 flow. Second operand 10 states and 131 transitions. [2024-06-03 21:49:50,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 216 transitions, 2757 flow [2024-06-03 21:49:50,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 216 transitions, 2728 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-03 21:49:50,334 INFO L231 Difference]: Finished difference. Result has 210 places, 202 transitions, 2295 flow [2024-06-03 21:49:50,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2186, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2295, PETRI_PLACES=210, PETRI_TRANSITIONS=202} [2024-06-03 21:49:50,335 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 177 predicate places. [2024-06-03 21:49:50,335 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 202 transitions, 2295 flow [2024-06-03 21:49:50,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:50,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:49:50,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:49:50,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 21:49:50,336 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:49:50,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:49:50,336 INFO L85 PathProgramCache]: Analyzing trace with hash 181225716, now seen corresponding path program 7 times [2024-06-03 21:49:50,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:49:50,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375027471] [2024-06-03 21:49:50,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:49:50,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:49:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:50:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:50:01,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:50:01,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375027471] [2024-06-03 21:50:01,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375027471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:50:01,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:50:01,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:50:01,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826908410] [2024-06-03 21:50:01,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:50:01,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:50:01,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:50:01,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:50:01,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:50:01,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:50:01,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 202 transitions, 2295 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:50:01,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:50:01,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:50:01,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:50:02,332 INFO L124 PetriNetUnfolderBase]: 514/896 cut-off events. [2024-06-03 21:50:02,332 INFO L125 PetriNetUnfolderBase]: For 59162/59162 co-relation queries the response was YES. [2024-06-03 21:50:02,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7142 conditions, 896 events. 514/896 cut-off events. For 59162/59162 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3954 event pairs, 126 based on Foata normal form. 1/897 useless extension candidates. Maximal degree in co-relation 7048. Up to 791 conditions per place. [2024-06-03 21:50:02,340 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 173 selfloop transitions, 41 changer transitions 0/216 dead transitions. [2024-06-03 21:50:02,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 216 transitions, 2853 flow [2024-06-03 21:50:02,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:50:02,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:50:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-03 21:50:02,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37058823529411766 [2024-06-03 21:50:02,341 INFO L175 Difference]: Start difference. First operand has 210 places, 202 transitions, 2295 flow. Second operand 10 states and 126 transitions. [2024-06-03 21:50:02,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 216 transitions, 2853 flow [2024-06-03 21:50:02,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 216 transitions, 2766 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-03 21:50:02,461 INFO L231 Difference]: Finished difference. Result has 213 places, 202 transitions, 2295 flow [2024-06-03 21:50:02,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2208, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2295, PETRI_PLACES=213, PETRI_TRANSITIONS=202} [2024-06-03 21:50:02,462 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 180 predicate places. [2024-06-03 21:50:02,462 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 202 transitions, 2295 flow [2024-06-03 21:50:02,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:50:02,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:50:02,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:50:02,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 21:50:02,463 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:50:02,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:50:02,463 INFO L85 PathProgramCache]: Analyzing trace with hash 182169714, now seen corresponding path program 3 times [2024-06-03 21:50:02,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:50:02,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050703423] [2024-06-03 21:50:02,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:50:02,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:50:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:50:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:50:13,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:50:13,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050703423] [2024-06-03 21:50:13,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050703423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:50:13,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:50:13,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:50:13,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766733521] [2024-06-03 21:50:13,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:50:13,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:50:13,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:50:13,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:50:13,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:50:13,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:50:13,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 202 transitions, 2295 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:50:13,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:50:13,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:50:13,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:50:14,454 INFO L124 PetriNetUnfolderBase]: 523/911 cut-off events. [2024-06-03 21:50:14,455 INFO L125 PetriNetUnfolderBase]: For 64034/64034 co-relation queries the response was YES. [2024-06-03 21:50:14,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7260 conditions, 911 events. 523/911 cut-off events. For 64034/64034 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4035 event pairs, 125 based on Foata normal form. 3/914 useless extension candidates. Maximal degree in co-relation 7165. Up to 775 conditions per place. [2024-06-03 21:50:14,463 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 181 selfloop transitions, 45 changer transitions 0/228 dead transitions. [2024-06-03 21:50:14,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 228 transitions, 2939 flow [2024-06-03 21:50:14,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:50:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:50:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2024-06-03 21:50:14,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-03 21:50:14,464 INFO L175 Difference]: Start difference. First operand has 213 places, 202 transitions, 2295 flow. Second operand 12 states and 152 transitions. [2024-06-03 21:50:14,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 228 transitions, 2939 flow [2024-06-03 21:50:14,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 228 transitions, 2851 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-03 21:50:14,586 INFO L231 Difference]: Finished difference. Result has 216 places, 205 transitions, 2336 flow [2024-06-03 21:50:14,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2207, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2336, PETRI_PLACES=216, PETRI_TRANSITIONS=205} [2024-06-03 21:50:14,587 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 183 predicate places. [2024-06-03 21:50:14,587 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 205 transitions, 2336 flow [2024-06-03 21:50:14,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:50:14,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:50:14,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:50:14,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 21:50:14,588 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:50:14,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:50:14,588 INFO L85 PathProgramCache]: Analyzing trace with hash -427354394, now seen corresponding path program 8 times [2024-06-03 21:50:14,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:50:14,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495138346] [2024-06-03 21:50:14,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:50:14,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:50:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:50:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:50:25,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:50:25,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495138346] [2024-06-03 21:50:25,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495138346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:50:25,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:50:25,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:50:25,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473515294] [2024-06-03 21:50:25,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:50:25,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:50:25,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:50:25,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:50:25,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:50:25,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:50:25,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 205 transitions, 2336 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:50:25,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:50:25,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:50:25,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:50:25,735 INFO L124 PetriNetUnfolderBase]: 531/924 cut-off events. [2024-06-03 21:50:25,735 INFO L125 PetriNetUnfolderBase]: For 65460/65460 co-relation queries the response was YES. [2024-06-03 21:50:25,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7454 conditions, 924 events. 531/924 cut-off events. For 65460/65460 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4101 event pairs, 124 based on Foata normal form. 1/925 useless extension candidates. Maximal degree in co-relation 7358. Up to 816 conditions per place. [2024-06-03 21:50:25,744 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 178 selfloop transitions, 46 changer transitions 0/226 dead transitions. [2024-06-03 21:50:25,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 226 transitions, 3066 flow [2024-06-03 21:50:25,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:50:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:50:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2024-06-03 21:50:25,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2024-06-03 21:50:25,768 INFO L175 Difference]: Start difference. First operand has 216 places, 205 transitions, 2336 flow. Second operand 12 states and 144 transitions. [2024-06-03 21:50:25,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 226 transitions, 3066 flow [2024-06-03 21:50:25,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 226 transitions, 2963 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-03 21:50:25,920 INFO L231 Difference]: Finished difference. Result has 220 places, 209 transitions, 2374 flow [2024-06-03 21:50:25,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2233, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2374, PETRI_PLACES=220, PETRI_TRANSITIONS=209} [2024-06-03 21:50:25,921 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 187 predicate places. [2024-06-03 21:50:25,921 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 209 transitions, 2374 flow [2024-06-03 21:50:25,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:50:25,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:50:25,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:50:25,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 21:50:25,922 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:50:25,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:50:25,923 INFO L85 PathProgramCache]: Analyzing trace with hash -427360904, now seen corresponding path program 9 times [2024-06-03 21:50:25,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:50:25,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459013236] [2024-06-03 21:50:25,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:50:25,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:50:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:50:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:50:37,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:50:37,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459013236] [2024-06-03 21:50:37,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459013236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:50:37,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:50:37,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:50:37,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054078304] [2024-06-03 21:50:37,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:50:37,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:50:37,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:50:37,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:50:37,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:50:37,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:50:37,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 209 transitions, 2374 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:50:37,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:50:37,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:50:37,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:50:37,689 INFO L124 PetriNetUnfolderBase]: 529/921 cut-off events. [2024-06-03 21:50:37,689 INFO L125 PetriNetUnfolderBase]: For 66628/66628 co-relation queries the response was YES. [2024-06-03 21:50:37,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7413 conditions, 921 events. 529/921 cut-off events. For 66628/66628 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4082 event pairs, 124 based on Foata normal form. 1/922 useless extension candidates. Maximal degree in co-relation 7316. Up to 814 conditions per place. [2024-06-03 21:50:37,698 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 176 selfloop transitions, 47 changer transitions 0/225 dead transitions. [2024-06-03 21:50:37,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 225 transitions, 2960 flow [2024-06-03 21:50:37,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:50:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:50:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions. [2024-06-03 21:50:37,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3480392156862745 [2024-06-03 21:50:37,700 INFO L175 Difference]: Start difference. First operand has 220 places, 209 transitions, 2374 flow. Second operand 12 states and 142 transitions. [2024-06-03 21:50:37,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 225 transitions, 2960 flow [2024-06-03 21:50:37,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 225 transitions, 2861 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-03 21:50:37,867 INFO L231 Difference]: Finished difference. Result has 223 places, 209 transitions, 2374 flow [2024-06-03 21:50:37,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2275, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2374, PETRI_PLACES=223, PETRI_TRANSITIONS=209} [2024-06-03 21:50:37,868 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 190 predicate places. [2024-06-03 21:50:37,868 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 209 transitions, 2374 flow [2024-06-03 21:50:37,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:50:37,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:50:37,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:50:37,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 21:50:37,874 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:50:37,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:50:37,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1210211366, now seen corresponding path program 9 times [2024-06-03 21:50:37,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:50:37,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785308463] [2024-06-03 21:50:37,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:50:37,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:50:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:50:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:50:49,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:50:49,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785308463] [2024-06-03 21:50:49,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785308463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:50:49,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:50:49,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:50:49,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377080040] [2024-06-03 21:50:49,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:50:49,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:50:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:50:49,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:50:49,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:50:49,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:50:49,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 209 transitions, 2374 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:50:49,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:50:49,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:50:49,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:50:50,087 INFO L124 PetriNetUnfolderBase]: 507/898 cut-off events. [2024-06-03 21:50:50,087 INFO L125 PetriNetUnfolderBase]: For 68019/68019 co-relation queries the response was YES. [2024-06-03 21:50:50,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7270 conditions, 898 events. 507/898 cut-off events. For 68019/68019 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4051 event pairs, 116 based on Foata normal form. 1/899 useless extension candidates. Maximal degree in co-relation 7172. Up to 751 conditions per place. [2024-06-03 21:50:50,095 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 160 selfloop transitions, 35 changer transitions 0/224 dead transitions. [2024-06-03 21:50:50,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 224 transitions, 2802 flow [2024-06-03 21:50:50,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:50:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:50:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 148 transitions. [2024-06-03 21:50:50,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3627450980392157 [2024-06-03 21:50:50,096 INFO L175 Difference]: Start difference. First operand has 223 places, 209 transitions, 2374 flow. Second operand 12 states and 148 transitions. [2024-06-03 21:50:50,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 224 transitions, 2802 flow [2024-06-03 21:50:50,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 224 transitions, 2668 flow, removed 9 selfloop flow, removed 12 redundant places. [2024-06-03 21:50:50,241 INFO L231 Difference]: Finished difference. Result has 223 places, 209 transitions, 2315 flow [2024-06-03 21:50:50,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2315, PETRI_PLACES=223, PETRI_TRANSITIONS=209} [2024-06-03 21:50:50,242 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 190 predicate places. [2024-06-03 21:50:50,242 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 209 transitions, 2315 flow [2024-06-03 21:50:50,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-03 21:50:50,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:50:50,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:50:50,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 21:50:50,243 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:50:50,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:50:50,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1210457320, now seen corresponding path program 4 times [2024-06-03 21:50:50,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:50:50,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648923329] [2024-06-03 21:50:50,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:50:50,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:50:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:51:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:51:01,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:51:01,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648923329] [2024-06-03 21:51:01,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648923329] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:51:01,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:51:01,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:51:01,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703184096] [2024-06-03 21:51:01,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:51:01,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:51:01,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:51:01,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:51:01,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:51:01,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:51:01,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 209 transitions, 2315 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:01,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:51:01,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:51:01,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:51:02,222 INFO L124 PetriNetUnfolderBase]: 536/933 cut-off events. [2024-06-03 21:51:02,222 INFO L125 PetriNetUnfolderBase]: For 72790/72790 co-relation queries the response was YES. [2024-06-03 21:51:02,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7461 conditions, 933 events. 536/933 cut-off events. For 72790/72790 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4174 event pairs, 125 based on Foata normal form. 3/936 useless extension candidates. Maximal degree in co-relation 7362. Up to 790 conditions per place. [2024-06-03 21:51:02,231 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 180 selfloop transitions, 53 changer transitions 0/235 dead transitions. [2024-06-03 21:51:02,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 235 transitions, 2978 flow [2024-06-03 21:51:02,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-03 21:51:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-03 21:51:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 162 transitions. [2024-06-03 21:51:02,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3403361344537815 [2024-06-03 21:51:02,238 INFO L175 Difference]: Start difference. First operand has 223 places, 209 transitions, 2315 flow. Second operand 14 states and 162 transitions. [2024-06-03 21:51:02,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 235 transitions, 2978 flow [2024-06-03 21:51:02,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 235 transitions, 2879 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-03 21:51:02,391 INFO L231 Difference]: Finished difference. Result has 226 places, 212 transitions, 2362 flow [2024-06-03 21:51:02,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2216, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2362, PETRI_PLACES=226, PETRI_TRANSITIONS=212} [2024-06-03 21:51:02,391 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 193 predicate places. [2024-06-03 21:51:02,391 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 212 transitions, 2362 flow [2024-06-03 21:51:02,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:02,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:51:02,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:51:02,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 21:51:02,392 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:51:02,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:51:02,393 INFO L85 PathProgramCache]: Analyzing trace with hash -427123754, now seen corresponding path program 10 times [2024-06-03 21:51:02,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:51:02,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833401915] [2024-06-03 21:51:02,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:51:02,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:51:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:51:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:51:14,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:51:14,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833401915] [2024-06-03 21:51:14,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833401915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:51:14,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:51:14,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:51:14,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202700326] [2024-06-03 21:51:14,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:51:14,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:51:14,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:51:14,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:51:14,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:51:14,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:51:14,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 212 transitions, 2362 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:14,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:51:14,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:51:14,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:51:14,750 INFO L124 PetriNetUnfolderBase]: 534/930 cut-off events. [2024-06-03 21:51:14,750 INFO L125 PetriNetUnfolderBase]: For 71406/71406 co-relation queries the response was YES. [2024-06-03 21:51:14,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7490 conditions, 930 events. 534/930 cut-off events. For 71406/71406 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4156 event pairs, 124 based on Foata normal form. 1/931 useless extension candidates. Maximal degree in co-relation 7390. Up to 824 conditions per place. [2024-06-03 21:51:14,759 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 176 selfloop transitions, 50 changer transitions 0/228 dead transitions. [2024-06-03 21:51:14,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 228 transitions, 2854 flow [2024-06-03 21:51:14,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-03 21:51:14,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-03 21:51:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 147 transitions. [2024-06-03 21:51:14,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.332579185520362 [2024-06-03 21:51:14,760 INFO L175 Difference]: Start difference. First operand has 226 places, 212 transitions, 2362 flow. Second operand 13 states and 147 transitions. [2024-06-03 21:51:14,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 228 transitions, 2854 flow [2024-06-03 21:51:14,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 228 transitions, 2745 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-03 21:51:14,914 INFO L231 Difference]: Finished difference. Result has 229 places, 212 transitions, 2358 flow [2024-06-03 21:51:14,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2253, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2358, PETRI_PLACES=229, PETRI_TRANSITIONS=212} [2024-06-03 21:51:14,914 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 196 predicate places. [2024-06-03 21:51:14,915 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 212 transitions, 2358 flow [2024-06-03 21:51:14,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:14,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:51:14,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:51:14,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 21:51:14,915 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:51:14,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:51:14,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1210448950, now seen corresponding path program 5 times [2024-06-03 21:51:14,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:51:14,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993275723] [2024-06-03 21:51:14,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:51:14,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:51:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:51:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:51:25,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:51:25,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993275723] [2024-06-03 21:51:25,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993275723] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:51:25,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:51:25,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:51:25,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256920169] [2024-06-03 21:51:25,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:51:25,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:51:25,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:51:25,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:51:25,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:51:25,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:51:25,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 212 transitions, 2358 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:25,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:51:25,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:51:25,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:51:26,274 INFO L124 PetriNetUnfolderBase]: 528/921 cut-off events. [2024-06-03 21:51:26,275 INFO L125 PetriNetUnfolderBase]: For 72376/72376 co-relation queries the response was YES. [2024-06-03 21:51:26,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7298 conditions, 921 events. 528/921 cut-off events. For 72376/72376 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4092 event pairs, 123 based on Foata normal form. 3/924 useless extension candidates. Maximal degree in co-relation 7197. Up to 783 conditions per place. [2024-06-03 21:51:26,281 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 183 selfloop transitions, 50 changer transitions 0/235 dead transitions. [2024-06-03 21:51:26,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 235 transitions, 2887 flow [2024-06-03 21:51:26,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-03 21:51:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-03 21:51:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 157 transitions. [2024-06-03 21:51:26,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3552036199095023 [2024-06-03 21:51:26,283 INFO L175 Difference]: Start difference. First operand has 229 places, 212 transitions, 2358 flow. Second operand 13 states and 157 transitions. [2024-06-03 21:51:26,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 235 transitions, 2887 flow [2024-06-03 21:51:26,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 235 transitions, 2750 flow, removed 5 selfloop flow, removed 14 redundant places. [2024-06-03 21:51:26,415 INFO L231 Difference]: Finished difference. Result has 228 places, 212 transitions, 2327 flow [2024-06-03 21:51:26,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2221, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2327, PETRI_PLACES=228, PETRI_TRANSITIONS=212} [2024-06-03 21:51:26,416 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 195 predicate places. [2024-06-03 21:51:26,416 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 212 transitions, 2327 flow [2024-06-03 21:51:26,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:26,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:51:26,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:51:26,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 21:51:26,417 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:51:26,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:51:26,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1956790796, now seen corresponding path program 10 times [2024-06-03 21:51:26,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:51:26,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195954869] [2024-06-03 21:51:26,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:51:26,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:51:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:51:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:51:35,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:51:35,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195954869] [2024-06-03 21:51:35,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195954869] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:51:35,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:51:35,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:51:35,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130469298] [2024-06-03 21:51:35,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:51:35,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:51:35,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:51:35,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:51:35,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:51:35,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:51:35,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 212 transitions, 2327 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:35,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:51:35,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:51:35,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:51:36,111 INFO L124 PetriNetUnfolderBase]: 511/906 cut-off events. [2024-06-03 21:51:36,111 INFO L125 PetriNetUnfolderBase]: For 75185/75186 co-relation queries the response was YES. [2024-06-03 21:51:36,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7318 conditions, 906 events. 511/906 cut-off events. For 75185/75186 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4135 event pairs, 101 based on Foata normal form. 1/906 useless extension candidates. Maximal degree in co-relation 7216. Up to 737 conditions per place. [2024-06-03 21:51:36,121 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 158 selfloop transitions, 43 changer transitions 0/230 dead transitions. [2024-06-03 21:51:36,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 230 transitions, 2809 flow [2024-06-03 21:51:36,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:51:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:51:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-03 21:51:36,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-03 21:51:36,123 INFO L175 Difference]: Start difference. First operand has 228 places, 212 transitions, 2327 flow. Second operand 9 states and 119 transitions. [2024-06-03 21:51:36,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 230 transitions, 2809 flow [2024-06-03 21:51:36,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 230 transitions, 2688 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-06-03 21:51:36,295 INFO L231 Difference]: Finished difference. Result has 224 places, 214 transitions, 2351 flow [2024-06-03 21:51:36,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2206, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2351, PETRI_PLACES=224, PETRI_TRANSITIONS=214} [2024-06-03 21:51:36,296 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 191 predicate places. [2024-06-03 21:51:36,296 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 214 transitions, 2351 flow [2024-06-03 21:51:36,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:36,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:51:36,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:51:36,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 21:51:36,297 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:51:36,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:51:36,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1956670640, now seen corresponding path program 11 times [2024-06-03 21:51:36,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:51:36,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610319013] [2024-06-03 21:51:36,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:51:36,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:51:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:51:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:51:45,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:51:45,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610319013] [2024-06-03 21:51:45,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610319013] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:51:45,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:51:45,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:51:45,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61541308] [2024-06-03 21:51:45,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:51:45,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:51:45,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:51:45,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:51:45,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:51:45,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:51:45,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 214 transitions, 2351 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:45,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:51:45,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:51:45,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:51:45,817 INFO L124 PetriNetUnfolderBase]: 534/930 cut-off events. [2024-06-03 21:51:45,818 INFO L125 PetriNetUnfolderBase]: For 74224/74224 co-relation queries the response was YES. [2024-06-03 21:51:45,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7478 conditions, 930 events. 534/930 cut-off events. For 74224/74224 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4174 event pairs, 96 based on Foata normal form. 1/931 useless extension candidates. Maximal degree in co-relation 7375. Up to 709 conditions per place. [2024-06-03 21:51:45,825 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 134 selfloop transitions, 95 changer transitions 0/231 dead transitions. [2024-06-03 21:51:45,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 231 transitions, 2977 flow [2024-06-03 21:51:45,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:51:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:51:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 21:51:45,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-03 21:51:45,828 INFO L175 Difference]: Start difference. First operand has 224 places, 214 transitions, 2351 flow. Second operand 9 states and 117 transitions. [2024-06-03 21:51:45,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 231 transitions, 2977 flow [2024-06-03 21:51:45,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 231 transitions, 2882 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-03 21:51:45,993 INFO L231 Difference]: Finished difference. Result has 226 places, 216 transitions, 2480 flow [2024-06-03 21:51:45,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2258, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2480, PETRI_PLACES=226, PETRI_TRANSITIONS=216} [2024-06-03 21:51:45,993 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 193 predicate places. [2024-06-03 21:51:45,994 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 216 transitions, 2480 flow [2024-06-03 21:51:45,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:45,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:51:45,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:51:45,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 21:51:45,994 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:51:45,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:51:45,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1956670826, now seen corresponding path program 11 times [2024-06-03 21:51:45,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:51:45,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635294329] [2024-06-03 21:51:45,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:51:46,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:51:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:51:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:51:54,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:51:54,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635294329] [2024-06-03 21:51:54,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635294329] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:51:54,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:51:54,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:51:54,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428359958] [2024-06-03 21:51:54,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:51:54,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:51:54,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:51:54,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:51:54,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:51:54,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:51:54,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 216 transitions, 2480 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:54,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:51:54,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:51:54,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:51:55,282 INFO L124 PetriNetUnfolderBase]: 519/919 cut-off events. [2024-06-03 21:51:55,282 INFO L125 PetriNetUnfolderBase]: For 80856/80858 co-relation queries the response was YES. [2024-06-03 21:51:55,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7596 conditions, 919 events. 519/919 cut-off events. For 80856/80858 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4220 event pairs, 91 based on Foata normal form. 1/917 useless extension candidates. Maximal degree in co-relation 7492. Up to 659 conditions per place. [2024-06-03 21:51:55,291 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 122 selfloop transitions, 83 changer transitions 0/235 dead transitions. [2024-06-03 21:51:55,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 235 transitions, 3116 flow [2024-06-03 21:51:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:51:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:51:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-03 21:51:55,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4019607843137255 [2024-06-03 21:51:55,292 INFO L175 Difference]: Start difference. First operand has 226 places, 216 transitions, 2480 flow. Second operand 9 states and 123 transitions. [2024-06-03 21:51:55,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 235 transitions, 3116 flow [2024-06-03 21:51:55,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 235 transitions, 2955 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-03 21:51:55,457 INFO L231 Difference]: Finished difference. Result has 225 places, 220 transitions, 2585 flow [2024-06-03 21:51:55,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2325, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2585, PETRI_PLACES=225, PETRI_TRANSITIONS=220} [2024-06-03 21:51:55,458 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 192 predicate places. [2024-06-03 21:51:55,458 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 220 transitions, 2585 flow [2024-06-03 21:51:55,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:55,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:51:55,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:51:55,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 21:51:55,459 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:51:55,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:51:55,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1359300669, now seen corresponding path program 1 times [2024-06-03 21:51:55,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:51:55,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214769253] [2024-06-03 21:51:55,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:51:55,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:51:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:52:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:52:06,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:52:06,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214769253] [2024-06-03 21:52:06,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214769253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:52:06,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:52:06,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:52:06,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390371720] [2024-06-03 21:52:06,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:52:06,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:52:06,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:52:06,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:52:06,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:52:06,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:52:06,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 220 transitions, 2585 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:52:06,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:52:06,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:52:06,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:52:07,753 INFO L124 PetriNetUnfolderBase]: 576/998 cut-off events. [2024-06-03 21:52:07,754 INFO L125 PetriNetUnfolderBase]: For 81656/81656 co-relation queries the response was YES. [2024-06-03 21:52:07,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8107 conditions, 998 events. 576/998 cut-off events. For 81656/81656 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4551 event pairs, 105 based on Foata normal form. 3/1001 useless extension candidates. Maximal degree in co-relation 8006. Up to 641 conditions per place. [2024-06-03 21:52:07,763 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 182 selfloop transitions, 69 changer transitions 0/253 dead transitions. [2024-06-03 21:52:07,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 253 transitions, 3551 flow [2024-06-03 21:52:07,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:52:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:52:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-03 21:52:07,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4037433155080214 [2024-06-03 21:52:07,779 INFO L175 Difference]: Start difference. First operand has 225 places, 220 transitions, 2585 flow. Second operand 11 states and 151 transitions. [2024-06-03 21:52:07,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 253 transitions, 3551 flow [2024-06-03 21:52:07,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 253 transitions, 3430 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-03 21:52:07,925 INFO L231 Difference]: Finished difference. Result has 230 places, 228 transitions, 2723 flow [2024-06-03 21:52:07,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2476, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2723, PETRI_PLACES=230, PETRI_TRANSITIONS=228} [2024-06-03 21:52:07,925 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 197 predicate places. [2024-06-03 21:52:07,926 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 228 transitions, 2723 flow [2024-06-03 21:52:07,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:52:07,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:52:07,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:52:07,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 21:52:07,926 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:52:07,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:52:07,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1082945408, now seen corresponding path program 12 times [2024-06-03 21:52:07,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:52:07,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037209700] [2024-06-03 21:52:07,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:52:07,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:52:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:52:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:52:15,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:52:15,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037209700] [2024-06-03 21:52:15,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037209700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:52:15,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:52:15,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:52:15,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082185569] [2024-06-03 21:52:15,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:52:15,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:52:15,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:52:15,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:52:15,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:52:15,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:52:15,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 228 transitions, 2723 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:52:15,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:52:15,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:52:15,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:52:16,240 INFO L124 PetriNetUnfolderBase]: 584/1012 cut-off events. [2024-06-03 21:52:16,240 INFO L125 PetriNetUnfolderBase]: For 77550/77550 co-relation queries the response was YES. [2024-06-03 21:52:16,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8355 conditions, 1012 events. 584/1012 cut-off events. For 77550/77550 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4596 event pairs, 102 based on Foata normal form. 1/1013 useless extension candidates. Maximal degree in co-relation 8253. Up to 787 conditions per place. [2024-06-03 21:52:16,249 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 152 selfloop transitions, 92 changer transitions 0/246 dead transitions. [2024-06-03 21:52:16,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 246 transitions, 3503 flow [2024-06-03 21:52:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:52:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:52:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-06-03 21:52:16,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4084967320261438 [2024-06-03 21:52:16,250 INFO L175 Difference]: Start difference. First operand has 230 places, 228 transitions, 2723 flow. Second operand 9 states and 125 transitions. [2024-06-03 21:52:16,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 246 transitions, 3503 flow [2024-06-03 21:52:16,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 246 transitions, 3441 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-03 21:52:16,396 INFO L231 Difference]: Finished difference. Result has 234 places, 232 transitions, 2902 flow [2024-06-03 21:52:16,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2902, PETRI_PLACES=234, PETRI_TRANSITIONS=232} [2024-06-03 21:52:16,397 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 201 predicate places. [2024-06-03 21:52:16,397 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 232 transitions, 2902 flow [2024-06-03 21:52:16,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:52:16,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:52:16,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:52:16,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 21:52:16,398 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:52:16,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:52:16,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1082945160, now seen corresponding path program 6 times [2024-06-03 21:52:16,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:52:16,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590944895] [2024-06-03 21:52:16,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:52:16,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:52:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:52:24,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:52:24,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:52:24,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590944895] [2024-06-03 21:52:24,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590944895] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:52:24,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:52:24,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:52:24,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916882203] [2024-06-03 21:52:24,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:52:24,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:52:24,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:52:24,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:52:24,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:52:24,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:52:24,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 232 transitions, 2902 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:52:24,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:52:24,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:52:24,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:52:24,877 INFO L124 PetriNetUnfolderBase]: 603/1043 cut-off events. [2024-06-03 21:52:24,877 INFO L125 PetriNetUnfolderBase]: For 86615/86615 co-relation queries the response was YES. [2024-06-03 21:52:24,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8806 conditions, 1043 events. 603/1043 cut-off events. For 86615/86615 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4788 event pairs, 184 based on Foata normal form. 3/1046 useless extension candidates. Maximal degree in co-relation 8702. Up to 875 conditions per place. [2024-06-03 21:52:24,886 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 207 selfloop transitions, 46 changer transitions 0/255 dead transitions. [2024-06-03 21:52:24,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 255 transitions, 3675 flow [2024-06-03 21:52:24,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:52:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:52:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 21:52:24,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36470588235294116 [2024-06-03 21:52:24,887 INFO L175 Difference]: Start difference. First operand has 234 places, 232 transitions, 2902 flow. Second operand 10 states and 124 transitions. [2024-06-03 21:52:24,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 255 transitions, 3675 flow [2024-06-03 21:52:25,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 255 transitions, 3547 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-03 21:52:25,048 INFO L231 Difference]: Finished difference. Result has 239 places, 239 transitions, 3041 flow [2024-06-03 21:52:25,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2779, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3041, PETRI_PLACES=239, PETRI_TRANSITIONS=239} [2024-06-03 21:52:25,049 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 206 predicate places. [2024-06-03 21:52:25,049 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 239 transitions, 3041 flow [2024-06-03 21:52:25,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:52:25,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:52:25,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:52:25,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 21:52:25,050 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:52:25,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:52:25,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1952029010, now seen corresponding path program 13 times [2024-06-03 21:52:25,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:52:25,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377205955] [2024-06-03 21:52:25,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:52:25,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:52:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:52:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:52:33,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:52:33,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377205955] [2024-06-03 21:52:33,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377205955] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:52:33,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:52:33,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:52:33,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447522013] [2024-06-03 21:52:33,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:52:33,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:52:33,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:52:33,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:52:33,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:52:33,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:52:33,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 239 transitions, 3041 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:52:33,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:52:33,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:52:33,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:52:34,210 INFO L124 PetriNetUnfolderBase]: 601/1040 cut-off events. [2024-06-03 21:52:34,210 INFO L125 PetriNetUnfolderBase]: For 79605/79605 co-relation queries the response was YES. [2024-06-03 21:52:34,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8752 conditions, 1040 events. 601/1040 cut-off events. For 79605/79605 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4757 event pairs, 105 based on Foata normal form. 1/1041 useless extension candidates. Maximal degree in co-relation 8647. Up to 816 conditions per place. [2024-06-03 21:52:34,221 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 161 selfloop transitions, 89 changer transitions 0/252 dead transitions. [2024-06-03 21:52:34,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 252 transitions, 3679 flow [2024-06-03 21:52:34,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:52:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:52:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-03 21:52:34,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790849673202614 [2024-06-03 21:52:34,224 INFO L175 Difference]: Start difference. First operand has 239 places, 239 transitions, 3041 flow. Second operand 9 states and 116 transitions. [2024-06-03 21:52:34,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 252 transitions, 3679 flow [2024-06-03 21:52:34,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 252 transitions, 3593 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-03 21:52:34,399 INFO L231 Difference]: Finished difference. Result has 242 places, 239 transitions, 3144 flow [2024-06-03 21:52:34,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2955, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3144, PETRI_PLACES=242, PETRI_TRANSITIONS=239} [2024-06-03 21:52:34,400 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 209 predicate places. [2024-06-03 21:52:34,400 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 239 transitions, 3144 flow [2024-06-03 21:52:34,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:52:34,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:52:34,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:52:34,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 21:52:34,401 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:52:34,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:52:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1794847348, now seen corresponding path program 12 times [2024-06-03 21:52:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:52:34,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167813362] [2024-06-03 21:52:34,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:52:34,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:52:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:52:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:52:43,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:52:43,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167813362] [2024-06-03 21:52:43,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167813362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:52:43,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:52:43,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:52:43,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644904533] [2024-06-03 21:52:43,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:52:43,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:52:43,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:52:43,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:52:43,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:52:43,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:52:43,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 239 transitions, 3144 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:52:43,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:52:43,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:52:43,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:52:44,120 INFO L124 PetriNetUnfolderBase]: 580/1019 cut-off events. [2024-06-03 21:52:44,120 INFO L125 PetriNetUnfolderBase]: For 83151/83151 co-relation queries the response was YES. [2024-06-03 21:52:44,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8816 conditions, 1019 events. 580/1019 cut-off events. For 83151/83151 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4722 event pairs, 74 based on Foata normal form. 1/1020 useless extension candidates. Maximal degree in co-relation 8710. Up to 755 conditions per place. [2024-06-03 21:52:44,131 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 140 selfloop transitions, 82 changer transitions 0/254 dead transitions. [2024-06-03 21:52:44,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 254 transitions, 3766 flow [2024-06-03 21:52:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:52:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:52:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-03 21:52:44,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3954248366013072 [2024-06-03 21:52:44,139 INFO L175 Difference]: Start difference. First operand has 242 places, 239 transitions, 3144 flow. Second operand 9 states and 121 transitions. [2024-06-03 21:52:44,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 254 transitions, 3766 flow [2024-06-03 21:52:44,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 254 transitions, 3553 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-03 21:52:44,308 INFO L231 Difference]: Finished difference. Result has 241 places, 241 transitions, 3148 flow [2024-06-03 21:52:44,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2935, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3148, PETRI_PLACES=241, PETRI_TRANSITIONS=241} [2024-06-03 21:52:44,309 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 208 predicate places. [2024-06-03 21:52:44,310 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 241 transitions, 3148 flow [2024-06-03 21:52:44,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:52:44,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:52:44,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:52:44,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 21:52:44,310 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:52:44,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:52:44,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1967583192, now seen corresponding path program 7 times [2024-06-03 21:52:44,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:52:44,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464420574] [2024-06-03 21:52:44,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:52:44,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:52:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:52:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:52:52,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:52:52,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464420574] [2024-06-03 21:52:52,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464420574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:52:52,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:52:52,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:52:52,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233481621] [2024-06-03 21:52:52,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:52:52,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:52:52,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:52:52,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:52:52,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:52:52,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:52:52,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 241 transitions, 3148 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:52:52,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:52:52,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:52:52,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:52:53,335 INFO L124 PetriNetUnfolderBase]: 628/1084 cut-off events. [2024-06-03 21:52:53,335 INFO L125 PetriNetUnfolderBase]: For 86870/86870 co-relation queries the response was YES. [2024-06-03 21:52:53,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9251 conditions, 1084 events. 628/1084 cut-off events. For 86870/86870 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5006 event pairs, 118 based on Foata normal form. 3/1087 useless extension candidates. Maximal degree in co-relation 9146. Up to 795 conditions per place. [2024-06-03 21:52:53,344 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 180 selfloop transitions, 84 changer transitions 0/266 dead transitions. [2024-06-03 21:52:53,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 266 transitions, 4031 flow [2024-06-03 21:52:53,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:52:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:52:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-03 21:52:53,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2024-06-03 21:52:53,345 INFO L175 Difference]: Start difference. First operand has 241 places, 241 transitions, 3148 flow. Second operand 9 states and 120 transitions. [2024-06-03 21:52:53,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 266 transitions, 4031 flow [2024-06-03 21:52:53,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 266 transitions, 3869 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-03 21:52:53,546 INFO L231 Difference]: Finished difference. Result has 242 places, 247 transitions, 3250 flow [2024-06-03 21:52:53,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2994, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3250, PETRI_PLACES=242, PETRI_TRANSITIONS=247} [2024-06-03 21:52:53,547 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 209 predicate places. [2024-06-03 21:52:53,547 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 247 transitions, 3250 flow [2024-06-03 21:52:53,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:52:53,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:52:53,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:52:53,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 21:52:53,548 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:52:53,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:52:53,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1967343934, now seen corresponding path program 14 times [2024-06-03 21:52:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:52:53,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965431366] [2024-06-03 21:52:53,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:52:53,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:52:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:53:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:53:01,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:53:01,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965431366] [2024-06-03 21:53:01,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965431366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:53:01,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:53:01,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:53:01,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413607329] [2024-06-03 21:53:01,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:53:01,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:53:01,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:53:01,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:53:01,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:53:02,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:53:02,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 247 transitions, 3250 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:02,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:53:02,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:53:02,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:53:02,481 INFO L124 PetriNetUnfolderBase]: 641/1103 cut-off events. [2024-06-03 21:53:02,481 INFO L125 PetriNetUnfolderBase]: For 84475/84475 co-relation queries the response was YES. [2024-06-03 21:53:02,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9436 conditions, 1103 events. 641/1103 cut-off events. For 84475/84475 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5089 event pairs, 84 based on Foata normal form. 1/1104 useless extension candidates. Maximal degree in co-relation 9332. Up to 876 conditions per place. [2024-06-03 21:53:02,493 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 176 selfloop transitions, 88 changer transitions 0/266 dead transitions. [2024-06-03 21:53:02,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 266 transitions, 4195 flow [2024-06-03 21:53:02,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:53:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:53:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 21:53:02,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-03 21:53:02,496 INFO L175 Difference]: Start difference. First operand has 242 places, 247 transitions, 3250 flow. Second operand 9 states and 117 transitions. [2024-06-03 21:53:02,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 266 transitions, 4195 flow [2024-06-03 21:53:02,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 266 transitions, 4056 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-03 21:53:02,689 INFO L231 Difference]: Finished difference. Result has 245 places, 253 transitions, 3376 flow [2024-06-03 21:53:02,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3117, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3376, PETRI_PLACES=245, PETRI_TRANSITIONS=253} [2024-06-03 21:53:02,689 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 212 predicate places. [2024-06-03 21:53:02,690 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 253 transitions, 3376 flow [2024-06-03 21:53:02,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:02,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:53:02,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:53:02,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 21:53:02,690 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:53:02,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:53:02,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1779301970, now seen corresponding path program 15 times [2024-06-03 21:53:02,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:53:02,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064168640] [2024-06-03 21:53:02,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:53:02,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:53:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:53:11,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-03 21:53:11,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:53:11,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064168640] [2024-06-03 21:53:11,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064168640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:53:11,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:53:11,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:53:11,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029673557] [2024-06-03 21:53:11,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:53:11,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:53:11,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:53:11,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:53:11,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:53:11,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:53:11,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 253 transitions, 3376 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:11,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:53:11,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:53:11,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:53:11,685 INFO L124 PetriNetUnfolderBase]: 639/1100 cut-off events. [2024-06-03 21:53:11,685 INFO L125 PetriNetUnfolderBase]: For 83421/83421 co-relation queries the response was YES. [2024-06-03 21:53:11,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9354 conditions, 1100 events. 639/1100 cut-off events. For 83421/83421 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5073 event pairs, 78 based on Foata normal form. 1/1101 useless extension candidates. Maximal degree in co-relation 9250. Up to 874 conditions per place. [2024-06-03 21:53:11,696 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 165 selfloop transitions, 98 changer transitions 0/265 dead transitions. [2024-06-03 21:53:11,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 265 transitions, 4138 flow [2024-06-03 21:53:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:53:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:53:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 21:53:11,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-03 21:53:11,698 INFO L175 Difference]: Start difference. First operand has 245 places, 253 transitions, 3376 flow. Second operand 9 states and 114 transitions. [2024-06-03 21:53:11,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 265 transitions, 4138 flow [2024-06-03 21:53:11,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 265 transitions, 4004 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-03 21:53:11,866 INFO L231 Difference]: Finished difference. Result has 249 places, 253 transitions, 3450 flow [2024-06-03 21:53:11,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3246, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3450, PETRI_PLACES=249, PETRI_TRANSITIONS=253} [2024-06-03 21:53:11,866 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 216 predicate places. [2024-06-03 21:53:11,867 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 253 transitions, 3450 flow [2024-06-03 21:53:11,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:11,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:53:11,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:53:11,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 21:53:11,867 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:53:11,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:53:11,868 INFO L85 PathProgramCache]: Analyzing trace with hash -910224630, now seen corresponding path program 8 times [2024-06-03 21:53:11,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:53:11,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726565076] [2024-06-03 21:53:11,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:53:11,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:53:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:53:19,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-03 21:53:19,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:53:19,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726565076] [2024-06-03 21:53:19,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726565076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:53:19,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:53:19,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:53:19,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812601788] [2024-06-03 21:53:19,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:53:19,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:53:19,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:53:19,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:53:19,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:53:19,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:53:19,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 253 transitions, 3450 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:19,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:53:19,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:53:19,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:53:20,113 INFO L124 PetriNetUnfolderBase]: 648/1117 cut-off events. [2024-06-03 21:53:20,113 INFO L125 PetriNetUnfolderBase]: For 86670/86670 co-relation queries the response was YES. [2024-06-03 21:53:20,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9474 conditions, 1117 events. 648/1117 cut-off events. For 86670/86670 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5219 event pairs, 186 based on Foata normal form. 3/1120 useless extension candidates. Maximal degree in co-relation 9370. Up to 923 conditions per place. [2024-06-03 21:53:20,124 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 227 selfloop transitions, 47 changer transitions 0/276 dead transitions. [2024-06-03 21:53:20,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 276 transitions, 4314 flow [2024-06-03 21:53:20,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:53:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:53:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-03 21:53:20,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3764705882352941 [2024-06-03 21:53:20,125 INFO L175 Difference]: Start difference. First operand has 249 places, 253 transitions, 3450 flow. Second operand 10 states and 128 transitions. [2024-06-03 21:53:20,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 276 transitions, 4314 flow [2024-06-03 21:53:20,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 276 transitions, 4097 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-03 21:53:20,329 INFO L231 Difference]: Finished difference. Result has 250 places, 256 transitions, 3370 flow [2024-06-03 21:53:20,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3237, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3370, PETRI_PLACES=250, PETRI_TRANSITIONS=256} [2024-06-03 21:53:20,330 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 217 predicate places. [2024-06-03 21:53:20,330 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 256 transitions, 3370 flow [2024-06-03 21:53:20,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:20,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:53:20,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:53:20,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 21:53:20,331 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:53:20,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:53:20,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1967337424, now seen corresponding path program 16 times [2024-06-03 21:53:20,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:53:20,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810045723] [2024-06-03 21:53:20,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:53:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:53:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:53:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:53:28,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:53:28,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810045723] [2024-06-03 21:53:28,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810045723] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:53:28,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:53:28,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:53:28,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065610193] [2024-06-03 21:53:28,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:53:28,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:53:28,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:53:28,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:53:28,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:53:29,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:53:29,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 256 transitions, 3370 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:29,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:53:29,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:53:29,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:53:29,560 INFO L124 PetriNetUnfolderBase]: 646/1112 cut-off events. [2024-06-03 21:53:29,560 INFO L125 PetriNetUnfolderBase]: For 82094/82094 co-relation queries the response was YES. [2024-06-03 21:53:29,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9313 conditions, 1112 events. 646/1112 cut-off events. For 82094/82094 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5138 event pairs, 80 based on Foata normal form. 1/1113 useless extension candidates. Maximal degree in co-relation 9209. Up to 887 conditions per place. [2024-06-03 21:53:29,571 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 175 selfloop transitions, 90 changer transitions 0/267 dead transitions. [2024-06-03 21:53:29,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 267 transitions, 4030 flow [2024-06-03 21:53:29,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:53:29,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:53:29,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 21:53:29,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-03 21:53:29,574 INFO L175 Difference]: Start difference. First operand has 250 places, 256 transitions, 3370 flow. Second operand 9 states and 114 transitions. [2024-06-03 21:53:29,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 267 transitions, 4030 flow [2024-06-03 21:53:29,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 267 transitions, 3938 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-03 21:53:29,743 INFO L231 Difference]: Finished difference. Result has 253 places, 256 transitions, 3466 flow [2024-06-03 21:53:29,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3278, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3466, PETRI_PLACES=253, PETRI_TRANSITIONS=256} [2024-06-03 21:53:29,744 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 220 predicate places. [2024-06-03 21:53:29,744 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 256 transitions, 3466 flow [2024-06-03 21:53:29,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:29,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:53:29,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:53:29,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 21:53:29,745 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:53:29,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:53:29,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1779532362, now seen corresponding path program 9 times [2024-06-03 21:53:29,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:53:29,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111297253] [2024-06-03 21:53:29,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:53:29,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:53:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:53:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:53:38,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:53:38,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111297253] [2024-06-03 21:53:38,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111297253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:53:38,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:53:38,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:53:38,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400439332] [2024-06-03 21:53:38,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:53:38,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:53:38,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:53:38,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:53:38,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:53:38,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:53:38,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 256 transitions, 3466 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:38,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:53:38,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:53:38,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:53:38,680 INFO L124 PetriNetUnfolderBase]: 640/1106 cut-off events. [2024-06-03 21:53:38,681 INFO L125 PetriNetUnfolderBase]: For 83681/83681 co-relation queries the response was YES. [2024-06-03 21:53:38,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9242 conditions, 1106 events. 640/1106 cut-off events. For 83681/83681 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5137 event pairs, 116 based on Foata normal form. 3/1109 useless extension candidates. Maximal degree in co-relation 9138. Up to 814 conditions per place. [2024-06-03 21:53:38,689 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 195 selfloop transitions, 79 changer transitions 0/276 dead transitions. [2024-06-03 21:53:38,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 276 transitions, 4195 flow [2024-06-03 21:53:38,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:53:38,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:53:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-03 21:53:38,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4019607843137255 [2024-06-03 21:53:38,690 INFO L175 Difference]: Start difference. First operand has 253 places, 256 transitions, 3466 flow. Second operand 9 states and 123 transitions. [2024-06-03 21:53:38,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 276 transitions, 4195 flow [2024-06-03 21:53:38,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 276 transitions, 3994 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-03 21:53:38,872 INFO L231 Difference]: Finished difference. Result has 253 places, 256 transitions, 3435 flow [2024-06-03 21:53:38,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3267, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3435, PETRI_PLACES=253, PETRI_TRANSITIONS=256} [2024-06-03 21:53:38,873 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 220 predicate places. [2024-06-03 21:53:38,873 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 256 transitions, 3435 flow [2024-06-03 21:53:38,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:38,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:53:38,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:53:38,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 21:53:38,874 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:53:38,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:53:38,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1779539306, now seen corresponding path program 13 times [2024-06-03 21:53:38,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:53:38,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463386182] [2024-06-03 21:53:38,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:53:38,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:53:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:53:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:53:47,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:53:47,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463386182] [2024-06-03 21:53:47,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463386182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:53:47,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:53:47,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:53:47,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822361351] [2024-06-03 21:53:47,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:53:47,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:53:47,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:53:47,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:53:47,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:53:47,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:53:47,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 256 transitions, 3435 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:47,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:53:47,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:53:47,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:53:48,018 INFO L124 PetriNetUnfolderBase]: 617/1082 cut-off events. [2024-06-03 21:53:48,020 INFO L125 PetriNetUnfolderBase]: For 81572/81572 co-relation queries the response was YES. [2024-06-03 21:53:48,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9141 conditions, 1082 events. 617/1082 cut-off events. For 81572/81572 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5111 event pairs, 79 based on Foata normal form. 1/1083 useless extension candidates. Maximal degree in co-relation 9037. Up to 811 conditions per place. [2024-06-03 21:53:48,030 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 154 selfloop transitions, 80 changer transitions 0/269 dead transitions. [2024-06-03 21:53:48,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 269 transitions, 4075 flow [2024-06-03 21:53:48,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:53:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:53:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-03 21:53:48,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-03 21:53:48,033 INFO L175 Difference]: Start difference. First operand has 253 places, 256 transitions, 3435 flow. Second operand 9 states and 119 transitions. [2024-06-03 21:53:48,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 269 transitions, 4075 flow [2024-06-03 21:53:48,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 269 transitions, 3882 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 21:53:48,196 INFO L231 Difference]: Finished difference. Result has 253 places, 258 transitions, 3452 flow [2024-06-03 21:53:48,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3244, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3452, PETRI_PLACES=253, PETRI_TRANSITIONS=258} [2024-06-03 21:53:48,196 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 220 predicate places. [2024-06-03 21:53:48,197 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 258 transitions, 3452 flow [2024-06-03 21:53:48,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:48,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:53:48,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:53:48,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 21:53:48,197 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:53:48,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:53:48,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1690173642, now seen corresponding path program 1 times [2024-06-03 21:53:48,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:53:48,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414136800] [2024-06-03 21:53:48,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:53:48,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:53:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:53:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:53:56,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:53:56,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414136800] [2024-06-03 21:53:56,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414136800] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:53:56,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:53:56,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:53:56,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129064531] [2024-06-03 21:53:56,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:53:56,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:53:56,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:53:56,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:53:56,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:53:56,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:53:56,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 258 transitions, 3452 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:56,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:53:56,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:53:56,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:53:56,888 INFO L124 PetriNetUnfolderBase]: 598/1059 cut-off events. [2024-06-03 21:53:56,888 INFO L125 PetriNetUnfolderBase]: For 80925/80930 co-relation queries the response was YES. [2024-06-03 21:53:56,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8777 conditions, 1059 events. 598/1059 cut-off events. For 80925/80930 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5098 event pairs, 165 based on Foata normal form. 7/1060 useless extension candidates. Maximal degree in co-relation 8673. Up to 926 conditions per place. [2024-06-03 21:53:56,899 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 213 selfloop transitions, 15 changer transitions 0/270 dead transitions. [2024-06-03 21:53:56,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 270 transitions, 3954 flow [2024-06-03 21:53:56,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:53:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:53:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-03 21:53:56,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3562091503267974 [2024-06-03 21:53:56,900 INFO L175 Difference]: Start difference. First operand has 253 places, 258 transitions, 3452 flow. Second operand 9 states and 109 transitions. [2024-06-03 21:53:56,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 270 transitions, 3954 flow [2024-06-03 21:53:57,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 270 transitions, 3796 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-03 21:53:57,061 INFO L231 Difference]: Finished difference. Result has 255 places, 260 transitions, 3357 flow [2024-06-03 21:53:57,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3294, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3357, PETRI_PLACES=255, PETRI_TRANSITIONS=260} [2024-06-03 21:53:57,063 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 222 predicate places. [2024-06-03 21:53:57,063 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 260 transitions, 3357 flow [2024-06-03 21:53:57,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:57,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:53:57,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:53:57,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-03 21:53:57,064 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:53:57,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:53:57,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1810153744, now seen corresponding path program 10 times [2024-06-03 21:53:57,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:53:57,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249384376] [2024-06-03 21:53:57,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:53:57,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:53:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:54:05,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:54:05,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:54:05,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249384376] [2024-06-03 21:54:05,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249384376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:54:05,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:54:05,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:54:05,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106604729] [2024-06-03 21:54:05,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:54:05,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:54:05,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:54:05,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:54:05,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:54:05,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:54:05,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 260 transitions, 3357 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:05,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:54:05,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:54:05,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:54:05,951 INFO L124 PetriNetUnfolderBase]: 663/1143 cut-off events. [2024-06-03 21:54:05,951 INFO L125 PetriNetUnfolderBase]: For 84906/84906 co-relation queries the response was YES. [2024-06-03 21:54:05,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9371 conditions, 1143 events. 663/1143 cut-off events. For 84906/84906 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5375 event pairs, 183 based on Foata normal form. 3/1146 useless extension candidates. Maximal degree in co-relation 9267. Up to 1015 conditions per place. [2024-06-03 21:54:05,962 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 250 selfloop transitions, 32 changer transitions 0/284 dead transitions. [2024-06-03 21:54:05,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 284 transitions, 4285 flow [2024-06-03 21:54:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:54:05,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:54:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 21:54:05,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-03 21:54:05,963 INFO L175 Difference]: Start difference. First operand has 255 places, 260 transitions, 3357 flow. Second operand 9 states and 114 transitions. [2024-06-03 21:54:05,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 284 transitions, 4285 flow [2024-06-03 21:54:06,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 284 transitions, 4235 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-03 21:54:06,153 INFO L231 Difference]: Finished difference. Result has 257 places, 266 transitions, 3460 flow [2024-06-03 21:54:06,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3307, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3460, PETRI_PLACES=257, PETRI_TRANSITIONS=266} [2024-06-03 21:54:06,153 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 224 predicate places. [2024-06-03 21:54:06,154 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 266 transitions, 3460 flow [2024-06-03 21:54:06,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:06,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:54:06,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:54:06,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-03 21:54:06,154 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:54:06,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:54:06,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1594056664, now seen corresponding path program 11 times [2024-06-03 21:54:06,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:54:06,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715207511] [2024-06-03 21:54:06,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:54:06,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:54:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:54:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:54:14,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:54:14,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715207511] [2024-06-03 21:54:14,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715207511] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:54:14,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:54:14,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:54:14,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116722241] [2024-06-03 21:54:14,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:54:14,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:54:14,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:54:14,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:54:14,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:54:14,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:54:14,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 266 transitions, 3460 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:14,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:54:14,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:54:14,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:54:14,911 INFO L124 PetriNetUnfolderBase]: 672/1158 cut-off events. [2024-06-03 21:54:14,911 INFO L125 PetriNetUnfolderBase]: For 88482/88482 co-relation queries the response was YES. [2024-06-03 21:54:14,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9546 conditions, 1158 events. 672/1158 cut-off events. For 88482/88482 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5459 event pairs, 184 based on Foata normal form. 3/1161 useless extension candidates. Maximal degree in co-relation 9441. Up to 1111 conditions per place. [2024-06-03 21:54:14,922 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 262 selfloop transitions, 17 changer transitions 0/281 dead transitions. [2024-06-03 21:54:14,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 281 transitions, 4104 flow [2024-06-03 21:54:14,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:54:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:54:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-03 21:54:14,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3366013071895425 [2024-06-03 21:54:14,923 INFO L175 Difference]: Start difference. First operand has 257 places, 266 transitions, 3460 flow. Second operand 9 states and 103 transitions. [2024-06-03 21:54:14,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 281 transitions, 4104 flow [2024-06-03 21:54:15,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 281 transitions, 4039 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-03 21:54:15,102 INFO L231 Difference]: Finished difference. Result has 261 places, 269 transitions, 3489 flow [2024-06-03 21:54:15,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3398, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3489, PETRI_PLACES=261, PETRI_TRANSITIONS=269} [2024-06-03 21:54:15,103 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 228 predicate places. [2024-06-03 21:54:15,103 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 269 transitions, 3489 flow [2024-06-03 21:54:15,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:15,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:54:15,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:54:15,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-03 21:54:15,104 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:54:15,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:54:15,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1583928964, now seen corresponding path program 12 times [2024-06-03 21:54:15,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:54:15,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592775040] [2024-06-03 21:54:15,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:54:15,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:54:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:54:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:54:23,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:54:23,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592775040] [2024-06-03 21:54:23,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592775040] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:54:23,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:54:23,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:54:23,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58166573] [2024-06-03 21:54:23,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:54:23,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:54:23,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:54:23,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:54:23,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:54:23,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:54:23,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 269 transitions, 3489 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:23,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:54:23,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:54:23,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:54:24,140 INFO L124 PetriNetUnfolderBase]: 681/1173 cut-off events. [2024-06-03 21:54:24,140 INFO L125 PetriNetUnfolderBase]: For 91690/91690 co-relation queries the response was YES. [2024-06-03 21:54:24,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9643 conditions, 1173 events. 681/1173 cut-off events. For 91690/91690 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5549 event pairs, 182 based on Foata normal form. 3/1176 useless extension candidates. Maximal degree in co-relation 9537. Up to 1084 conditions per place. [2024-06-03 21:54:24,152 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 257 selfloop transitions, 28 changer transitions 0/287 dead transitions. [2024-06-03 21:54:24,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 287 transitions, 4270 flow [2024-06-03 21:54:24,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:54:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:54:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-03 21:54:24,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3562091503267974 [2024-06-03 21:54:24,153 INFO L175 Difference]: Start difference. First operand has 261 places, 269 transitions, 3489 flow. Second operand 9 states and 109 transitions. [2024-06-03 21:54:24,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 287 transitions, 4270 flow [2024-06-03 21:54:24,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 287 transitions, 4225 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 21:54:24,359 INFO L231 Difference]: Finished difference. Result has 263 places, 272 transitions, 3556 flow [2024-06-03 21:54:24,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3444, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3556, PETRI_PLACES=263, PETRI_TRANSITIONS=272} [2024-06-03 21:54:24,366 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 230 predicate places. [2024-06-03 21:54:24,366 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 272 transitions, 3556 flow [2024-06-03 21:54:24,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:24,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:54:24,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:54:24,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-03 21:54:24,367 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:54:24,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:54:24,367 INFO L85 PathProgramCache]: Analyzing trace with hash -242525216, now seen corresponding path program 14 times [2024-06-03 21:54:24,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:54:24,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067351635] [2024-06-03 21:54:24,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:54:24,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:54:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:54:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:54:32,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:54:32,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067351635] [2024-06-03 21:54:32,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067351635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:54:32,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:54:32,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:54:32,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269768203] [2024-06-03 21:54:32,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:54:32,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:54:32,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:54:32,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:54:32,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:54:32,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:54:32,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 272 transitions, 3556 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:32,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:54:32,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:54:32,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:54:33,324 INFO L124 PetriNetUnfolderBase]: 651/1142 cut-off events. [2024-06-03 21:54:33,325 INFO L125 PetriNetUnfolderBase]: For 90728/90728 co-relation queries the response was YES. [2024-06-03 21:54:33,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9496 conditions, 1142 events. 651/1142 cut-off events. For 90728/90728 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5510 event pairs, 172 based on Foata normal form. 1/1143 useless extension candidates. Maximal degree in co-relation 9389. Up to 1034 conditions per place. [2024-06-03 21:54:33,336 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 230 selfloop transitions, 15 changer transitions 0/280 dead transitions. [2024-06-03 21:54:33,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 280 transitions, 4064 flow [2024-06-03 21:54:33,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:54:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:54:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-03 21:54:33,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34967320261437906 [2024-06-03 21:54:33,339 INFO L175 Difference]: Start difference. First operand has 263 places, 272 transitions, 3556 flow. Second operand 9 states and 107 transitions. [2024-06-03 21:54:33,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 280 transitions, 4064 flow [2024-06-03 21:54:33,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 280 transitions, 3963 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-03 21:54:33,544 INFO L231 Difference]: Finished difference. Result has 265 places, 272 transitions, 3490 flow [2024-06-03 21:54:33,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3455, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3490, PETRI_PLACES=265, PETRI_TRANSITIONS=272} [2024-06-03 21:54:33,544 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 232 predicate places. [2024-06-03 21:54:33,544 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 272 transitions, 3490 flow [2024-06-03 21:54:33,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:33,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:54:33,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:54:33,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-03 21:54:33,545 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:54:33,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:54:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash 42811990, now seen corresponding path program 17 times [2024-06-03 21:54:33,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:54:33,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544212277] [2024-06-03 21:54:33,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:54:33,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:54:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:54:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:54:42,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:54:42,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544212277] [2024-06-03 21:54:42,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544212277] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:54:42,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:54:42,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:54:42,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855976249] [2024-06-03 21:54:42,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:54:42,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:54:42,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:54:42,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:54:42,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:54:42,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:54:42,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 272 transitions, 3490 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:42,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:54:42,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:54:42,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:54:42,743 INFO L124 PetriNetUnfolderBase]: 682/1175 cut-off events. [2024-06-03 21:54:42,743 INFO L125 PetriNetUnfolderBase]: For 92585/92585 co-relation queries the response was YES. [2024-06-03 21:54:42,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9640 conditions, 1175 events. 682/1175 cut-off events. For 92585/92585 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5576 event pairs, 187 based on Foata normal form. 1/1176 useless extension candidates. Maximal degree in co-relation 9532. Up to 1144 conditions per place. [2024-06-03 21:54:42,754 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 265 selfloop transitions, 15 changer transitions 0/282 dead transitions. [2024-06-03 21:54:42,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 282 transitions, 4095 flow [2024-06-03 21:54:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:54:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:54:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-03 21:54:42,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3235294117647059 [2024-06-03 21:54:42,755 INFO L175 Difference]: Start difference. First operand has 265 places, 272 transitions, 3490 flow. Second operand 9 states and 99 transitions. [2024-06-03 21:54:42,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 282 transitions, 4095 flow [2024-06-03 21:54:42,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 282 transitions, 3952 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-03 21:54:42,965 INFO L231 Difference]: Finished difference. Result has 264 places, 274 transitions, 3413 flow [2024-06-03 21:54:42,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3347, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3413, PETRI_PLACES=264, PETRI_TRANSITIONS=274} [2024-06-03 21:54:42,966 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 231 predicate places. [2024-06-03 21:54:42,966 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 274 transitions, 3413 flow [2024-06-03 21:54:42,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:42,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:54:42,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:54:42,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-03 21:54:42,967 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:54:42,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:54:42,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1298829094, now seen corresponding path program 13 times [2024-06-03 21:54:42,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:54:42,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849492041] [2024-06-03 21:54:42,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:54:42,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:54:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:54:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:54:51,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:54:51,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849492041] [2024-06-03 21:54:51,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849492041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:54:51,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:54:51,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:54:51,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931695213] [2024-06-03 21:54:51,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:54:51,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:54:51,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:54:51,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:54:51,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:54:51,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:54:51,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 274 transitions, 3413 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:51,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:54:51,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:54:51,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:54:52,196 INFO L124 PetriNetUnfolderBase]: 691/1190 cut-off events. [2024-06-03 21:54:52,196 INFO L125 PetriNetUnfolderBase]: For 98443/98443 co-relation queries the response was YES. [2024-06-03 21:54:52,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9724 conditions, 1190 events. 691/1190 cut-off events. For 98443/98443 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5644 event pairs, 185 based on Foata normal form. 3/1193 useless extension candidates. Maximal degree in co-relation 9615. Up to 1041 conditions per place. [2024-06-03 21:54:52,209 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 255 selfloop transitions, 40 changer transitions 0/297 dead transitions. [2024-06-03 21:54:52,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 297 transitions, 4351 flow [2024-06-03 21:54:52,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:54:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:54:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 21:54:52,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-03 21:54:52,211 INFO L175 Difference]: Start difference. First operand has 264 places, 274 transitions, 3413 flow. Second operand 9 states and 117 transitions. [2024-06-03 21:54:52,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 297 transitions, 4351 flow [2024-06-03 21:54:52,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 297 transitions, 4316 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 21:54:52,426 INFO L231 Difference]: Finished difference. Result has 266 places, 277 transitions, 3500 flow [2024-06-03 21:54:52,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3378, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3500, PETRI_PLACES=266, PETRI_TRANSITIONS=277} [2024-06-03 21:54:52,426 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 233 predicate places. [2024-06-03 21:54:52,427 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 277 transitions, 3500 flow [2024-06-03 21:54:52,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:52,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:54:52,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:54:52,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-03 21:54:52,427 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:54:52,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:54:52,428 INFO L85 PathProgramCache]: Analyzing trace with hash -242518520, now seen corresponding path program 18 times [2024-06-03 21:54:52,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:54:52,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453723615] [2024-06-03 21:54:52,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:54:52,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:54:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:55:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:55:00,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:55:00,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453723615] [2024-06-03 21:55:00,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453723615] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:55:00,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:55:00,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:55:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541260066] [2024-06-03 21:55:00,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:55:00,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:55:00,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:55:00,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:55:00,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:55:00,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:55:00,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 277 transitions, 3500 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:00,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:55:00,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:55:00,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:55:01,359 INFO L124 PetriNetUnfolderBase]: 699/1203 cut-off events. [2024-06-03 21:55:01,359 INFO L125 PetriNetUnfolderBase]: For 100411/100411 co-relation queries the response was YES. [2024-06-03 21:55:01,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9987 conditions, 1203 events. 699/1203 cut-off events. For 100411/100411 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5743 event pairs, 187 based on Foata normal form. 1/1204 useless extension candidates. Maximal degree in co-relation 9877. Up to 1143 conditions per place. [2024-06-03 21:55:01,371 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 261 selfloop transitions, 28 changer transitions 0/291 dead transitions. [2024-06-03 21:55:01,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 291 transitions, 4398 flow [2024-06-03 21:55:01,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:55:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:55:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-03 21:55:01,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3464052287581699 [2024-06-03 21:55:01,374 INFO L175 Difference]: Start difference. First operand has 266 places, 277 transitions, 3500 flow. Second operand 9 states and 106 transitions. [2024-06-03 21:55:01,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 291 transitions, 4398 flow [2024-06-03 21:55:01,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 291 transitions, 4324 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 21:55:01,554 INFO L231 Difference]: Finished difference. Result has 269 places, 281 transitions, 3549 flow [2024-06-03 21:55:01,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3426, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3549, PETRI_PLACES=269, PETRI_TRANSITIONS=281} [2024-06-03 21:55:01,557 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 236 predicate places. [2024-06-03 21:55:01,557 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 281 transitions, 3549 flow [2024-06-03 21:55:01,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:01,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:55:01,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:55:01,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-03 21:55:01,558 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:55:01,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:55:01,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1583937334, now seen corresponding path program 14 times [2024-06-03 21:55:01,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:55:01,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242348791] [2024-06-03 21:55:01,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:55:01,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:55:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:55:09,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:55:09,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:55:09,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242348791] [2024-06-03 21:55:09,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242348791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:55:09,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:55:09,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:55:09,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680864366] [2024-06-03 21:55:09,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:55:09,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:55:09,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:55:09,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:55:09,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:55:09,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:55:09,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 281 transitions, 3549 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:09,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:55:09,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:55:09,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:55:10,421 INFO L124 PetriNetUnfolderBase]: 693/1194 cut-off events. [2024-06-03 21:55:10,421 INFO L125 PetriNetUnfolderBase]: For 101816/101816 co-relation queries the response was YES. [2024-06-03 21:55:10,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9773 conditions, 1194 events. 693/1194 cut-off events. For 101816/101816 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5693 event pairs, 182 based on Foata normal form. 3/1197 useless extension candidates. Maximal degree in co-relation 9662. Up to 1110 conditions per place. [2024-06-03 21:55:10,434 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 269 selfloop transitions, 26 changer transitions 0/297 dead transitions. [2024-06-03 21:55:10,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 297 transitions, 4205 flow [2024-06-03 21:55:10,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:55:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:55:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-03 21:55:10,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3562091503267974 [2024-06-03 21:55:10,435 INFO L175 Difference]: Start difference. First operand has 269 places, 281 transitions, 3549 flow. Second operand 9 states and 109 transitions. [2024-06-03 21:55:10,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 297 transitions, 4205 flow [2024-06-03 21:55:10,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 297 transitions, 4058 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-03 21:55:10,656 INFO L231 Difference]: Finished difference. Result has 271 places, 281 transitions, 3461 flow [2024-06-03 21:55:10,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3402, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3461, PETRI_PLACES=271, PETRI_TRANSITIONS=281} [2024-06-03 21:55:10,657 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 238 predicate places. [2024-06-03 21:55:10,657 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 281 transitions, 3461 flow [2024-06-03 21:55:10,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:10,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:55:10,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:55:10,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-03 21:55:10,658 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:55:10,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:55:10,658 INFO L85 PathProgramCache]: Analyzing trace with hash -242518272, now seen corresponding path program 15 times [2024-06-03 21:55:10,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:55:10,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816108081] [2024-06-03 21:55:10,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:55:10,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:55:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:55:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:55:18,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:55:18,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816108081] [2024-06-03 21:55:18,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816108081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:55:18,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:55:18,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:55:18,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352305621] [2024-06-03 21:55:18,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:55:18,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:55:18,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:55:18,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:55:18,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:55:18,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:55:18,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 281 transitions, 3461 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:18,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:55:18,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:55:18,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:55:19,228 INFO L124 PetriNetUnfolderBase]: 687/1185 cut-off events. [2024-06-03 21:55:19,228 INFO L125 PetriNetUnfolderBase]: For 98728/98728 co-relation queries the response was YES. [2024-06-03 21:55:19,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9554 conditions, 1185 events. 687/1185 cut-off events. For 98728/98728 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5628 event pairs, 178 based on Foata normal form. 3/1188 useless extension candidates. Maximal degree in co-relation 9442. Up to 1046 conditions per place. [2024-06-03 21:55:19,239 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 248 selfloop transitions, 45 changer transitions 0/295 dead transitions. [2024-06-03 21:55:19,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 295 transitions, 4096 flow [2024-06-03 21:55:19,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:55:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:55:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-03 21:55:19,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3627450980392157 [2024-06-03 21:55:19,241 INFO L175 Difference]: Start difference. First operand has 271 places, 281 transitions, 3461 flow. Second operand 9 states and 111 transitions. [2024-06-03 21:55:19,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 295 transitions, 4096 flow [2024-06-03 21:55:19,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 295 transitions, 4018 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-03 21:55:19,452 INFO L231 Difference]: Finished difference. Result has 272 places, 281 transitions, 3479 flow [2024-06-03 21:55:19,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3383, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3479, PETRI_PLACES=272, PETRI_TRANSITIONS=281} [2024-06-03 21:55:19,452 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 239 predicate places. [2024-06-03 21:55:19,452 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 281 transitions, 3479 flow [2024-06-03 21:55:19,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:19,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:55:19,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:55:19,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-03 21:55:19,453 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:55:19,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:55:19,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1809907976, now seen corresponding path program 19 times [2024-06-03 21:55:19,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:55:19,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339843680] [2024-06-03 21:55:19,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:55:19,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:55:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:55:27,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:55:27,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:55:27,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339843680] [2024-06-03 21:55:27,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339843680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:55:27,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:55:27,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:55:27,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66277023] [2024-06-03 21:55:27,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:55:27,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:55:27,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:55:27,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:55:27,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:55:27,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:55:27,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 281 transitions, 3479 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:27,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:55:27,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:55:27,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:55:27,598 INFO L124 PetriNetUnfolderBase]: 685/1182 cut-off events. [2024-06-03 21:55:27,598 INFO L125 PetriNetUnfolderBase]: For 96082/96082 co-relation queries the response was YES. [2024-06-03 21:55:27,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9552 conditions, 1182 events. 685/1182 cut-off events. For 96082/96082 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5632 event pairs, 184 based on Foata normal form. 1/1183 useless extension candidates. Maximal degree in co-relation 9439. Up to 1123 conditions per place. [2024-06-03 21:55:27,610 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 258 selfloop transitions, 30 changer transitions 0/290 dead transitions. [2024-06-03 21:55:27,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 290 transitions, 4199 flow [2024-06-03 21:55:27,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:55:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:55:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-03 21:55:27,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.369281045751634 [2024-06-03 21:55:27,611 INFO L175 Difference]: Start difference. First operand has 272 places, 281 transitions, 3479 flow. Second operand 9 states and 113 transitions. [2024-06-03 21:55:27,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 290 transitions, 4199 flow [2024-06-03 21:55:27,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 290 transitions, 4085 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 21:55:27,846 INFO L231 Difference]: Finished difference. Result has 272 places, 281 transitions, 3430 flow [2024-06-03 21:55:27,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3365, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3430, PETRI_PLACES=272, PETRI_TRANSITIONS=281} [2024-06-03 21:55:27,847 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 239 predicate places. [2024-06-03 21:55:27,847 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 281 transitions, 3430 flow [2024-06-03 21:55:27,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:27,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:55:27,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:55:27,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-03 21:55:27,848 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:55:27,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:55:27,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1810145126, now seen corresponding path program 20 times [2024-06-03 21:55:27,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:55:27,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359405058] [2024-06-03 21:55:27,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:55:27,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:55:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:55:34,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:55:34,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:55:34,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359405058] [2024-06-03 21:55:34,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359405058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:55:34,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:55:34,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:55:34,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130110351] [2024-06-03 21:55:34,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:55:34,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:55:34,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:55:34,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:55:34,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:55:34,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:55:34,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 281 transitions, 3430 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:34,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:55:34,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:55:34,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:55:35,247 INFO L124 PetriNetUnfolderBase]: 683/1179 cut-off events. [2024-06-03 21:55:35,248 INFO L125 PetriNetUnfolderBase]: For 96693/96693 co-relation queries the response was YES. [2024-06-03 21:55:35,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9465 conditions, 1179 events. 683/1179 cut-off events. For 96693/96693 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5628 event pairs, 184 based on Foata normal form. 1/1180 useless extension candidates. Maximal degree in co-relation 9351. Up to 1121 conditions per place. [2024-06-03 21:55:35,259 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 260 selfloop transitions, 27 changer transitions 0/289 dead transitions. [2024-06-03 21:55:35,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 289 transitions, 4022 flow [2024-06-03 21:55:35,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:55:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:55:35,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 21:55:35,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-03 21:55:35,260 INFO L175 Difference]: Start difference. First operand has 272 places, 281 transitions, 3430 flow. Second operand 9 states and 114 transitions. [2024-06-03 21:55:35,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 289 transitions, 4022 flow [2024-06-03 21:55:35,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 289 transitions, 3903 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-03 21:55:35,456 INFO L231 Difference]: Finished difference. Result has 273 places, 281 transitions, 3370 flow [2024-06-03 21:55:35,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3311, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3370, PETRI_PLACES=273, PETRI_TRANSITIONS=281} [2024-06-03 21:55:35,456 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 240 predicate places. [2024-06-03 21:55:35,457 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 281 transitions, 3370 flow [2024-06-03 21:55:35,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:35,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:55:35,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:55:35,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-03 21:55:35,457 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:55:35,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:55:35,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1594426060, now seen corresponding path program 1 times [2024-06-03 21:55:35,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:55:35,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266496361] [2024-06-03 21:55:35,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:55:35,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:55:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:55:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:55:45,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:55:45,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266496361] [2024-06-03 21:55:45,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266496361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:55:45,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:55:45,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:55:45,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604525800] [2024-06-03 21:55:45,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:55:45,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:55:45,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:55:45,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:55:45,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:55:46,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:55:46,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 281 transitions, 3370 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:46,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:55:46,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:55:46,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:55:46,642 INFO L124 PetriNetUnfolderBase]: 630/1120 cut-off events. [2024-06-03 21:55:46,642 INFO L125 PetriNetUnfolderBase]: For 99040/99045 co-relation queries the response was YES. [2024-06-03 21:55:46,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8928 conditions, 1120 events. 630/1120 cut-off events. For 99040/99045 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5518 event pairs, 167 based on Foata normal form. 7/1121 useless extension candidates. Maximal degree in co-relation 8813. Up to 969 conditions per place. [2024-06-03 21:55:46,653 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 225 selfloop transitions, 14 changer transitions 0/291 dead transitions. [2024-06-03 21:55:46,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 291 transitions, 3870 flow [2024-06-03 21:55:46,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:55:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:55:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-03 21:55:46,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34967320261437906 [2024-06-03 21:55:46,656 INFO L175 Difference]: Start difference. First operand has 273 places, 281 transitions, 3370 flow. Second operand 9 states and 107 transitions. [2024-06-03 21:55:46,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 291 transitions, 3870 flow [2024-06-03 21:55:46,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 291 transitions, 3789 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 21:55:46,852 INFO L231 Difference]: Finished difference. Result has 273 places, 281 transitions, 3321 flow [2024-06-03 21:55:46,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3289, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3321, PETRI_PLACES=273, PETRI_TRANSITIONS=281} [2024-06-03 21:55:46,853 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 240 predicate places. [2024-06-03 21:55:46,853 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 281 transitions, 3321 flow [2024-06-03 21:55:46,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:46,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:55:46,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:55:46,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-03 21:55:46,853 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:55:46,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:55:46,854 INFO L85 PathProgramCache]: Analyzing trace with hash -668943389, now seen corresponding path program 1 times [2024-06-03 21:55:46,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:55:46,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130809536] [2024-06-03 21:55:46,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:55:46,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:55:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:55:57,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:55:57,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:55:57,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130809536] [2024-06-03 21:55:57,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130809536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:55:57,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:55:57,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:55:57,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482715018] [2024-06-03 21:55:57,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:55:57,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:55:57,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:55:57,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:55:57,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:55:57,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:55:57,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 281 transitions, 3321 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:57,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:55:57,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:55:57,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:55:58,087 INFO L124 PetriNetUnfolderBase]: 665/1167 cut-off events. [2024-06-03 21:55:58,087 INFO L125 PetriNetUnfolderBase]: For 108924/108926 co-relation queries the response was YES. [2024-06-03 21:55:58,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9479 conditions, 1167 events. 665/1167 cut-off events. For 108924/108926 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5719 event pairs, 109 based on Foata normal form. 1/1166 useless extension candidates. Maximal degree in co-relation 9363. Up to 942 conditions per place. [2024-06-03 21:55:58,097 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 225 selfloop transitions, 45 changer transitions 0/308 dead transitions. [2024-06-03 21:55:58,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 308 transitions, 4109 flow [2024-06-03 21:55:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:55:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:55:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-03 21:55:58,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3877005347593583 [2024-06-03 21:55:58,099 INFO L175 Difference]: Start difference. First operand has 273 places, 281 transitions, 3321 flow. Second operand 11 states and 145 transitions. [2024-06-03 21:55:58,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 308 transitions, 4109 flow [2024-06-03 21:55:58,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 308 transitions, 4075 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 21:55:58,302 INFO L231 Difference]: Finished difference. Result has 278 places, 288 transitions, 3468 flow [2024-06-03 21:55:58,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3287, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3468, PETRI_PLACES=278, PETRI_TRANSITIONS=288} [2024-06-03 21:55:58,302 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 245 predicate places. [2024-06-03 21:55:58,302 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 288 transitions, 3468 flow [2024-06-03 21:55:58,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:58,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:55:58,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:55:58,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-03 21:55:58,304 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:55:58,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:55:58,304 INFO L85 PathProgramCache]: Analyzing trace with hash -274100732, now seen corresponding path program 1 times [2024-06-03 21:55:58,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:55:58,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594836882] [2024-06-03 21:55:58,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:55:58,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:55:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:56:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:56:08,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:56:08,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594836882] [2024-06-03 21:56:08,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594836882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:56:08,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:56:08,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:56:08,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932136201] [2024-06-03 21:56:08,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:56:08,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:56:08,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:56:08,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:56:08,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:56:08,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:56:08,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 288 transitions, 3468 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:56:08,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:56:08,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:56:08,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:56:09,197 INFO L124 PetriNetUnfolderBase]: 700/1207 cut-off events. [2024-06-03 21:56:09,198 INFO L125 PetriNetUnfolderBase]: For 105326/105326 co-relation queries the response was YES. [2024-06-03 21:56:09,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9802 conditions, 1207 events. 700/1207 cut-off events. For 105326/105326 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5813 event pairs, 121 based on Foata normal form. 1/1208 useless extension candidates. Maximal degree in co-relation 9684. Up to 1089 conditions per place. [2024-06-03 21:56:09,210 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 265 selfloop transitions, 46 changer transitions 0/313 dead transitions. [2024-06-03 21:56:09,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 313 transitions, 4324 flow [2024-06-03 21:56:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 21:56:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 21:56:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-03 21:56:09,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34558823529411764 [2024-06-03 21:56:09,212 INFO L175 Difference]: Start difference. First operand has 278 places, 288 transitions, 3468 flow. Second operand 12 states and 141 transitions. [2024-06-03 21:56:09,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 313 transitions, 4324 flow [2024-06-03 21:56:09,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 313 transitions, 4231 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 21:56:09,485 INFO L231 Difference]: Finished difference. Result has 284 places, 292 transitions, 3524 flow [2024-06-03 21:56:09,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3375, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3524, PETRI_PLACES=284, PETRI_TRANSITIONS=292} [2024-06-03 21:56:09,485 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 251 predicate places. [2024-06-03 21:56:09,485 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 292 transitions, 3524 flow [2024-06-03 21:56:09,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:56:09,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:56:09,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:56:09,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-03 21:56:09,487 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:56:09,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:56:09,487 INFO L85 PathProgramCache]: Analyzing trace with hash 705032961, now seen corresponding path program 2 times [2024-06-03 21:56:09,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:56:09,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629094903] [2024-06-03 21:56:09,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:56:09,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:56:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:56:20,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:56:20,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:56:20,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629094903] [2024-06-03 21:56:20,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629094903] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:56:20,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:56:20,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:56:20,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564946908] [2024-06-03 21:56:20,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:56:20,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:56:20,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:56:20,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:56:20,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:56:20,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-03 21:56:20,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 292 transitions, 3524 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:56:20,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:56:20,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-03 21:56:20,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:56:21,188 INFO L124 PetriNetUnfolderBase]: 688/1205 cut-off events. [2024-06-03 21:56:21,188 INFO L125 PetriNetUnfolderBase]: For 115903/115905 co-relation queries the response was YES. [2024-06-03 21:56:21,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9931 conditions, 1205 events. 688/1205 cut-off events. For 115903/115905 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5965 event pairs, 112 based on Foata normal form. 1/1202 useless extension candidates. Maximal degree in co-relation 9812. Up to 1001 conditions per place. [2024-06-03 21:56:21,201 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 231 selfloop transitions, 47 changer transitions 0/318 dead transitions. [2024-06-03 21:56:21,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 318 transitions, 4197 flow [2024-06-03 21:56:21,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:56:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:56:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-03 21:56:21,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3770053475935829 [2024-06-03 21:56:21,202 INFO L175 Difference]: Start difference. First operand has 284 places, 292 transitions, 3524 flow. Second operand 11 states and 141 transitions. [2024-06-03 21:56:21,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 318 transitions, 4197 flow [2024-06-03 21:56:21,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 318 transitions, 4092 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-06-03 21:56:21,496 INFO L231 Difference]: Finished difference. Result has 286 places, 300 transitions, 3614 flow [2024-06-03 21:56:21,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3419, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3614, PETRI_PLACES=286, PETRI_TRANSITIONS=300} [2024-06-03 21:56:21,497 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 253 predicate places. [2024-06-03 21:56:21,497 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 300 transitions, 3614 flow [2024-06-03 21:56:21,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:56:21,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:56:21,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:56:21,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-03 21:56:21,497 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:56:21,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:56:21,498 INFO L85 PathProgramCache]: Analyzing trace with hash 710244104, now seen corresponding path program 2 times [2024-06-03 21:56:21,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:56:21,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310644762] [2024-06-03 21:56:21,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:56:21,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:56:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:56:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:56:31,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:56:31,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310644762] [2024-06-03 21:56:31,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310644762] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:56:31,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:56:31,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:56:31,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349153978] [2024-06-03 21:56:31,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:56:31,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:56:31,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:56:31,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:56:31,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:56:32,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-03 21:56:32,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 300 transitions, 3614 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:56:32,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:56:32,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-03 21:56:32,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:56:32,623 INFO L124 PetriNetUnfolderBase]: 717/1237 cut-off events. [2024-06-03 21:56:32,623 INFO L125 PetriNetUnfolderBase]: For 112008/112008 co-relation queries the response was YES. [2024-06-03 21:56:32,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10134 conditions, 1237 events. 717/1237 cut-off events. For 112008/112008 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 6009 event pairs, 122 based on Foata normal form. 1/1238 useless extension candidates. Maximal degree in co-relation 10014. Up to 1128 conditions per place. [2024-06-03 21:56:32,636 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 271 selfloop transitions, 45 changer transitions 0/318 dead transitions. [2024-06-03 21:56:32,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 318 transitions, 4310 flow [2024-06-03 21:56:32,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:56:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:56:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-03 21:56:32,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588235294117647 [2024-06-03 21:56:32,639 INFO L175 Difference]: Start difference. First operand has 286 places, 300 transitions, 3614 flow. Second operand 10 states and 122 transitions. [2024-06-03 21:56:32,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 318 transitions, 4310 flow [2024-06-03 21:56:32,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 318 transitions, 4210 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-03 21:56:32,951 INFO L231 Difference]: Finished difference. Result has 288 places, 302 transitions, 3641 flow [2024-06-03 21:56:32,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3514, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3641, PETRI_PLACES=288, PETRI_TRANSITIONS=302} [2024-06-03 21:56:32,952 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 255 predicate places. [2024-06-03 21:56:32,952 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 302 transitions, 3641 flow [2024-06-03 21:56:32,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:56:32,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:56:32,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:56:32,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-03 21:56:32,953 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:56:32,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:56:32,953 INFO L85 PathProgramCache]: Analyzing trace with hash 823924316, now seen corresponding path program 3 times [2024-06-03 21:56:32,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:56:32,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309580158] [2024-06-03 21:56:32,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:56:32,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:56:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15