./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.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/mix013.opt.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/mix013.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix013.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:24:09,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:24:09,845 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:24:09,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:24:09,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:24:09,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:24:09,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:24:09,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:24:09,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:24:09,889 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:24:09,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:24:09,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:24:09,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:24:09,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:24:09,892 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:24:09,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:24:09,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:24:09,893 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:24:09,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:24:09,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:24:09,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:24:09,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:24:09,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:24:09,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:24:09,896 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:24:09,896 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:24:09,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:24:09,896 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:24:09,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:24:09,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:24:09,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:24:09,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:24:09,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:24:09,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:24:09,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:24:09,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:24:09,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:24:09,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:24:09,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:24:09,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:24:09,913 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:24:09,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:24:09,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:24:09,914 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 01:24:10,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:24:10,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:24:10,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:24:10,213 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:24:10,214 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:24:10,215 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/mix013.opt.yml/witness.yml [2024-06-28 01:24:10,465 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:24:10,466 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:24:10,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2024-06-28 01:24:11,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:24:11,931 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:24:11,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2024-06-28 01:24:11,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162f003d1/5d4ca6b83dc24b8989dc92a4c4bba233/FLAGafd83631f [2024-06-28 01:24:11,973 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162f003d1/5d4ca6b83dc24b8989dc92a4c4bba233 [2024-06-28 01:24:11,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:24:11,975 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:24:11,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:24:11,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:24:11,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:24:11,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:24:10" (1/2) ... [2024-06-28 01:24:11,982 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17dcef7e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:24:11, skipping insertion in model container [2024-06-28 01:24:11,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:24:10" (1/2) ... [2024-06-28 01:24:11,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5a635f75 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:24:11, skipping insertion in model container [2024-06-28 01:24:11,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:24:11" (2/2) ... [2024-06-28 01:24:11,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17dcef7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:11, skipping insertion in model container [2024-06-28 01:24:11,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:24:11" (2/2) ... [2024-06-28 01:24:11,985 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:24:12,119 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:24:12,120 INFO L97 edCorrectnessWitness]: Location invariant before [L879-L879] ((((((((((((((((((((((((! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || ((((((((((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0) [2024-06-28 01:24:12,120 INFO L97 edCorrectnessWitness]: Location invariant before [L876-L876] ((((((((((((((((((((((((! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || ((((((((((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0) [2024-06-28 01:24:12,120 INFO L97 edCorrectnessWitness]: Location invariant before [L878-L878] ((((((((((((((((((((((((! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || ((((((((((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0) [2024-06-28 01:24:12,121 INFO L97 edCorrectnessWitness]: Location invariant before [L874-L874] ((((((((((((((((((((((((! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || ((((((((((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0) [2024-06-28 01:24:12,122 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:24:12,122 INFO L106 edCorrectnessWitness]: ghost_update [L872-L872] multithreaded = 1; [2024-06-28 01:24:12,169 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:24:12,355 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/mix013.opt.i[944,957] [2024-06-28 01:24:12,539 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:24:12,549 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:24:12,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/mix013.opt.i[944,957] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:24:12,689 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:24:12,726 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:24:12,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:12 WrapperNode [2024-06-28 01:24:12,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:24:12,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:24:12,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:24:12,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:24:12,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:12" (1/1) ... [2024-06-28 01:24:12,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:12" (1/1) ... [2024-06-28 01:24:12,797 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2024-06-28 01:24:12,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:24:12,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:24:12,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:24:12,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:24:12,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:12" (1/1) ... [2024-06-28 01:24:12,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:12" (1/1) ... [2024-06-28 01:24:12,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:12" (1/1) ... [2024-06-28 01:24:12,861 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-28 01:24:12,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:12" (1/1) ... [2024-06-28 01:24:12,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:12" (1/1) ... [2024-06-28 01:24:12,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:12" (1/1) ... [2024-06-28 01:24:12,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:12" (1/1) ... [2024-06-28 01:24:12,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:12" (1/1) ... [2024-06-28 01:24:12,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:12" (1/1) ... [2024-06-28 01:24:12,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:24:12,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:24:12,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:24:12,916 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:24:12,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:12" (1/1) ... [2024-06-28 01:24:12,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:24:12,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:24:12,958 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 01:24:12,965 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 01:24:12,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:24:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:24:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:24:12,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:24:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:24:12,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:24:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 01:24:12,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 01:24:12,989 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 01:24:12,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 01:24:12,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:24:12,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:24:12,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:24:12,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:24:12,991 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 01:24:13,163 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:24:13,165 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:24:13,618 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:24:13,618 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:24:13,801 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:24:13,801 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:24:13,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:24:13 BoogieIcfgContainer [2024-06-28 01:24:13,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:24:13,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:24:13,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:24:13,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:24:13,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:24:10" (1/4) ... [2024-06-28 01:24:13,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f8b2be and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:24:13, skipping insertion in model container [2024-06-28 01:24:13,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:24:11" (2/4) ... [2024-06-28 01:24:13,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f8b2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:24:13, skipping insertion in model container [2024-06-28 01:24:13,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:24:12" (3/4) ... [2024-06-28 01:24:13,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f8b2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:24:13, skipping insertion in model container [2024-06-28 01:24:13,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:24:13" (4/4) ... [2024-06-28 01:24:13,812 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2024-06-28 01:24:13,828 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:24:13,828 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-28 01:24:13,828 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:24:13,882 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:24:13,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:24:13,983 INFO L124 PetriNetUnfolderBase]: 1/55 cut-off events. [2024-06-28 01:24:13,988 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:24:13,992 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 6. Compared 107 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2024-06-28 01:24:13,992 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:24:13,998 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 55 transitions, 122 flow [2024-06-28 01:24:14,006 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:24:14,016 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;@68d69e81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:24:14,016 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-28 01:24:14,023 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:24:14,023 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:24:14,023 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:24:14,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:14,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:24:14,025 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:24:14,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:14,034 INFO L85 PathProgramCache]: Analyzing trace with hash 395618492, now seen corresponding path program 1 times [2024-06-28 01:24:14,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:14,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875075488] [2024-06-28 01:24:14,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:14,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:24:15,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:15,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875075488] [2024-06-28 01:24:15,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875075488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:15,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:15,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:24:15,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397405075] [2024-06-28 01:24:15,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:15,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:24:15,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:15,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:24:15,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:24:15,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-06-28 01:24:15,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:15,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:15,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-06-28 01:24:15,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:17,641 INFO L124 PetriNetUnfolderBase]: 12650/19246 cut-off events. [2024-06-28 01:24:17,641 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2024-06-28 01:24:17,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36421 conditions, 19246 events. 12650/19246 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 137675 event pairs, 10423 based on Foata normal form. 481/18338 useless extension candidates. Maximal degree in co-relation 36408. Up to 16952 conditions per place. [2024-06-28 01:24:17,821 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 49 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2024-06-28 01:24:17,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 73 transitions, 277 flow [2024-06-28 01:24:17,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:24:17,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:24:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2024-06-28 01:24:17,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7175141242937854 [2024-06-28 01:24:17,834 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 127 transitions. [2024-06-28 01:24:17,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 73 transitions, 277 flow [2024-06-28 01:24:17,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 270 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 01:24:17,840 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 162 flow [2024-06-28 01:24:17,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2024-06-28 01:24:17,845 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2024-06-28 01:24:17,845 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 162 flow [2024-06-28 01:24:17,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:17,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:17,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:17,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:24:17,847 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:24:17,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:17,847 INFO L85 PathProgramCache]: Analyzing trace with hash -2062656165, now seen corresponding path program 1 times [2024-06-28 01:24:17,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:17,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700216831] [2024-06-28 01:24:17,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:17,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:18,738 INFO 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 01:24:18,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:18,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700216831] [2024-06-28 01:24:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700216831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:18,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:24:18,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933842960] [2024-06-28 01:24:18,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:18,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:24:18,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:18,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:24:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:24:18,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2024-06-28 01:24:18,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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 01:24:18,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:18,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2024-06-28 01:24:18,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:21,285 INFO L124 PetriNetUnfolderBase]: 14407/21717 cut-off events. [2024-06-28 01:24:21,286 INFO L125 PetriNetUnfolderBase]: For 3834/3834 co-relation queries the response was YES. [2024-06-28 01:24:21,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46482 conditions, 21717 events. 14407/21717 cut-off events. For 3834/3834 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 154848 event pairs, 10359 based on Foata normal form. 4/20442 useless extension candidates. Maximal degree in co-relation 46470. Up to 19236 conditions per place. [2024-06-28 01:24:21,427 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 64 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2024-06-28 01:24:21,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 92 transitions, 398 flow [2024-06-28 01:24:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:24:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:24:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2024-06-28 01:24:21,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.690677966101695 [2024-06-28 01:24:21,430 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 162 flow. Second operand 4 states and 163 transitions. [2024-06-28 01:24:21,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 92 transitions, 398 flow [2024-06-28 01:24:21,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 92 transitions, 392 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:24:21,433 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 220 flow [2024-06-28 01:24:21,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-06-28 01:24:21,434 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 2 predicate places. [2024-06-28 01:24:21,434 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 220 flow [2024-06-28 01:24:21,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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 01:24:21,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:21,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:21,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:24:21,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:24:21,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:21,436 INFO L85 PathProgramCache]: Analyzing trace with hash -490710690, now seen corresponding path program 1 times [2024-06-28 01:24:21,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:21,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981455858] [2024-06-28 01:24:21,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:21,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:22,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:24:22,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:22,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981455858] [2024-06-28 01:24:22,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981455858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:22,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:22,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:24:22,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658560995] [2024-06-28 01:24:22,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:22,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:24:22,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:22,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:24:22,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:24:22,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2024-06-28 01:24:22,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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 01:24:22,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:22,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2024-06-28 01:24:22,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:25,584 INFO L124 PetriNetUnfolderBase]: 18290/27386 cut-off events. [2024-06-28 01:24:25,584 INFO L125 PetriNetUnfolderBase]: For 12783/12783 co-relation queries the response was YES. [2024-06-28 01:24:25,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64524 conditions, 27386 events. 18290/27386 cut-off events. For 12783/12783 co-relation queries the response was YES. Maximal size of possible extension queue 1205. Compared 196834 event pairs, 10514 based on Foata normal form. 8/25799 useless extension candidates. Maximal degree in co-relation 64510. Up to 24240 conditions per place. [2024-06-28 01:24:25,919 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 90 selfloop transitions, 20 changer transitions 0/126 dead transitions. [2024-06-28 01:24:25,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 126 transitions, 618 flow [2024-06-28 01:24:25,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:24:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:24:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2024-06-28 01:24:25,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6610169491525424 [2024-06-28 01:24:25,927 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 220 flow. Second operand 6 states and 234 transitions. [2024-06-28 01:24:25,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 126 transitions, 618 flow [2024-06-28 01:24:25,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 126 transitions, 582 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-28 01:24:25,935 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 299 flow [2024-06-28 01:24:25,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2024-06-28 01:24:25,937 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 6 predicate places. [2024-06-28 01:24:25,937 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 299 flow [2024-06-28 01:24:25,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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 01:24:25,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:25,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:25,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:24:25,938 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:24:25,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:25,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1893448648, now seen corresponding path program 1 times [2024-06-28 01:24:25,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:25,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567510111] [2024-06-28 01:24:25,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:25,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:24:27,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:27,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567510111] [2024-06-28 01:24:27,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567510111] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:27,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:27,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:24:27,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166663842] [2024-06-28 01:24:27,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:27,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:24:27,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:27,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:24:27,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:24:27,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:24:27,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 299 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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 01:24:27,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:27,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:24:27,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:30,160 INFO L124 PetriNetUnfolderBase]: 23241/32098 cut-off events. [2024-06-28 01:24:30,161 INFO L125 PetriNetUnfolderBase]: For 24878/24878 co-relation queries the response was YES. [2024-06-28 01:24:30,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85844 conditions, 32098 events. 23241/32098 cut-off events. For 24878/24878 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 201210 event pairs, 10984 based on Foata normal form. 3/30895 useless extension candidates. Maximal degree in co-relation 85827. Up to 30798 conditions per place. [2024-06-28 01:24:30,405 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 78 selfloop transitions, 12 changer transitions 0/104 dead transitions. [2024-06-28 01:24:30,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 104 transitions, 573 flow [2024-06-28 01:24:30,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:24:30,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:24:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-06-28 01:24:30,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5728813559322034 [2024-06-28 01:24:30,408 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 299 flow. Second operand 5 states and 169 transitions. [2024-06-28 01:24:30,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 104 transitions, 573 flow [2024-06-28 01:24:30,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 104 transitions, 524 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-28 01:24:30,420 INFO L231 Difference]: Finished difference. Result has 75 places, 77 transitions, 326 flow [2024-06-28 01:24:30,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=75, PETRI_TRANSITIONS=77} [2024-06-28 01:24:30,422 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 8 predicate places. [2024-06-28 01:24:30,422 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 326 flow [2024-06-28 01:24:30,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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 01:24:30,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:30,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:30,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:24:30,423 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:24:30,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:30,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1432635832, now seen corresponding path program 1 times [2024-06-28 01:24:30,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:30,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415984137] [2024-06-28 01:24:30,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:30,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:31,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:24:31,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:31,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415984137] [2024-06-28 01:24:31,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415984137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:31,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:31,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:24:31,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123689142] [2024-06-28 01:24:31,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:31,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:24:31,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:31,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:24:31,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:24:31,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:24:31,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 326 flow. Second operand has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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 01:24:31,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:31,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:24:31,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:35,154 INFO L124 PetriNetUnfolderBase]: 23231/32153 cut-off events. [2024-06-28 01:24:35,154 INFO L125 PetriNetUnfolderBase]: For 37152/37152 co-relation queries the response was YES. [2024-06-28 01:24:35,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92989 conditions, 32153 events. 23231/32153 cut-off events. For 37152/37152 co-relation queries the response was YES. Maximal size of possible extension queue 1189. Compared 202403 event pairs, 10641 based on Foata normal form. 3/31017 useless extension candidates. Maximal degree in co-relation 92970. Up to 30760 conditions per place. [2024-06-28 01:24:35,357 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 90 selfloop transitions, 17 changer transitions 0/121 dead transitions. [2024-06-28 01:24:35,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 121 transitions, 670 flow [2024-06-28 01:24:35,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:24:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:24:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2024-06-28 01:24:35,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.576271186440678 [2024-06-28 01:24:35,359 INFO L175 Difference]: Start difference. First operand has 75 places, 77 transitions, 326 flow. Second operand 6 states and 204 transitions. [2024-06-28 01:24:35,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 121 transitions, 670 flow [2024-06-28 01:24:35,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 121 transitions, 632 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-28 01:24:35,371 INFO L231 Difference]: Finished difference. Result has 78 places, 82 transitions, 382 flow [2024-06-28 01:24:35,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=382, PETRI_PLACES=78, PETRI_TRANSITIONS=82} [2024-06-28 01:24:35,372 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 11 predicate places. [2024-06-28 01:24:35,372 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 82 transitions, 382 flow [2024-06-28 01:24:35,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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 01:24:35,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:35,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:35,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:24:35,373 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:24:35,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:35,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1058356285, now seen corresponding path program 1 times [2024-06-28 01:24:35,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:35,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543771119] [2024-06-28 01:24:35,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:35,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:24:36,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:36,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543771119] [2024-06-28 01:24:36,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543771119] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:36,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:36,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:24:36,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838276026] [2024-06-28 01:24:36,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:36,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:24:36,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:36,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:24:36,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:24:36,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:24:36,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 82 transitions, 382 flow. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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 01:24:36,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:36,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:24:36,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:40,372 INFO L124 PetriNetUnfolderBase]: 26555/35621 cut-off events. [2024-06-28 01:24:40,373 INFO L125 PetriNetUnfolderBase]: For 62271/62303 co-relation queries the response was YES. [2024-06-28 01:24:40,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111882 conditions, 35621 events. 26555/35621 cut-off events. For 62271/62303 co-relation queries the response was YES. Maximal size of possible extension queue 1282. Compared 214231 event pairs, 11867 based on Foata normal form. 11/34609 useless extension candidates. Maximal degree in co-relation 111862. Up to 35038 conditions per place. [2024-06-28 01:24:40,600 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 98 selfloop transitions, 26 changer transitions 0/137 dead transitions. [2024-06-28 01:24:40,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 137 transitions, 854 flow [2024-06-28 01:24:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:24:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:24:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2024-06-28 01:24:40,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5847457627118644 [2024-06-28 01:24:40,602 INFO L175 Difference]: Start difference. First operand has 78 places, 82 transitions, 382 flow. Second operand 6 states and 207 transitions. [2024-06-28 01:24:40,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 137 transitions, 854 flow [2024-06-28 01:24:40,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 137 transitions, 798 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-28 01:24:40,619 INFO L231 Difference]: Finished difference. Result has 80 places, 92 transitions, 488 flow [2024-06-28 01:24:40,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=80, PETRI_TRANSITIONS=92} [2024-06-28 01:24:40,620 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 13 predicate places. [2024-06-28 01:24:40,620 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 92 transitions, 488 flow [2024-06-28 01:24:40,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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 01:24:40,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:40,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:40,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:24:40,621 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:24:40,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1493196933, now seen corresponding path program 2 times [2024-06-28 01:24:40,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:40,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097887583] [2024-06-28 01:24:40,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:40,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:41,820 INFO 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 01:24:41,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:41,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097887583] [2024-06-28 01:24:41,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097887583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:41,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:41,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:24:41,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026703754] [2024-06-28 01:24:41,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:41,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:24:41,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:41,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:24:41,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:24:41,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:24:41,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 92 transitions, 488 flow. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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 01:24:41,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:41,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:24:41,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:45,432 INFO L124 PetriNetUnfolderBase]: 26545/35609 cut-off events. [2024-06-28 01:24:45,432 INFO L125 PetriNetUnfolderBase]: For 84124/84154 co-relation queries the response was YES. [2024-06-28 01:24:45,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119826 conditions, 35609 events. 26545/35609 cut-off events. For 84124/84154 co-relation queries the response was YES. Maximal size of possible extension queue 1282. Compared 214150 event pairs, 11870 based on Foata normal form. 9/34596 useless extension candidates. Maximal degree in co-relation 119805. Up to 35028 conditions per place. [2024-06-28 01:24:45,645 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 92 selfloop transitions, 26 changer transitions 0/131 dead transitions. [2024-06-28 01:24:45,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 131 transitions, 816 flow [2024-06-28 01:24:45,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:24:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:24:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2024-06-28 01:24:45,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5677966101694916 [2024-06-28 01:24:45,648 INFO L175 Difference]: Start difference. First operand has 80 places, 92 transitions, 488 flow. Second operand 6 states and 201 transitions. [2024-06-28 01:24:45,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 131 transitions, 816 flow [2024-06-28 01:24:45,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 131 transitions, 742 flow, removed 31 selfloop flow, removed 2 redundant places. [2024-06-28 01:24:45,694 INFO L231 Difference]: Finished difference. Result has 84 places, 92 transitions, 478 flow [2024-06-28 01:24:45,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=478, PETRI_PLACES=84, PETRI_TRANSITIONS=92} [2024-06-28 01:24:45,695 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 17 predicate places. [2024-06-28 01:24:45,695 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 92 transitions, 478 flow [2024-06-28 01:24:45,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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 01:24:45,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:45,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:45,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:24:45,696 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:24:45,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1858191109, now seen corresponding path program 1 times [2024-06-28 01:24:45,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:45,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554502415] [2024-06-28 01:24:45,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:45,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:24:46,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:46,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554502415] [2024-06-28 01:24:46,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554502415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:46,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:46,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:24:46,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902553495] [2024-06-28 01:24:46,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:46,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:24:46,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:46,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:24:46,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:24:47,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:24:47,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 92 transitions, 478 flow. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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 01:24:47,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:47,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:24:47,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:51,013 INFO L124 PetriNetUnfolderBase]: 26744/35885 cut-off events. [2024-06-28 01:24:51,013 INFO L125 PetriNetUnfolderBase]: For 88600/88628 co-relation queries the response was YES. [2024-06-28 01:24:51,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120370 conditions, 35885 events. 26744/35885 cut-off events. For 88600/88628 co-relation queries the response was YES. Maximal size of possible extension queue 1282. Compared 215378 event pairs, 11855 based on Foata normal form. 7/34841 useless extension candidates. Maximal degree in co-relation 120347. Up to 35248 conditions per place. [2024-06-28 01:24:51,248 INFO L140 encePairwiseOnDemand]: 42/59 looper letters, 127 selfloop transitions, 40 changer transitions 0/180 dead transitions. [2024-06-28 01:24:51,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 180 transitions, 1118 flow [2024-06-28 01:24:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:24:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:24:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 274 transitions. [2024-06-28 01:24:51,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5805084745762712 [2024-06-28 01:24:51,252 INFO L175 Difference]: Start difference. First operand has 84 places, 92 transitions, 478 flow. Second operand 8 states and 274 transitions. [2024-06-28 01:24:51,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 180 transitions, 1118 flow [2024-06-28 01:24:51,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 180 transitions, 1026 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-28 01:24:51,292 INFO L231 Difference]: Finished difference. Result has 88 places, 116 transitions, 676 flow [2024-06-28 01:24:51,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=676, PETRI_PLACES=88, PETRI_TRANSITIONS=116} [2024-06-28 01:24:51,293 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 21 predicate places. [2024-06-28 01:24:51,293 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 116 transitions, 676 flow [2024-06-28 01:24:51,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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 01:24:51,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:51,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:51,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:24:51,294 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:24:51,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:51,295 INFO L85 PathProgramCache]: Analyzing trace with hash -376995781, now seen corresponding path program 2 times [2024-06-28 01:24:51,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:51,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882731636] [2024-06-28 01:24:51,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:51,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:52,654 INFO 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 01:24:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882731636] [2024-06-28 01:24:52,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882731636] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:52,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:52,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:24:52,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860419511] [2024-06-28 01:24:52,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:52,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:24:52,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:52,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:24:52,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:24:52,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:24:52,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 116 transitions, 676 flow. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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 01:24:52,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:52,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:24:52,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:56,697 INFO L124 PetriNetUnfolderBase]: 26793/35931 cut-off events. [2024-06-28 01:24:56,697 INFO L125 PetriNetUnfolderBase]: For 116053/116085 co-relation queries the response was YES. [2024-06-28 01:24:56,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130048 conditions, 35931 events. 26793/35931 cut-off events. For 116053/116085 co-relation queries the response was YES. Maximal size of possible extension queue 1278. Compared 215003 event pairs, 11480 based on Foata normal form. 11/34883 useless extension candidates. Maximal degree in co-relation 130023. Up to 35272 conditions per place. [2024-06-28 01:24:56,942 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 125 selfloop transitions, 42 changer transitions 0/180 dead transitions. [2024-06-28 01:24:56,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 180 transitions, 1254 flow [2024-06-28 01:24:56,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:24:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:24:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 239 transitions. [2024-06-28 01:24:56,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5786924939467313 [2024-06-28 01:24:56,944 INFO L175 Difference]: Start difference. First operand has 88 places, 116 transitions, 676 flow. Second operand 7 states and 239 transitions. [2024-06-28 01:24:56,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 180 transitions, 1254 flow [2024-06-28 01:24:56,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 180 transitions, 1172 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-28 01:24:56,993 INFO L231 Difference]: Finished difference. Result has 92 places, 121 transitions, 769 flow [2024-06-28 01:24:56,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=769, PETRI_PLACES=92, PETRI_TRANSITIONS=121} [2024-06-28 01:24:56,994 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 25 predicate places. [2024-06-28 01:24:56,994 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 121 transitions, 769 flow [2024-06-28 01:24:56,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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 01:24:56,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:56,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:56,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:24:56,995 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:24:56,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:56,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1928084777, now seen corresponding path program 1 times [2024-06-28 01:24:56,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:56,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178147223] [2024-06-28 01:24:56,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:56,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:58,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 01:24:58,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:58,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178147223] [2024-06-28 01:24:58,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178147223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:58,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:58,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:24:58,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004783660] [2024-06-28 01:24:58,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:58,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:24:58,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:58,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:24:58,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:24:58,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:24:58,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 121 transitions, 769 flow. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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 01:24:58,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:58,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:24:58,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand