./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/thin002_power.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/thin002_power.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/thin002_power.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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 02:12:43,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:12:44,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:12:44,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:12:44,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:12:44,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:12:44,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:12:44,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:12:44,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:12:44,062 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:12:44,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:12:44,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:12:44,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:12:44,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:12:44,072 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:12:44,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:12:44,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:12:44,073 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:12:44,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:12:44,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:12:44,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:12:44,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:12:44,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:12:44,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:12:44,074 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:12:44,074 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:12:44,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:12:44,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:12:44,075 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:12:44,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:12:44,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:12:44,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:12:44,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:12:44,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:12:44,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:12:44,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:12:44,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:12:44,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:12:44,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:12:44,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:12:44,077 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:12:44,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:12:44,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:12:44,077 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 [2024-06-28 02:12:44,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:12:44,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:12:44,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:12:44,311 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:12:44,311 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:12:44,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2024-06-28 02:12:45,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:12:45,650 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:12:45,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2024-06-28 02:12:45,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ddcac50b/7dbf9e0269944203867b8fbcd0008587/FLAG0fcb89e87 [2024-06-28 02:12:45,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ddcac50b/7dbf9e0269944203867b8fbcd0008587 [2024-06-28 02:12:45,695 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:12:45,696 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:12:45,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/thin002_power.oepc.yml/witness.yml [2024-06-28 02:12:45,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:12:45,960 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:12:45,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:12:45,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:12:45,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:12:45,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:12:45" (1/2) ... [2024-06-28 02:12:45,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5102e16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:12:45, skipping insertion in model container [2024-06-28 02:12:45,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:12:45" (1/2) ... [2024-06-28 02:12:45,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@11dec0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:12:45, skipping insertion in model container [2024-06-28 02:12:45,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:12:45" (2/2) ... [2024-06-28 02:12:45,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5102e16e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:45, skipping insertion in model container [2024-06-28 02:12:45,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:12:45" (2/2) ... [2024-06-28 02:12:45,969 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:12:46,156 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:12:46,158 INFO L97 edCorrectnessWitness]: Location invariant before [L866-L866] (((((((((((((((((((((((((((((((((((((((((((! multithreaded || a$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || a$w_buff1 == 0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$w_buff0 == 0)) && (! multithreaded || a$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & a && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1))))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd1 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff0_thd4 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd1 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$r_buff1_thd4 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && a$w_buff0 == 0) && a$w_buff0_used == (_Bool)0) && a$w_buff1 == 0) && a$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & a && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (a$mem_tmp == 0 || a$mem_tmp == 1))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || a$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || a$w_buff0_used == (_Bool)0) [2024-06-28 02:12:46,158 INFO L97 edCorrectnessWitness]: Location invariant before [L869-L869] (((((((((((((((((((((((((((((((((((((((((((! multithreaded || a$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || a$w_buff1 == 0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$w_buff0 == 0)) && (! multithreaded || a$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & a && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1))))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd1 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff0_thd4 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd1 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$r_buff1_thd4 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && a$w_buff0 == 0) && a$w_buff0_used == (_Bool)0) && a$w_buff1 == 0) && a$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & a && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (a$mem_tmp == 0 || a$mem_tmp == 1))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || a$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || a$w_buff0_used == (_Bool)0) [2024-06-28 02:12:46,158 INFO L97 edCorrectnessWitness]: Location invariant before [L864-L864] (((((((((((((((((((((((((((((((((((((((((((! multithreaded || a$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || a$w_buff1 == 0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$w_buff0 == 0)) && (! multithreaded || a$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & a && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1))))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd1 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff0_thd4 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd1 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$r_buff1_thd4 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && a$w_buff0 == 0) && a$w_buff0_used == (_Bool)0) && a$w_buff1 == 0) && a$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & a && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (a$mem_tmp == 0 || a$mem_tmp == 1))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || a$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || a$w_buff0_used == (_Bool)0) [2024-06-28 02:12:46,158 INFO L97 edCorrectnessWitness]: Location invariant before [L868-L868] (((((((((((((((((((((((((((((((((((((((((((! multithreaded || a$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || a$w_buff1 == 0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$w_buff0 == 0)) && (! multithreaded || a$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & a && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1))))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd1 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff0_thd4 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd1 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$r_buff1_thd4 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && a$w_buff0 == 0) && a$w_buff0_used == (_Bool)0) && a$w_buff1 == 0) && a$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & a && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (a$mem_tmp == 0 || a$mem_tmp == 1))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || a$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || a$w_buff0_used == (_Bool)0) [2024-06-28 02:12:46,158 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:12:46,159 INFO L106 edCorrectnessWitness]: ghost_update [L862-L862] multithreaded = 1; [2024-06-28 02:12:46,196 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:12:46,356 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i[995,1008] [2024-06-28 02:12:46,511 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:12:46,522 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 02:12:46,582 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i[995,1008] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:12:46,714 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:12:46,746 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:12:46,746 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:46 WrapperNode [2024-06-28 02:12:46,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:12:46,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:12:46,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:12:46,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:12:46,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:46" (1/1) ... [2024-06-28 02:12:46,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:46" (1/1) ... [2024-06-28 02:12:46,831 INFO L138 Inliner]: procedures = 176, calls = 98, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 246 [2024-06-28 02:12:46,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:12:46,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:12:46,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:12:46,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:12:46,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:46" (1/1) ... [2024-06-28 02:12:46,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:46" (1/1) ... [2024-06-28 02:12:46,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:46" (1/1) ... [2024-06-28 02:12:46,875 INFO L175 MemorySlicer]: Split 49 memory accesses to 2 slices as follows [2, 47]. 96 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-06-28 02:12:46,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:46" (1/1) ... [2024-06-28 02:12:46,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:46" (1/1) ... [2024-06-28 02:12:46,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:46" (1/1) ... [2024-06-28 02:12:46,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:46" (1/1) ... [2024-06-28 02:12:46,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:46" (1/1) ... [2024-06-28 02:12:46,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:46" (1/1) ... [2024-06-28 02:12:46,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:12:46,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:12:46,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:12:46,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:12:46,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:46" (1/1) ... [2024-06-28 02:12:46,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:12:46,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:12:46,953 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-28 02:12:47,000 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-28 02:12:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 02:12:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 02:12:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 02:12:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 02:12:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 02:12:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:12:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 02:12:47,014 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 02:12:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 02:12:47,014 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 02:12:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 02:12:47,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 02:12:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 02:12:47,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 02:12:47,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:12:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 02:12:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 02:12:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:12:47,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:12:47,020 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 02:12:47,183 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:12:47,185 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:12:47,732 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:12:47,732 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:12:48,136 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:12:48,136 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 02:12:48,137 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:12:48 BoogieIcfgContainer [2024-06-28 02:12:48,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:12:48,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:12:48,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:12:48,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:12:48,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:12:45" (1/4) ... [2024-06-28 02:12:48,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6134a954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:12:48, skipping insertion in model container [2024-06-28 02:12:48,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:12:45" (2/4) ... [2024-06-28 02:12:48,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6134a954 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:12:48, skipping insertion in model container [2024-06-28 02:12:48,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:46" (3/4) ... [2024-06-28 02:12:48,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6134a954 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:12:48, skipping insertion in model container [2024-06-28 02:12:48,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:12:48" (4/4) ... [2024-06-28 02:12:48,143 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.oepc.i [2024-06-28 02:12:48,158 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:12:48,158 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-28 02:12:48,158 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:12:48,209 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 02:12:48,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 02:12:48,285 INFO L124 PetriNetUnfolderBase]: 1/55 cut-off events. [2024-06-28 02:12:48,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:12:48,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 1/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2024-06-28 02:12:48,288 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 02:12:48,290 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 52 transitions, 116 flow [2024-06-28 02:12:48,296 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:12:48,304 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;@24deb087, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:12:48,305 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-28 02:12:48,309 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:12:48,310 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-28 02:12:48,310 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:12:48,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:48,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:12:48,311 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:12:48,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:48,315 INFO L85 PathProgramCache]: Analyzing trace with hash 782022736, now seen corresponding path program 1 times [2024-06-28 02:12:48,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:48,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637544833] [2024-06-28 02:12:48,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:48,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:50,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-28 02:12:50,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:50,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637544833] [2024-06-28 02:12:50,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637544833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:50,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:50,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:12:50,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165540395] [2024-06-28 02:12:50,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:50,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:12:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:50,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:12:50,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:12:50,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 02:12:50,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-28 02:12:50,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:50,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 02:12:50,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:53,331 INFO L124 PetriNetUnfolderBase]: 11846/17104 cut-off events. [2024-06-28 02:12:53,331 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2024-06-28 02:12:53,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33290 conditions, 17104 events. 11846/17104 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 107728 event pairs, 8420 based on Foata normal form. 0/16573 useless extension candidates. Maximal degree in co-relation 33277. Up to 15950 conditions per place. [2024-06-28 02:12:53,435 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 55 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2024-06-28 02:12:53,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 291 flow [2024-06-28 02:12:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:12:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:12:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-06-28 02:12:53,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2024-06-28 02:12:53,449 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 116 flow. Second operand 3 states and 119 transitions. [2024-06-28 02:12:53,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 291 flow [2024-06-28 02:12:53,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 284 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 02:12:53,458 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 158 flow [2024-06-28 02:12:53,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-06-28 02:12:53,463 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -1 predicate places. [2024-06-28 02:12:53,464 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 158 flow [2024-06-28 02:12:53,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-28 02:12:53,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:53,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:53,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:12:53,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:12:53,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:53,465 INFO L85 PathProgramCache]: Analyzing trace with hash -95383953, now seen corresponding path program 1 times [2024-06-28 02:12:53,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:53,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684254589] [2024-06-28 02:12:53,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:53,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:56,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:56,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684254589] [2024-06-28 02:12:56,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684254589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:56,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:56,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 02:12:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508090212] [2024-06-28 02:12:56,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:56,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:12:56,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:56,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:12:56,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:12:56,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 02:12:56,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:56,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:56,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 02:12:56,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:59,256 INFO L124 PetriNetUnfolderBase]: 11836/16455 cut-off events. [2024-06-28 02:12:59,256 INFO L125 PetriNetUnfolderBase]: For 2997/3007 co-relation queries the response was YES. [2024-06-28 02:12:59,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37126 conditions, 16455 events. 11836/16455 cut-off events. For 2997/3007 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 96271 event pairs, 6741 based on Foata normal form. 10/16460 useless extension candidates. Maximal degree in co-relation 37114. Up to 15895 conditions per place. [2024-06-28 02:12:59,345 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 76 selfloop transitions, 13 changer transitions 0/102 dead transitions. [2024-06-28 02:12:59,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 102 transitions, 454 flow [2024-06-28 02:12:59,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:12:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:12:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2024-06-28 02:12:59,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6822033898305084 [2024-06-28 02:12:59,352 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 158 flow. Second operand 4 states and 161 transitions. [2024-06-28 02:12:59,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 102 transitions, 454 flow [2024-06-28 02:12:59,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 102 transitions, 448 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:12:59,357 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 241 flow [2024-06-28 02:12:59,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=63, 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=4, PETRI_FLOW=241, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2024-06-28 02:12:59,362 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 3 predicate places. [2024-06-28 02:12:59,363 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 241 flow [2024-06-28 02:12:59,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:59,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:59,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:59,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:12:59,363 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:12:59,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:59,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1338066175, now seen corresponding path program 1 times [2024-06-28 02:12:59,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:59,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326810522] [2024-06-28 02:12:59,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:59,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:02,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:02,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:02,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326810522] [2024-06-28 02:13:02,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326810522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:02,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:02,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:13:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147453357] [2024-06-28 02:13:02,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:02,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:13:02,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:02,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:13:02,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:13:02,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 02:13:02,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:02,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:02,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 02:13:02,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:05,627 INFO L124 PetriNetUnfolderBase]: 15023/20762 cut-off events. [2024-06-28 02:13:05,628 INFO L125 PetriNetUnfolderBase]: For 11735/11753 co-relation queries the response was YES. [2024-06-28 02:13:05,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52473 conditions, 20762 events. 15023/20762 cut-off events. For 11735/11753 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 122062 event pairs, 7095 based on Foata normal form. 16/20774 useless extension candidates. Maximal degree in co-relation 52458. Up to 20058 conditions per place. [2024-06-28 02:13:05,754 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 109 selfloop transitions, 16 changer transitions 0/137 dead transitions. [2024-06-28 02:13:05,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 137 transitions, 712 flow [2024-06-28 02:13:05,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:13:05,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:13:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2024-06-28 02:13:05,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6711864406779661 [2024-06-28 02:13:05,757 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 241 flow. Second operand 5 states and 198 transitions. [2024-06-28 02:13:05,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 137 transitions, 712 flow [2024-06-28 02:13:05,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 137 transitions, 712 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 02:13:05,770 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 409 flow [2024-06-28 02:13:05,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=409, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2024-06-28 02:13:05,772 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 10 predicate places. [2024-06-28 02:13:05,772 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 409 flow [2024-06-28 02:13:05,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:05,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:05,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:05,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:13:05,773 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:13:05,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:05,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1686419198, now seen corresponding path program 1 times [2024-06-28 02:13:05,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:05,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627080871] [2024-06-28 02:13:05,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:05,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:09,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:09,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627080871] [2024-06-28 02:13:09,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627080871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:09,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:09,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:13:09,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954772934] [2024-06-28 02:13:09,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:09,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:13:09,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:09,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:13:09,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:13:09,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 02:13:09,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 409 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:09,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:09,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 02:13:09,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:12,781 INFO L124 PetriNetUnfolderBase]: 15007/20754 cut-off events. [2024-06-28 02:13:12,782 INFO L125 PetriNetUnfolderBase]: For 19147/19210 co-relation queries the response was YES. [2024-06-28 02:13:12,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57427 conditions, 20754 events. 15007/20754 cut-off events. For 19147/19210 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 122614 event pairs, 5647 based on Foata normal form. 38/20788 useless extension candidates. Maximal degree in co-relation 57407. Up to 19956 conditions per place. [2024-06-28 02:13:12,932 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 124 selfloop transitions, 19 changer transitions 0/155 dead transitions. [2024-06-28 02:13:12,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 155 transitions, 883 flow [2024-06-28 02:13:12,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:13:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:13:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2024-06-28 02:13:12,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6581920903954802 [2024-06-28 02:13:12,934 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 409 flow. Second operand 6 states and 233 transitions. [2024-06-28 02:13:12,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 155 transitions, 883 flow [2024-06-28 02:13:12,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 155 transitions, 879 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-28 02:13:12,946 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 471 flow [2024-06-28 02:13:12,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=471, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2024-06-28 02:13:12,947 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 15 predicate places. [2024-06-28 02:13:12,947 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 471 flow [2024-06-28 02:13:12,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:12,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:12,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:12,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:13:12,948 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:13:12,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:12,949 INFO L85 PathProgramCache]: Analyzing trace with hash -404041430, now seen corresponding path program 1 times [2024-06-28 02:13:12,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:12,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097211543] [2024-06-28 02:13:12,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:12,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:15,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:15,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097211543] [2024-06-28 02:13:15,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097211543] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:15,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:15,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:13:15,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797784244] [2024-06-28 02:13:15,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:15,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:13:15,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:15,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:13:15,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:13:15,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 02:13:15,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 471 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:15,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:15,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 02:13:15,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:18,896 INFO L124 PetriNetUnfolderBase]: 18976/26974 cut-off events. [2024-06-28 02:13:18,897 INFO L125 PetriNetUnfolderBase]: For 34512/34563 co-relation queries the response was YES. [2024-06-28 02:13:18,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76495 conditions, 26974 events. 18976/26974 cut-off events. For 34512/34563 co-relation queries the response was YES. Maximal size of possible extension queue 1026. Compared 168834 event pairs, 9349 based on Foata normal form. 18/26986 useless extension candidates. Maximal degree in co-relation 76471. Up to 25262 conditions per place. [2024-06-28 02:13:19,090 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 101 selfloop transitions, 14 changer transitions 0/125 dead transitions. [2024-06-28 02:13:19,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 125 transitions, 860 flow [2024-06-28 02:13:19,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:13:19,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:13:19,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-06-28 02:13:19,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5423728813559322 [2024-06-28 02:13:19,108 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 471 flow. Second operand 5 states and 160 transitions. [2024-06-28 02:13:19,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 125 transitions, 860 flow [2024-06-28 02:13:19,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 125 transitions, 810 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-28 02:13:19,126 INFO L231 Difference]: Finished difference. Result has 82 places, 94 transitions, 575 flow [2024-06-28 02:13:19,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=575, PETRI_PLACES=82, PETRI_TRANSITIONS=94} [2024-06-28 02:13:19,129 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 17 predicate places. [2024-06-28 02:13:19,129 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 94 transitions, 575 flow [2024-06-28 02:13:19,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:19,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:19,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:19,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 02:13:19,130 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:13:19,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:19,130 INFO L85 PathProgramCache]: Analyzing trace with hash 837432677, now seen corresponding path program 1 times [2024-06-28 02:13:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:19,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705722571] [2024-06-28 02:13:19,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:19,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:22,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:22,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705722571] [2024-06-28 02:13:22,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705722571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:22,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:22,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:13:22,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071427705] [2024-06-28 02:13:22,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:22,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:13:22,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:22,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:13:22,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:13:22,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 02:13:22,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 94 transitions, 575 flow. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:22,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:22,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 02:13:22,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:27,300 INFO L124 PetriNetUnfolderBase]: 18655/25726 cut-off events. [2024-06-28 02:13:27,301 INFO L125 PetriNetUnfolderBase]: For 52278/52522 co-relation queries the response was YES. [2024-06-28 02:13:27,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83256 conditions, 25726 events. 18655/25726 cut-off events. For 52278/52522 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 154269 event pairs, 7286 based on Foata normal form. 73/25751 useless extension candidates. Maximal degree in co-relation 83229. Up to 24590 conditions per place. [2024-06-28 02:13:27,505 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 123 selfloop transitions, 40 changer transitions 0/176 dead transitions. [2024-06-28 02:13:27,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 176 transitions, 1177 flow [2024-06-28 02:13:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:13:27,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:13:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 249 transitions. [2024-06-28 02:13:27,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6029055690072639 [2024-06-28 02:13:27,507 INFO L175 Difference]: Start difference. First operand has 82 places, 94 transitions, 575 flow. Second operand 7 states and 249 transitions. [2024-06-28 02:13:27,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 176 transitions, 1177 flow [2024-06-28 02:13:27,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 176 transitions, 1161 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-28 02:13:27,538 INFO L231 Difference]: Finished difference. Result has 88 places, 102 transitions, 722 flow [2024-06-28 02:13:27,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=722, PETRI_PLACES=88, PETRI_TRANSITIONS=102} [2024-06-28 02:13:27,541 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 23 predicate places. [2024-06-28 02:13:27,541 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 102 transitions, 722 flow [2024-06-28 02:13:27,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:27,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:27,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:27,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 02:13:27,542 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:13:27,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:27,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1743348785, now seen corresponding path program 2 times [2024-06-28 02:13:27,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:27,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544658629] [2024-06-28 02:13:27,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:27,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:31,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:31,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544658629] [2024-06-28 02:13:31,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544658629] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:31,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:31,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:13:31,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400869719] [2024-06-28 02:13:31,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:31,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:13:31,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:31,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:13:31,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:13:31,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 02:13:31,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 102 transitions, 722 flow. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:31,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:31,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 02:13:31,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:35,617 INFO L124 PetriNetUnfolderBase]: 18618/25701 cut-off events. [2024-06-28 02:13:35,617 INFO L125 PetriNetUnfolderBase]: For 73775/74151 co-relation queries the response was YES. [2024-06-28 02:13:35,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89797 conditions, 25701 events. 18618/25701 cut-off events. For 73775/74151 co-relation queries the response was YES. Maximal size of possible extension queue 1064. Compared 154221 event pairs, 7304 based on Foata normal form. 140/25789 useless extension candidates. Maximal degree in co-relation 89767. Up to 24638 conditions per place. [2024-06-28 02:13:35,780 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 127 selfloop transitions, 37 changer transitions 0/177 dead transitions. [2024-06-28 02:13:35,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 177 transitions, 1296 flow [2024-06-28 02:13:35,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:13:35,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:13:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 241 transitions. [2024-06-28 02:13:35,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5835351089588378 [2024-06-28 02:13:35,784 INFO L175 Difference]: Start difference. First operand has 88 places, 102 transitions, 722 flow. Second operand 7 states and 241 transitions. [2024-06-28 02:13:35,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 177 transitions, 1296 flow [2024-06-28 02:13:35,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 177 transitions, 1198 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-28 02:13:35,826 INFO L231 Difference]: Finished difference. Result has 91 places, 110 transitions, 797 flow [2024-06-28 02:13:35,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=797, PETRI_PLACES=91, PETRI_TRANSITIONS=110} [2024-06-28 02:13:35,827 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 26 predicate places. [2024-06-28 02:13:35,827 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 110 transitions, 797 flow [2024-06-28 02:13:35,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:35,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:35,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:35,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 02:13:35,828 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:13:35,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:35,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1023002219, now seen corresponding path program 1 times [2024-06-28 02:13:35,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:35,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312122466] [2024-06-28 02:13:35,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:35,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:39,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-28 02:13:39,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:39,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312122466] [2024-06-28 02:13:39,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312122466] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:39,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:39,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:13:39,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220561014] [2024-06-28 02:13:39,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:39,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:13:39,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:39,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:13:39,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:13:39,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 02:13:39,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 110 transitions, 797 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:39,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:39,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 02:13:39,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:43,524 INFO L124 PetriNetUnfolderBase]: 19309/26525 cut-off events. [2024-06-28 02:13:43,524 INFO L125 PetriNetUnfolderBase]: For 59014/59097 co-relation queries the response was YES. [2024-06-28 02:13:43,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86604 conditions, 26525 events. 19309/26525 cut-off events. For 59014/59097 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 156882 event pairs, 7764 based on Foata normal form. 35/26551 useless extension candidates. Maximal degree in co-relation 86573. Up to 25503 conditions per place. [2024-06-28 02:13:43,787 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 162 selfloop transitions, 36 changer transitions 0/208 dead transitions. [2024-06-28 02:13:43,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 208 transitions, 1639 flow [2024-06-28 02:13:43,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:13:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:13:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 240 transitions. [2024-06-28 02:13:43,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5811138014527845 [2024-06-28 02:13:43,790 INFO L175 Difference]: Start difference. First operand has 91 places, 110 transitions, 797 flow. Second operand 7 states and 240 transitions. [2024-06-28 02:13:43,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 208 transitions, 1639 flow [2024-06-28 02:13:43,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 208 transitions, 1527 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 02:13:43,864 INFO L231 Difference]: Finished difference. Result has 97 places, 135 transitions, 1053 flow [2024-06-28 02:13:43,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1053, PETRI_PLACES=97, PETRI_TRANSITIONS=135} [2024-06-28 02:13:43,865 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 32 predicate places. [2024-06-28 02:13:43,865 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 135 transitions, 1053 flow [2024-06-28 02:13:43,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:43,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:43,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:43,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 02:13:43,866 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:13:43,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:43,867 INFO L85 PathProgramCache]: Analyzing trace with hash -822633719, now seen corresponding path program 2 times [2024-06-28 02:13:43,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:43,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351869556] [2024-06-28 02:13:43,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:43,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:47,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:47,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:47,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351869556] [2024-06-28 02:13:47,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351869556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:47,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:47,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:13:47,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478091851] [2024-06-28 02:13:47,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:47,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:13:47,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:47,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:13:47,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:13:47,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 02:13:47,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 135 transitions, 1053 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:47,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:47,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 02:13:47,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:51,716 INFO L124 PetriNetUnfolderBase]: 19360/26596 cut-off events. [2024-06-28 02:13:51,717 INFO L125 PetriNetUnfolderBase]: For 77205/77375 co-relation queries the response was YES. [2024-06-28 02:13:51,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93735 conditions, 26596 events. 19360/26596 cut-off events. For 77205/77375 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 156940 event pairs, 7764 based on Foata normal form. 60/26647 useless extension candidates. Maximal degree in co-relation 93700. Up to 25555 conditions per place. [2024-06-28 02:13:52,045 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 147 selfloop transitions, 40 changer transitions 0/197 dead transitions. [2024-06-28 02:13:52,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 197 transitions, 1664 flow [2024-06-28 02:13:52,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:13:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:13:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2024-06-28 02:13:52,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5819209039548022 [2024-06-28 02:13:52,048 INFO L175 Difference]: Start difference. First operand has 97 places, 135 transitions, 1053 flow. Second operand 6 states and 206 transitions. [2024-06-28 02:13:52,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 197 transitions, 1664 flow [2024-06-28 02:13:52,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 197 transitions, 1640 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-06-28 02:13:52,157 INFO L231 Difference]: Finished difference. Result has 103 places, 140 transitions, 1189 flow [2024-06-28 02:13:52,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1189, PETRI_PLACES=103, PETRI_TRANSITIONS=140} [2024-06-28 02:13:52,158 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 38 predicate places. [2024-06-28 02:13:52,159 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 140 transitions, 1189 flow [2024-06-28 02:13:52,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:52,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:52,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:52,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 02:13:52,159 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:13:52,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:52,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1035184295, now seen corresponding path program 3 times [2024-06-28 02:13:52,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:52,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175590880] [2024-06-28 02:13:52,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:52,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:55,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-28 02:13:55,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:55,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175590880] [2024-06-28 02:13:55,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175590880] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:55,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:55,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:13:55,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611415250] [2024-06-28 02:13:55,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:55,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:13:55,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:55,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:13:55,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:13:55,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 02:13:55,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 140 transitions, 1189 flow. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:55,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:55,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 02:13:55,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:14:00,535 INFO L124 PetriNetUnfolderBase]: 18606/25793 cut-off events. [2024-06-28 02:14:00,535 INFO L125 PetriNetUnfolderBase]: For 91206/91920 co-relation queries the response was YES. [2024-06-28 02:14:00,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93113 conditions, 25793 events. 18606/25793 cut-off events. For 91206/91920 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 158358 event pairs, 7005 based on Foata normal form. 150/25293 useless extension candidates. Maximal degree in co-relation 93074. Up to 24300 conditions per place. [2024-06-28 02:14:00,746 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 122 selfloop transitions, 56 changer transitions 0/196 dead transitions. [2024-06-28 02:14:00,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 196 transitions, 1683 flow [2024-06-28 02:14:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:14:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:14:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-06-28 02:14:00,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.596045197740113 [2024-06-28 02:14:00,749 INFO L175 Difference]: Start difference. First operand has 103 places, 140 transitions, 1189 flow. Second operand 6 states and 211 transitions. [2024-06-28 02:14:00,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 196 transitions, 1683 flow [2024-06-28 02:14:00,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 196 transitions, 1609 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-28 02:14:00,870 INFO L231 Difference]: Finished difference. Result has 105 places, 140 transitions, 1251 flow [2024-06-28 02:14:00,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1251, PETRI_PLACES=105, PETRI_TRANSITIONS=140} [2024-06-28 02:14:00,871 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 40 predicate places. [2024-06-28 02:14:00,871 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 140 transitions, 1251 flow [2024-06-28 02:14:00,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:14:00,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:00,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:14:00,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 02:14:00,872 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:14:00,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:00,873 INFO L85 PathProgramCache]: Analyzing trace with hash -822396569, now seen corresponding path program 3 times [2024-06-28 02:14:00,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:00,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033677530] [2024-06-28 02:14:00,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:00,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:14:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:14:03,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:14:03,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033677530] [2024-06-28 02:14:03,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033677530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:14:03,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:14:03,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:14:03,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143167833] [2024-06-28 02:14:03,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:14:03,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:14:03,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:14:03,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:14:03,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:14:03,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 02:14:03,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 140 transitions, 1251 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:14:03,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:14:03,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 02:14:03,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:14:07,864 INFO L124 PetriNetUnfolderBase]: 19335/26587 cut-off events. [2024-06-28 02:14:07,864 INFO L125 PetriNetUnfolderBase]: For 85852/86356 co-relation queries the response was YES. [2024-06-28 02:14:08,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94137 conditions, 26587 events. 19335/26587 cut-off events. For 85852/86356 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 157293 event pairs, 7829 based on Foata normal form. 80/26650 useless extension candidates. Maximal degree in co-relation 94098. Up to 25525 conditions per place. [2024-06-28 02:14:08,142 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 143 selfloop transitions, 40 changer transitions 0/193 dead transitions. [2024-06-28 02:14:08,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 193 transitions, 1769 flow [2024-06-28 02:14:08,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:14:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:14:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2024-06-28 02:14:08,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.559322033898305 [2024-06-28 02:14:08,146 INFO L175 Difference]: Start difference. First operand has 105 places, 140 transitions, 1251 flow. Second operand 6 states and 198 transitions. [2024-06-28 02:14:08,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 193 transitions, 1769 flow [2024-06-28 02:14:08,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 193 transitions, 1645 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-28 02:14:08,224 INFO L231 Difference]: Finished difference. Result has 107 places, 143 transitions, 1263 flow [2024-06-28 02:14:08,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1263, PETRI_PLACES=107, PETRI_TRANSITIONS=143} [2024-06-28 02:14:08,225 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 42 predicate places. [2024-06-28 02:14:08,225 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 143 transitions, 1263 flow [2024-06-28 02:14:08,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:14:08,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:08,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:14:08,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 02:14:08,226 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:14:08,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:08,226 INFO L85 PathProgramCache]: Analyzing trace with hash -822387641, now seen corresponding path program 1 times [2024-06-28 02:14:08,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:08,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591454095] [2024-06-28 02:14:08,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:08,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:14:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:14:10,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:14:10,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591454095] [2024-06-28 02:14:10,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591454095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:14:10,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:14:10,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:14:10,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222275166] [2024-06-28 02:14:10,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:14:10,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:14:10,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:14:10,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:14:10,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:14:10,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 02:14:10,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 143 transitions, 1263 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:14:10,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:14:10,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 02:14:10,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:14:15,218 INFO L124 PetriNetUnfolderBase]: 19320/27502 cut-off events. [2024-06-28 02:14:15,218 INFO L125 PetriNetUnfolderBase]: For 83734/83958 co-relation queries the response was YES. [2024-06-28 02:14:15,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94957 conditions, 27502 events. 19320/27502 cut-off events. For 83734/83958 co-relation queries the response was YES. Maximal size of possible extension queue 1032. Compared 172688 event pairs, 8404 based on Foata normal form. 52/27548 useless extension candidates. Maximal degree in co-relation 94916. Up to 25654 conditions per place. [2024-06-28 02:14:15,444 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 164 selfloop transitions, 18 changer transitions 0/192 dead transitions. [2024-06-28 02:14:15,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 192 transitions, 1768 flow [2024-06-28 02:14:15,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:14:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:14:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2024-06-28 02:14:15,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5451977401129944 [2024-06-28 02:14:15,447 INFO L175 Difference]: Start difference. First operand has 107 places, 143 transitions, 1263 flow. Second operand 6 states and 193 transitions. [2024-06-28 02:14:15,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 192 transitions, 1768 flow [2024-06-28 02:14:15,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 192 transitions, 1725 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-28 02:14:15,527 INFO L231 Difference]: Finished difference. Result has 111 places, 147 transitions, 1309 flow [2024-06-28 02:14:15,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1309, PETRI_PLACES=111, PETRI_TRANSITIONS=147} [2024-06-28 02:14:15,529 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 46 predicate places. [2024-06-28 02:14:15,529 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 147 transitions, 1309 flow [2024-06-28 02:14:15,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:14:15,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:15,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:14:15,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 02:14:15,530 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:14:15,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:15,530 INFO L85 PathProgramCache]: Analyzing trace with hash -750131903, now seen corresponding path program 1 times [2024-06-28 02:14:15,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:15,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915641176] [2024-06-28 02:14:15,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:15,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:14:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:14:19,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:14:19,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915641176] [2024-06-28 02:14:19,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915641176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:14:19,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:14:19,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:14:19,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008158608] [2024-06-28 02:14:19,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:14:19,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:14:19,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:14:19,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:14:19,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:14:19,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 02:14:19,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 147 transitions, 1309 flow. Second operand has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:14:19,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:14:19,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 02:14:19,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:14:24,545 INFO L124 PetriNetUnfolderBase]: 19371/26638 cut-off events. [2024-06-28 02:14:24,545 INFO L125 PetriNetUnfolderBase]: For 101937/102113 co-relation queries the response was YES. [2024-06-28 02:14:24,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98802 conditions, 26638 events. 19371/26638 cut-off events. For 101937/102113 co-relation queries the response was YES. Maximal size of possible extension queue 1001. Compared 157747 event pairs, 7267 based on Foata normal form. 62/26692 useless extension candidates. Maximal degree in co-relation 98759. Up to 25310 conditions per place. [2024-06-28 02:14:24,930 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 189 selfloop transitions, 59 changer transitions 0/258 dead transitions. [2024-06-28 02:14:24,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 258 transitions, 2280 flow [2024-06-28 02:14:24,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:14:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:14:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 280 transitions. [2024-06-28 02:14:24,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5932203389830508 [2024-06-28 02:14:24,932 INFO L175 Difference]: Start difference. First operand has 111 places, 147 transitions, 1309 flow. Second operand 8 states and 280 transitions. [2024-06-28 02:14:24,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 258 transitions, 2280 flow [2024-06-28 02:14:25,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 258 transitions, 2223 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-28 02:14:25,067 INFO L231 Difference]: Finished difference. Result has 117 places, 166 transitions, 1595 flow [2024-06-28 02:14:25,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1595, PETRI_PLACES=117, PETRI_TRANSITIONS=166} [2024-06-28 02:14:25,068 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 52 predicate places. [2024-06-28 02:14:25,068 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 166 transitions, 1595 flow [2024-06-28 02:14:25,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:14:25,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:25,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:14:25,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 02:14:25,069 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:14:25,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:25,069 INFO L85 PathProgramCache]: Analyzing trace with hash 190755959, now seen corresponding path program 2 times [2024-06-28 02:14:25,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:25,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9712313] [2024-06-28 02:14:25,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:25,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:14:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:14:29,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:14:29,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9712313] [2024-06-28 02:14:29,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9712313] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:14:29,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:14:29,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:14:29,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742407049] [2024-06-28 02:14:29,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:14:29,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:14:29,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:14:29,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:14:29,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:14:29,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 02:14:29,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 166 transitions, 1595 flow. Second operand has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:14:29,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:14:29,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 02:14:29,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:14:35,047 INFO L124 PetriNetUnfolderBase]: 19482/26814 cut-off events. [2024-06-28 02:14:35,048 INFO L125 PetriNetUnfolderBase]: For 124336/124510 co-relation queries the response was YES. [2024-06-28 02:14:35,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105583 conditions, 26814 events. 19482/26814 cut-off events. For 124336/124510 co-relation queries the response was YES. Maximal size of possible extension queue 1001. Compared 158966 event pairs, 7263 based on Foata normal form. 62/26868 useless extension candidates. Maximal degree in co-relation 105537. Up to 25621 conditions per place. [2024-06-28 02:14:35,419 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 199 selfloop transitions, 52 changer transitions 0/261 dead transitions. [2024-06-28 02:14:35,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 261 transitions, 2487 flow [2024-06-28 02:14:35,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:14:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:14:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 276 transitions. [2024-06-28 02:14:35,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5847457627118644 [2024-06-28 02:14:35,421 INFO L175 Difference]: Start difference. First operand has 117 places, 166 transitions, 1595 flow. Second operand 8 states and 276 transitions. [2024-06-28 02:14:35,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 261 transitions, 2487 flow [2024-06-28 02:14:35,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 261 transitions, 2404 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-28 02:14:35,529 INFO L231 Difference]: Finished difference. Result has 123 places, 175 transitions, 1747 flow [2024-06-28 02:14:35,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1524, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1747, PETRI_PLACES=123, PETRI_TRANSITIONS=175} [2024-06-28 02:14:35,530 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 58 predicate places. [2024-06-28 02:14:35,530 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 175 transitions, 1747 flow [2024-06-28 02:14:35,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:14:35,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:35,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:14:35,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 02:14:35,531 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:14:35,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:35,531 INFO L85 PathProgramCache]: Analyzing trace with hash -806046495, now seen corresponding path program 3 times [2024-06-28 02:14:35,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:35,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464825289] [2024-06-28 02:14:35,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:35,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:14:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:14:39,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:14:39,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464825289] [2024-06-28 02:14:39,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464825289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:14:39,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:14:39,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:14:39,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841733530] [2024-06-28 02:14:39,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:14:39,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:14:39,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:14:39,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:14:39,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:14:39,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 02:14:39,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 175 transitions, 1747 flow. Second operand has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:14:39,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:14:39,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 02:14:39,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:14:46,330 INFO L124 PetriNetUnfolderBase]: 19473/26802 cut-off events. [2024-06-28 02:14:46,330 INFO L125 PetriNetUnfolderBase]: For 132338/132502 co-relation queries the response was YES. [2024-06-28 02:14:46,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106726 conditions, 26802 events. 19473/26802 cut-off events. For 132338/132502 co-relation queries the response was YES. Maximal size of possible extension queue 1001. Compared 158958 event pairs, 7263 based on Foata normal form. 62/26856 useless extension candidates. Maximal degree in co-relation 106677. Up to 25612 conditions per place. [2024-06-28 02:14:46,603 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 225 selfloop transitions, 54 changer transitions 0/289 dead transitions. [2024-06-28 02:14:46,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 289 transitions, 2612 flow [2024-06-28 02:14:46,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:14:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:14:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 339 transitions. [2024-06-28 02:14:46,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5745762711864407 [2024-06-28 02:14:46,606 INFO L175 Difference]: Start difference. First operand has 123 places, 175 transitions, 1747 flow. Second operand 10 states and 339 transitions. [2024-06-28 02:14:46,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 289 transitions, 2612 flow [2024-06-28 02:14:46,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 289 transitions, 2547 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-28 02:14:46,798 INFO L231 Difference]: Finished difference. Result has 129 places, 176 transitions, 1811 flow [2024-06-28 02:14:46,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1682, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1811, PETRI_PLACES=129, PETRI_TRANSITIONS=176} [2024-06-28 02:14:46,799 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 64 predicate places. [2024-06-28 02:14:46,799 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 176 transitions, 1811 flow [2024-06-28 02:14:46,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:14:46,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:46,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:14:46,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 02:14:46,800 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:14:46,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:46,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2025950251, now seen corresponding path program 4 times [2024-06-28 02:14:46,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:46,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844301429] [2024-06-28 02:14:46,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:46,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:14:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:14:50,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:14:50,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844301429] [2024-06-28 02:14:50,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844301429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:14:50,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:14:50,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:14:50,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654270302] [2024-06-28 02:14:50,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:14:50,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:14:50,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:14:50,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:14:50,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:14:50,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 02:14:50,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 176 transitions, 1811 flow. Second operand has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:14:50,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:14:50,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 02:14:50,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:14:57,649 INFO L124 PetriNetUnfolderBase]: 19584/26982 cut-off events. [2024-06-28 02:14:57,650 INFO L125 PetriNetUnfolderBase]: For 142186/142350 co-relation queries the response was YES. [2024-06-28 02:14:57,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108882 conditions, 26982 events. 19584/26982 cut-off events. For 142186/142350 co-relation queries the response was YES. Maximal size of possible extension queue 1001. Compared 160250 event pairs, 7263 based on Foata normal form. 62/27036 useless extension candidates. Maximal degree in co-relation 108831. Up to 25589 conditions per place. [2024-06-28 02:14:57,972 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 211 selfloop transitions, 72 changer transitions 0/293 dead transitions. [2024-06-28 02:14:57,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 293 transitions, 2917 flow [2024-06-28 02:14:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:14:57,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:14:57,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 317 transitions. [2024-06-28 02:14:57,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5969868173258004 [2024-06-28 02:14:57,974 INFO L175 Difference]: Start difference. First operand has 129 places, 176 transitions, 1811 flow. Second operand 9 states and 317 transitions. [2024-06-28 02:14:57,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 293 transitions, 2917 flow [2024-06-28 02:14:58,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 293 transitions, 2805 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-28 02:14:58,256 INFO L231 Difference]: Finished difference. Result has 131 places, 185 transitions, 1984 flow [2024-06-28 02:14:58,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1699, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1984, PETRI_PLACES=131, PETRI_TRANSITIONS=185} [2024-06-28 02:14:58,256 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 66 predicate places. [2024-06-28 02:14:58,257 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 185 transitions, 1984 flow [2024-06-28 02:14:58,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:14:58,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:58,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:14:58,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 02:14:58,257 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:14:58,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:58,258 INFO L85 PathProgramCache]: Analyzing trace with hash 268155319, now seen corresponding path program 5 times [2024-06-28 02:14:58,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:58,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786409878] [2024-06-28 02:14:58,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:58,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:15:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:15:02,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:15:02,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786409878] [2024-06-28 02:15:02,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786409878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:15:02,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:15:02,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:15:02,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458087191] [2024-06-28 02:15:02,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:15:02,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:15:02,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:15:02,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:15:02,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:15:02,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 02:15:02,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 185 transitions, 1984 flow. Second operand has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:15:02,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:15:02,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 02:15:02,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand