./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix007.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix007.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix007.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix007.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:20:18,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:20:18,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:20:18,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:20:18,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:20:18,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:20:18,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:20:18,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:20:18,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:20:18,875 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:20:18,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:20:18,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:20:18,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:20:18,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:20:18,877 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:20:18,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:20:18,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:20:18,878 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:20:18,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:20:18,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:20:18,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:20:18,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:20:18,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:20:18,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:20:18,880 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:20:18,880 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:20:18,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:20:18,880 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:20:18,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:20:18,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:20:18,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:20:18,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:20:18,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:20:18,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:20:18,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:20:18,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:20:18,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:20:18,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:20:18,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:20:18,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:20:18,884 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:20:18,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:20:18,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:20:18,884 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:20:19,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:20:19,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:20:19,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:20:19,134 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:20:19,135 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:20:19,136 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/mix007.oepc.yml/witness.yml [2024-06-28 01:20:19,325 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:20:19,325 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:20:19,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007.oepc.i [2024-06-28 01:20:20,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:20:20,543 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:20:20,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007.oepc.i [2024-06-28 01:20:20,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f658937/fbbc250249984203acf0454066dc4036/FLAG9b677cf77 [2024-06-28 01:20:20,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f658937/fbbc250249984203acf0454066dc4036 [2024-06-28 01:20:20,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:20:20,581 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:20:20,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:20:20,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:20:20,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:20:20,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:20:19" (1/2) ... [2024-06-28 01:20:20,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ab5a0a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:20:20, skipping insertion in model container [2024-06-28 01:20:20,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:20:19" (1/2) ... [2024-06-28 01:20:20,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@77a6cc8d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:20:20, skipping insertion in model container [2024-06-28 01:20:20,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:20:20" (2/2) ... [2024-06-28 01:20:20,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ab5a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:20:20, skipping insertion in model container [2024-06-28 01:20:20,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:20:20" (2/2) ... [2024-06-28 01:20:20,591 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:20:20,695 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:20:20,696 INFO L97 edCorrectnessWitness]: Location invariant before [L878-L878] (((((((((((((((((((((((! multithreaded || ((y == 0 || y == 1) || y == 2)) && (! multithreaded || a$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff0_thd4 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$r_buff1_thd4 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (a$w_buff0 == 0 || a$w_buff0 == 1))) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || a$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (a$w_buff1 == 0 || a$w_buff1 == 1))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (a$mem_tmp == 0 || a$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0) [2024-06-28 01:20:20,696 INFO L97 edCorrectnessWitness]: Location invariant before [L874-L874] (((((((((((((((((((((((! multithreaded || ((y == 0 || y == 1) || y == 2)) && (! multithreaded || a$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff0_thd4 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$r_buff1_thd4 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (a$w_buff0 == 0 || a$w_buff0 == 1))) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || a$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (a$w_buff1 == 0 || a$w_buff1 == 1))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (a$mem_tmp == 0 || a$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0) [2024-06-28 01:20:20,696 INFO L97 edCorrectnessWitness]: Location invariant before [L876-L876] (((((((((((((((((((((((! multithreaded || ((y == 0 || y == 1) || y == 2)) && (! multithreaded || a$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff0_thd4 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$r_buff1_thd4 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (a$w_buff0 == 0 || a$w_buff0 == 1))) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || a$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (a$w_buff1 == 0 || a$w_buff1 == 1))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (a$mem_tmp == 0 || a$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0) [2024-06-28 01:20:20,696 INFO L97 edCorrectnessWitness]: Location invariant before [L879-L879] (((((((((((((((((((((((! multithreaded || ((y == 0 || y == 1) || y == 2)) && (! multithreaded || a$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff0_thd4 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$r_buff1_thd4 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (a$w_buff0 == 0 || a$w_buff0 == 1))) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || a$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (a$w_buff1 == 0 || a$w_buff1 == 1))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (a$mem_tmp == 0 || a$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0) [2024-06-28 01:20:20,697 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:20:20,697 INFO L106 edCorrectnessWitness]: ghost_update [L872-L872] multithreaded = 1; [2024-06-28 01:20:20,732 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:20:20,877 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/mix007.oepc.i[945,958] [2024-06-28 01:20:21,054 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:20:21,062 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:20:21,087 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/mix007.oepc.i[945,958] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:20:21,183 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:20:21,221 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:20:21,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:20:21 WrapperNode [2024-06-28 01:20:21,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:20:21,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:20:21,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:20:21,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:20:21,227 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:20:21" (1/1) ... [2024-06-28 01:20:21,248 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:20:21" (1/1) ... [2024-06-28 01:20:21,279 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2024-06-28 01:20:21,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:20:21,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:20:21,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:20:21,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:20:21,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:20:21" (1/1) ... [2024-06-28 01:20:21,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:20:21" (1/1) ... [2024-06-28 01:20:21,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:20:21" (1/1) ... [2024-06-28 01:20:21,307 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:20:21,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:20:21" (1/1) ... [2024-06-28 01:20:21,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:20:21" (1/1) ... [2024-06-28 01:20:21,317 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:20:21" (1/1) ... [2024-06-28 01:20:21,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:20:21" (1/1) ... [2024-06-28 01:20:21,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:20:21" (1/1) ... [2024-06-28 01:20:21,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:20:21" (1/1) ... [2024-06-28 01:20:21,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:20:21,326 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:20:21,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:20:21,327 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:20:21,327 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:20:21" (1/1) ... [2024-06-28 01:20:21,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:20:21,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:20:21,361 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:20:21,385 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:20:21,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:20:21,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:20:21,400 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:20:21,400 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:20:21,400 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:20:21,400 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:20:21,401 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 01:20:21,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 01:20:21,401 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 01:20:21,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 01:20:21,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:20:21,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:20:21,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:20:21,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:20:21,405 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:20:21,537 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:20:21,539 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:20:21,847 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:20:21,848 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:20:22,062 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:20:22,062 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:20:22,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:20:22 BoogieIcfgContainer [2024-06-28 01:20:22,063 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:20:22,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:20:22,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:20:22,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:20:22,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:20:19" (1/4) ... [2024-06-28 01:20:22,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23136091 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:20:22, skipping insertion in model container [2024-06-28 01:20:22,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:20:20" (2/4) ... [2024-06-28 01:20:22,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23136091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:20:22, skipping insertion in model container [2024-06-28 01:20:22,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:20:21" (3/4) ... [2024-06-28 01:20:22,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23136091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:20:22, skipping insertion in model container [2024-06-28 01:20:22,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:20:22" (4/4) ... [2024-06-28 01:20:22,072 INFO L112 eAbstractionObserver]: Analyzing ICFG mix007.oepc.i [2024-06-28 01:20:22,085 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:20:22,086 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-28 01:20:22,086 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:20:22,140 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:20:22,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:20:22,203 INFO L124 PetriNetUnfolderBase]: 1/55 cut-off events. [2024-06-28 01:20:22,203 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:20:22,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 1/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 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:20:22,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:20:22,210 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 55 transitions, 122 flow [2024-06-28 01:20:22,221 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:20:22,228 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;@44c6b14f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:20:22,228 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-28 01:20:22,233 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:20:22,234 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:20:22,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:20:22,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:20:22,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:20:22,235 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:20:22,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:20:22,243 INFO L85 PathProgramCache]: Analyzing trace with hash 387771664, now seen corresponding path program 1 times [2024-06-28 01:20:22,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:20:22,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301336513] [2024-06-28 01:20:22,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:20:22,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:20:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:20:23,175 INFO 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:20:23,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:20:23,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301336513] [2024-06-28 01:20:23,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301336513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:20:23,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:20:23,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:20:23,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747396367] [2024-06-28 01:20:23,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:20:23,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:20:23,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:20:23,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:20:23,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:20:23,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 59 [2024-06-28 01:20:23,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:20:23,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:23,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 59 [2024-06-28 01:20:23,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:26,523 INFO L124 PetriNetUnfolderBase]: 25891/38550 cut-off events. [2024-06-28 01:20:26,523 INFO L125 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2024-06-28 01:20:26,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73338 conditions, 38550 events. 25891/38550 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 277799 event pairs, 21103 based on Foata normal form. 901/36533 useless extension candidates. Maximal degree in co-relation 73325. Up to 34321 conditions per place. [2024-06-28 01:20:26,861 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 52 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2024-06-28 01:20:26,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 73 transitions, 283 flow [2024-06-28 01:20:26,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:20:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:20:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2024-06-28 01:20:26,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6836158192090396 [2024-06-28 01:20:26,871 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 121 transitions. [2024-06-28 01:20:26,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 73 transitions, 283 flow [2024-06-28 01:20:26,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 276 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 01:20:26,876 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 162 flow [2024-06-28 01:20:26,878 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:20:26,880 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2024-06-28 01:20:26,880 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 162 flow [2024-06-28 01:20:26,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:20:26,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:20:26,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:20:26,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:20:26,881 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:20:26,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:20:26,882 INFO L85 PathProgramCache]: Analyzing trace with hash 387772521, now seen corresponding path program 1 times [2024-06-28 01:20:26,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:20:26,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964888356] [2024-06-28 01:20:26,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:20:26,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:20:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:20:26,921 INFO 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:20:26,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:20:26,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964888356] [2024-06-28 01:20:26,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964888356] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:20:26,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:20:26,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:20:26,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562581286] [2024-06-28 01:20:26,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:20:26,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:20:26,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:20:26,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:20:26,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:20:26,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 59 [2024-06-28 01:20:26,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:20:26,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:26,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 59 [2024-06-28 01:20:26,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:27,806 INFO L124 PetriNetUnfolderBase]: 5199/9232 cut-off events. [2024-06-28 01:20:27,806 INFO L125 PetriNetUnfolderBase]: For 694/694 co-relation queries the response was YES. [2024-06-28 01:20:27,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17506 conditions, 9232 events. 5199/9232 cut-off events. For 694/694 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 73953 event pairs, 3384 based on Foata normal form. 0/8422 useless extension candidates. Maximal degree in co-relation 17494. Up to 6056 conditions per place. [2024-06-28 01:20:27,863 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 45 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2024-06-28 01:20:27,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 78 transitions, 297 flow [2024-06-28 01:20:27,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:20:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:20:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2024-06-28 01:20:27,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7966101694915254 [2024-06-28 01:20:27,865 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 162 flow. Second operand 3 states and 141 transitions. [2024-06-28 01:20:27,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 78 transitions, 297 flow [2024-06-28 01:20:27,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:20:27,868 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 154 flow [2024-06-28 01:20:27,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-06-28 01:20:27,869 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2024-06-28 01:20:27,869 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 154 flow [2024-06-28 01:20:27,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:20:27,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:20:27,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:20:27,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:20:27,870 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:20:27,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:20:27,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1012775142, now seen corresponding path program 1 times [2024-06-28 01:20:27,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:20:27,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855141295] [2024-06-28 01:20:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:20:27,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:20:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:20:28,458 INFO 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:20:28,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:20:28,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855141295] [2024-06-28 01:20:28,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855141295] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:20:28,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:20:28,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:20:28,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34230302] [2024-06-28 01:20:28,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:20:28,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:20:28,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:20:28,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:20:28,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:20:28,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 59 [2024-06-28 01:20:28,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:20:28,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:28,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 59 [2024-06-28 01:20:28,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:30,818 INFO L124 PetriNetUnfolderBase]: 21344/31845 cut-off events. [2024-06-28 01:20:30,818 INFO L125 PetriNetUnfolderBase]: For 7677/7677 co-relation queries the response was YES. [2024-06-28 01:20:30,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68085 conditions, 31845 events. 21344/31845 cut-off events. For 7677/7677 co-relation queries the response was YES. Maximal size of possible extension queue 1170. Compared 223233 event pairs, 14966 based on Foata normal form. 4/30733 useless extension candidates. Maximal degree in co-relation 68072. Up to 28342 conditions per place. [2024-06-28 01:20:30,985 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 64 selfloop transitions, 10 changer transitions 2/91 dead transitions. [2024-06-28 01:20:30,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 91 transitions, 402 flow [2024-06-28 01:20:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:20:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:20:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2024-06-28 01:20:30,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6440677966101694 [2024-06-28 01:20:30,987 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 154 flow. Second operand 4 states and 152 transitions. [2024-06-28 01:20:30,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 91 transitions, 402 flow [2024-06-28 01:20:30,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 91 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:20:30,989 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 235 flow [2024-06-28 01:20:30,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2024-06-28 01:20:30,990 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 2 predicate places. [2024-06-28 01:20:30,990 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 235 flow [2024-06-28 01:20:30,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:20:30,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:20:30,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:20:30,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:20:30,991 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:20:30,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:20:30,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1680728601, now seen corresponding path program 1 times [2024-06-28 01:20:30,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:20:30,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043242752] [2024-06-28 01:20:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:20:30,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:20:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:20:31,992 INFO 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:20:31,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:20:31,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043242752] [2024-06-28 01:20:31,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043242752] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:20:31,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:20:31,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:20:31,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581135896] [2024-06-28 01:20:31,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:20:31,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:20:31,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:20:31,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:20:31,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:20:32,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:20:32,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:20:32,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:32,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:20:32,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:34,318 INFO L124 PetriNetUnfolderBase]: 22315/31263 cut-off events. [2024-06-28 01:20:34,319 INFO L125 PetriNetUnfolderBase]: For 14969/14969 co-relation queries the response was YES. [2024-06-28 01:20:34,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75062 conditions, 31263 events. 22315/31263 cut-off events. For 14969/14969 co-relation queries the response was YES. Maximal size of possible extension queue 1205. Compared 199216 event pairs, 12148 based on Foata normal form. 4/30820 useless extension candidates. Maximal degree in co-relation 75047. Up to 29571 conditions per place. [2024-06-28 01:20:34,496 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 89 selfloop transitions, 28 changer transitions 0/131 dead transitions. [2024-06-28 01:20:34,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 131 transitions, 684 flow [2024-06-28 01:20:34,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:20:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:20:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions. [2024-06-28 01:20:34,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.615819209039548 [2024-06-28 01:20:34,504 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 235 flow. Second operand 6 states and 218 transitions. [2024-06-28 01:20:34,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 131 transitions, 684 flow [2024-06-28 01:20:34,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 131 transitions, 660 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-28 01:20:34,512 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 394 flow [2024-06-28 01:20:34,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2024-06-28 01:20:34,514 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 8 predicate places. [2024-06-28 01:20:34,514 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 394 flow [2024-06-28 01:20:34,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:20:34,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:20:34,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:20:34,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:20:34,515 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:20:34,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:20:34,515 INFO L85 PathProgramCache]: Analyzing trace with hash -292920164, now seen corresponding path program 1 times [2024-06-28 01:20:34,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:20:34,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504841684] [2024-06-28 01:20:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:20:34,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:20:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:20:35,498 INFO 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:20:35,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:20:35,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504841684] [2024-06-28 01:20:35,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504841684] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:20:35,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:20:35,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:20:35,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592737040] [2024-06-28 01:20:35,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:20:35,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:20:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:20:35,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:20:35,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:20:35,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:20:35,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 394 flow. Second operand has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:20:35,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:35,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:20:35,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:38,182 INFO L124 PetriNetUnfolderBase]: 22299/31259 cut-off events. [2024-06-28 01:20:38,182 INFO L125 PetriNetUnfolderBase]: For 31701/31701 co-relation queries the response was YES. [2024-06-28 01:20:38,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83687 conditions, 31259 events. 22299/31259 cut-off events. For 31701/31701 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 199488 event pairs, 10494 based on Foata normal form. 8/30816 useless extension candidates. Maximal degree in co-relation 83668. Up to 29493 conditions per place. [2024-06-28 01:20:38,353 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 99 selfloop transitions, 31 changer transitions 0/144 dead transitions. [2024-06-28 01:20:38,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 144 transitions, 830 flow [2024-06-28 01:20:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:20:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:20:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 249 transitions. [2024-06-28 01:20:38,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6029055690072639 [2024-06-28 01:20:38,354 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 394 flow. Second operand 7 states and 249 transitions. [2024-06-28 01:20:38,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 144 transitions, 830 flow [2024-06-28 01:20:38,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 144 transitions, 797 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-06-28 01:20:38,365 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 455 flow [2024-06-28 01:20:38,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=455, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2024-06-28 01:20:38,365 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 13 predicate places. [2024-06-28 01:20:38,366 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 455 flow [2024-06-28 01:20:38,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:20:38,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:20:38,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:20:38,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:20:38,367 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:20:38,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:20:38,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1672449005, now seen corresponding path program 1 times [2024-06-28 01:20:38,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:20:38,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482680301] [2024-06-28 01:20:38,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:20:38,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:20:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:20:39,037 INFO 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:20:39,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:20:39,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482680301] [2024-06-28 01:20:39,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482680301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:20:39,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:20:39,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:20:39,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985470615] [2024-06-28 01:20:39,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:20:39,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:20:39,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:20:39,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:20:39,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:20:39,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:20:39,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:20:39,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:39,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:20:39,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:42,353 INFO L124 PetriNetUnfolderBase]: 25854/38846 cut-off events. [2024-06-28 01:20:42,353 INFO L125 PetriNetUnfolderBase]: For 54522/54522 co-relation queries the response was YES. [2024-06-28 01:20:42,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104145 conditions, 38846 events. 25854/38846 cut-off events. For 54522/54522 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 280524 event pairs, 14622 based on Foata normal form. 3/37685 useless extension candidates. Maximal degree in co-relation 104123. Up to 34242 conditions per place. [2024-06-28 01:20:42,616 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 84 selfloop transitions, 14 changer transitions 0/110 dead transitions. [2024-06-28 01:20:42,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 110 transitions, 737 flow [2024-06-28 01:20:42,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:20:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:20:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-06-28 01:20:42,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5254237288135594 [2024-06-28 01:20:42,618 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 455 flow. Second operand 5 states and 155 transitions. [2024-06-28 01:20:42,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 110 transitions, 737 flow [2024-06-28 01:20:42,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 110 transitions, 661 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-28 01:20:42,632 INFO L231 Difference]: Finished difference. Result has 80 places, 86 transitions, 453 flow [2024-06-28 01:20:42,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=453, PETRI_PLACES=80, PETRI_TRANSITIONS=86} [2024-06-28 01:20:42,633 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 13 predicate places. [2024-06-28 01:20:42,633 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 453 flow [2024-06-28 01:20:42,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:20:42,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:20:42,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:20:42,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:20:42,634 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:20:42,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:20:42,634 INFO L85 PathProgramCache]: Analyzing trace with hash -281285582, now seen corresponding path program 1 times [2024-06-28 01:20:42,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:20:42,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294992145] [2024-06-28 01:20:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:20:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:20:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:20:43,455 INFO 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:20:43,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:20:43,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294992145] [2024-06-28 01:20:43,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294992145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:20:43,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:20:43,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:20:43,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315825571] [2024-06-28 01:20:43,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:20:43,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:20:43,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:20:43,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:20:43,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:20:43,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 01:20:43,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 86 transitions, 453 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:20:43,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:43,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 01:20:43,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:48,091 INFO L124 PetriNetUnfolderBase]: 31370/46744 cut-off events. [2024-06-28 01:20:48,091 INFO L125 PetriNetUnfolderBase]: For 84950/84950 co-relation queries the response was YES. [2024-06-28 01:20:48,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131688 conditions, 46744 events. 31370/46744 cut-off events. For 84950/84950 co-relation queries the response was YES. Maximal size of possible extension queue 1579. Compared 336181 event pairs, 17090 based on Foata normal form. 10/45662 useless extension candidates. Maximal degree in co-relation 131664. Up to 41248 conditions per place. [2024-06-28 01:20:48,338 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 106 selfloop transitions, 25 changer transitions 0/142 dead transitions. [2024-06-28 01:20:48,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 142 transitions, 949 flow [2024-06-28 01:20:48,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:20:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:20:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2024-06-28 01:20:48,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53954802259887 [2024-06-28 01:20:48,340 INFO L175 Difference]: Start difference. First operand has 80 places, 86 transitions, 453 flow. Second operand 6 states and 191 transitions. [2024-06-28 01:20:48,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 142 transitions, 949 flow [2024-06-28 01:20:48,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 142 transitions, 909 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-28 01:20:48,355 INFO L231 Difference]: Finished difference. Result has 85 places, 100 transitions, 603 flow [2024-06-28 01:20:48,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=603, PETRI_PLACES=85, PETRI_TRANSITIONS=100} [2024-06-28 01:20:48,356 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 18 predicate places. [2024-06-28 01:20:48,356 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 100 transitions, 603 flow [2024-06-28 01:20:48,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:20:48,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:20:48,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:20:48,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:20:48,357 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:20:48,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:20:48,357 INFO L85 PathProgramCache]: Analyzing trace with hash -905919595, now seen corresponding path program 1 times [2024-06-28 01:20:48,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:20:48,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736976641] [2024-06-28 01:20:48,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:20:48,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:20:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:20:49,255 INFO 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:20:49,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:20:49,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736976641] [2024-06-28 01:20:49,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736976641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:20:49,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:20:49,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:20:49,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731070384] [2024-06-28 01:20:49,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:20:49,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:20:49,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:20:49,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:20:49,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:20:49,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:20:49,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 100 transitions, 603 flow. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:20:49,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:49,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:20:49,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:53,738 INFO L124 PetriNetUnfolderBase]: 31543/46779 cut-off events. [2024-06-28 01:20:53,739 INFO L125 PetriNetUnfolderBase]: For 133176/133198 co-relation queries the response was YES. [2024-06-28 01:20:53,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145275 conditions, 46779 events. 31543/46779 cut-off events. For 133176/133198 co-relation queries the response was YES. Maximal size of possible extension queue 1723. Compared 338214 event pairs, 20759 based on Foata normal form. 11/44983 useless extension candidates. Maximal degree in co-relation 145248. Up to 41383 conditions per place. [2024-06-28 01:20:54,046 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 116 selfloop transitions, 25 changer transitions 0/156 dead transitions. [2024-06-28 01:20:54,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 156 transitions, 1163 flow [2024-06-28 01:20:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:20:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:20:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 208 transitions. [2024-06-28 01:20:54,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036319612590799 [2024-06-28 01:20:54,050 INFO L175 Difference]: Start difference. First operand has 85 places, 100 transitions, 603 flow. Second operand 7 states and 208 transitions. [2024-06-28 01:20:54,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 156 transitions, 1163 flow [2024-06-28 01:20:54,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 156 transitions, 1135 flow, removed 13 selfloop flow, removed 1 redundant places. [2024-06-28 01:20:54,116 INFO L231 Difference]: Finished difference. Result has 94 places, 119 transitions, 835 flow [2024-06-28 01:20:54,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=835, PETRI_PLACES=94, PETRI_TRANSITIONS=119} [2024-06-28 01:20:54,116 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 27 predicate places. [2024-06-28 01:20:54,117 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 119 transitions, 835 flow [2024-06-28 01:20:54,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:20:54,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:20:54,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:20:54,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:20:54,117 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:20:54,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:20:54,118 INFO L85 PathProgramCache]: Analyzing trace with hash 505140087, now seen corresponding path program 2 times [2024-06-28 01:20:54,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:20:54,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126648277] [2024-06-28 01:20:54,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:20:54,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:20:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:20:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:20:54,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:20:54,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126648277] [2024-06-28 01:20:54,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126648277] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:20:54,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:20:54,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:20:54,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795931174] [2024-06-28 01:20:54,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:20:54,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:20:54,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:20:54,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:20:54,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:20:54,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:20:54,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 119 transitions, 835 flow. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:20:54,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:54,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:20:54,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:59,643 INFO L124 PetriNetUnfolderBase]: 31173/46359 cut-off events. [2024-06-28 01:20:59,643 INFO L125 PetriNetUnfolderBase]: For 170438/170464 co-relation queries the response was YES. [2024-06-28 01:20:59,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153572 conditions, 46359 events. 31173/46359 cut-off events. For 170438/170464 co-relation queries the response was YES. Maximal size of possible extension queue 1707. Compared 335859 event pairs, 19700 based on Foata normal form. 15/44619 useless extension candidates. Maximal degree in co-relation 153539. Up to 40891 conditions per place. [2024-06-28 01:20:59,985 INFO L140 encePairwiseOnDemand]: 43/59 looper letters, 137 selfloop transitions, 53 changer transitions 0/205 dead transitions. [2024-06-28 01:20:59,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 205 transitions, 1817 flow [2024-06-28 01:20:59,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:20:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:20:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2024-06-28 01:20:59,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.549636803874092 [2024-06-28 01:20:59,989 INFO L175 Difference]: Start difference. First operand has 94 places, 119 transitions, 835 flow. Second operand 7 states and 227 transitions. [2024-06-28 01:20:59,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 205 transitions, 1817 flow [2024-06-28 01:21:00,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 205 transitions, 1683 flow, removed 66 selfloop flow, removed 1 redundant places. [2024-06-28 01:21:00,168 INFO L231 Difference]: Finished difference. Result has 102 places, 157 transitions, 1304 flow [2024-06-28 01:21:00,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1304, PETRI_PLACES=102, PETRI_TRANSITIONS=157} [2024-06-28 01:21:00,168 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 35 predicate places. [2024-06-28 01:21:00,169 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 157 transitions, 1304 flow [2024-06-28 01:21:00,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:21:00,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:21:00,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:21:00,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:21:00,169 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:21:00,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:21:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash -103402135, now seen corresponding path program 3 times [2024-06-28 01:21:00,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:21:00,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220986822] [2024-06-28 01:21:00,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:21:00,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:21:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:21:00,945 INFO 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:21:00,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:21:00,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220986822] [2024-06-28 01:21:00,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220986822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:21:00,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:21:00,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:21:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223599496] [2024-06-28 01:21:00,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:21:00,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:21:00,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:21:00,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:21:00,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:21:01,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:21:01,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 157 transitions, 1304 flow. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:21:01,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:21:01,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:21:01,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand