./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.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/mix005_tso.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/mix005_tso.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix005_tso.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:19:46,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:19:46,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:19:46,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:19:46,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:19:46,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:19:46,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:19:46,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:19:46,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:19:46,612 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:19:46,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:19:46,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:19:46,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:19:46,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:19:46,614 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:19:46,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:19:46,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:19:46,615 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:19:46,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:19:46,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:19:46,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:19:46,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:19:46,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:19:46,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:19:46,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:19:46,616 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:19:46,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:19:46,617 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:19:46,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:19:46,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:19:46,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:19:46,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:19:46,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:19:46,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:19:46,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:19:46,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:19:46,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:19:46,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:19:46,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:19:46,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:19:46,620 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:19:46,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:19:46,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:19:46,621 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:19:46,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:19:46,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:19:46,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:19:46,864 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:19:46,865 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:19:46,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2024-06-28 01:19:47,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:19:48,144 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:19:48,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2024-06-28 01:19:48,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c72e27e62/b9b165b49c7744029ce2a7ffd672992d/FLAG464165655 [2024-06-28 01:19:48,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c72e27e62/b9b165b49c7744029ce2a7ffd672992d [2024-06-28 01:19:48,176 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:19:48,176 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:19:48,178 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/mix005_tso.oepc.yml/witness.yml [2024-06-28 01:19:48,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:19:48,382 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:19:48,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:19:48,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:19:48,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:19:48,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:19:48" (1/2) ... [2024-06-28 01:19:48,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64dcbe17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:19:48, skipping insertion in model container [2024-06-28 01:19:48,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:19:48" (1/2) ... [2024-06-28 01:19:48,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@33ac2a61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:19:48, skipping insertion in model container [2024-06-28 01:19:48,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:19:48" (2/2) ... [2024-06-28 01:19:48,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64dcbe17 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:19:48, skipping insertion in model container [2024-06-28 01:19:48,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:19:48" (2/2) ... [2024-06-28 01:19:48,392 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:19:48,484 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:19:48,485 INFO L97 edCorrectnessWitness]: Location invariant before [L861-L861] (((((((((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_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)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0) [2024-06-28 01:19:48,485 INFO L97 edCorrectnessWitness]: Location invariant before [L863-L863] (((((((((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_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)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0) [2024-06-28 01:19:48,486 INFO L97 edCorrectnessWitness]: Location invariant before [L866-L866] (((((((((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_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)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0) [2024-06-28 01:19:48,486 INFO L97 edCorrectnessWitness]: Location invariant before [L865-L865] (((((((((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_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)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0) [2024-06-28 01:19:48,486 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:19:48,487 INFO L106 edCorrectnessWitness]: ghost_update [L859-L859] multithreaded = 1; [2024-06-28 01:19:48,523 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:19:48,646 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/mix005_tso.oepc.i[949,962] [2024-06-28 01:19:48,814 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:19:48,827 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:19:48,854 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/mix005_tso.oepc.i[949,962] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:19:48,928 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:19:48,953 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:19:48,955 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:19:48 WrapperNode [2024-06-28 01:19:48,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:19:48,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:19:48,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:19:48,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:19:48,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:19:48" (1/1) ... [2024-06-28 01:19:48,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:19:48" (1/1) ... [2024-06-28 01:19:49,025 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 155 [2024-06-28 01:19:49,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:19:49,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:19:49,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:19:49,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:19:49,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:19:48" (1/1) ... [2024-06-28 01:19:49,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:19:48" (1/1) ... [2024-06-28 01:19:49,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:19:48" (1/1) ... [2024-06-28 01:19:49,069 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:19:49,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:19:48" (1/1) ... [2024-06-28 01:19:49,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:19:48" (1/1) ... [2024-06-28 01:19:49,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:19:48" (1/1) ... [2024-06-28 01:19:49,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:19:48" (1/1) ... [2024-06-28 01:19:49,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:19:48" (1/1) ... [2024-06-28 01:19:49,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:19:48" (1/1) ... [2024-06-28 01:19:49,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:19:49,113 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:19:49,113 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:19:49,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:19:49,114 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:19:48" (1/1) ... [2024-06-28 01:19:49,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:19:49,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:19:49,152 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:19:49,154 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:19:49,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:19:49,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:19:49,182 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:19:49,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:19:49,182 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:19:49,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:19:49,182 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 01:19:49,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 01:19:49,183 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 01:19:49,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 01:19:49,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:19:49,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:19:49,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:19:49,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:19:49,184 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:19:49,281 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:19:49,282 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:19:49,666 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:19:49,666 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:19:49,802 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:19:49,802 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:19:49,802 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:19:49 BoogieIcfgContainer [2024-06-28 01:19:49,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:19:49,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:19:49,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:19:49,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:19:49,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:19:48" (1/4) ... [2024-06-28 01:19:49,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13774a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:19:49, skipping insertion in model container [2024-06-28 01:19:49,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:19:48" (2/4) ... [2024-06-28 01:19:49,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13774a28 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:19:49, skipping insertion in model container [2024-06-28 01:19:49,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:19:48" (3/4) ... [2024-06-28 01:19:49,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13774a28 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:19:49, skipping insertion in model container [2024-06-28 01:19:49,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:19:49" (4/4) ... [2024-06-28 01:19:49,812 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2024-06-28 01:19:49,825 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:19:49,825 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-28 01:19:49,825 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:19:49,875 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:19:49,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:19:49,963 INFO L124 PetriNetUnfolderBase]: 1/55 cut-off events. [2024-06-28 01:19:49,964 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:19:49,967 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 5. Compared 98 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:19:49,967 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:19:49,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 55 transitions, 122 flow [2024-06-28 01:19:49,982 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:19:49,996 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;@6ee031cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:19:49,996 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-28 01:19:49,999 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:19:50,000 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:19:50,000 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:19:50,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:19:50,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:19:50,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:19:50,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:19:50,005 INFO L85 PathProgramCache]: Analyzing trace with hash 388842680, now seen corresponding path program 1 times [2024-06-28 01:19:50,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:19:50,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272414945] [2024-06-28 01:19:50,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:19:50,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:19:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:19:51,010 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:19:51,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:19:51,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272414945] [2024-06-28 01:19:51,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272414945] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:19:51,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:19:51,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:19:51,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349506974] [2024-06-28 01:19:51,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:19:51,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:19:51,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:19:51,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:19:51,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:19:51,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 59 [2024-06-28 01:19:51,108 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:19:51,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:19:51,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 59 [2024-06-28 01:19:51,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:19:54,298 INFO L124 PetriNetUnfolderBase]: 24644/36460 cut-off events. [2024-06-28 01:19:54,298 INFO L125 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2024-06-28 01:19:54,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69641 conditions, 36460 events. 24644/36460 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 1394. Compared 259846 event pairs, 21287 based on Foata normal form. 901/34454 useless extension candidates. Maximal degree in co-relation 69628. Up to 32713 conditions per place. [2024-06-28 01:19:54,541 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 53 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2024-06-28 01:19:54,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 74 transitions, 287 flow [2024-06-28 01:19:54,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:19:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:19:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-06-28 01:19:54,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6892655367231638 [2024-06-28 01:19:54,553 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 122 transitions. [2024-06-28 01:19:54,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 74 transitions, 287 flow [2024-06-28 01:19:54,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 280 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 01:19:54,561 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 162 flow [2024-06-28 01:19:54,563 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:19:54,566 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2024-06-28 01:19:54,566 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 162 flow [2024-06-28 01:19:54,566 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:19:54,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:19:54,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:19:54,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:19:54,568 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:19:54,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:19:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash 16040703, now seen corresponding path program 1 times [2024-06-28 01:19:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:19:54,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881872819] [2024-06-28 01:19:54,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:19:54,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:19:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:19:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:19:55,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:19:55,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881872819] [2024-06-28 01:19:55,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881872819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:19:55,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:19:55,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:19:55,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417790734] [2024-06-28 01:19:55,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:19:55,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:19:55,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:19:55,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:19:55,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:19:55,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:19:55,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:19:55,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:19:55,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:19:55,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:19:58,626 INFO L124 PetriNetUnfolderBase]: 29443/42783 cut-off events. [2024-06-28 01:19:58,627 INFO L125 PetriNetUnfolderBase]: For 6692/6692 co-relation queries the response was YES. [2024-06-28 01:19:58,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91597 conditions, 42783 events. 29443/42783 cut-off events. For 6692/6692 co-relation queries the response was YES. Maximal size of possible extension queue 1590. Compared 297942 event pairs, 23449 based on Foata normal form. 4/40032 useless extension candidates. Maximal degree in co-relation 91585. Up to 38917 conditions per place. [2024-06-28 01:19:58,970 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 69 selfloop transitions, 11 changer transitions 0/94 dead transitions. [2024-06-28 01:19:58,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 94 transitions, 412 flow [2024-06-28 01:19:58,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:19:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:19:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2024-06-28 01:19:58,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6610169491525424 [2024-06-28 01:19:58,978 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 162 flow. Second operand 4 states and 156 transitions. [2024-06-28 01:19:58,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 94 transitions, 412 flow [2024-06-28 01:19:58,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 94 transitions, 406 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:19:58,981 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 220 flow [2024-06-28 01:19:58,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-06-28 01:19:58,982 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 2 predicate places. [2024-06-28 01:19:58,984 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 220 flow [2024-06-28 01:19:58,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:19:58,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:19:58,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:19:58,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:19:58,990 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:19:58,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:19:58,992 INFO L85 PathProgramCache]: Analyzing trace with hash 497262917, now seen corresponding path program 1 times [2024-06-28 01:19:58,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:19:58,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137264614] [2024-06-28 01:19:58,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:19:58,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:19:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:19:59,675 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:19:59,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:19:59,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137264614] [2024-06-28 01:19:59,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137264614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:19:59,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:19:59,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:19:59,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880396081] [2024-06-28 01:19:59,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:19:59,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:19:59,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:19:59,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:19:59,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:19:59,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:19:59,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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:19:59,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:19:59,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:19:59,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:02,977 INFO L124 PetriNetUnfolderBase]: 29417/42742 cut-off events. [2024-06-28 01:20:02,977 INFO L125 PetriNetUnfolderBase]: For 18720/18720 co-relation queries the response was YES. [2024-06-28 01:20:03,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100828 conditions, 42742 events. 29417/42742 cut-off events. For 18720/18720 co-relation queries the response was YES. Maximal size of possible extension queue 1588. Compared 298059 event pairs, 19159 based on Foata normal form. 8/39990 useless extension candidates. Maximal degree in co-relation 100814. Up to 38842 conditions per place. [2024-06-28 01:20:03,216 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 86 selfloop transitions, 19 changer transitions 0/119 dead transitions. [2024-06-28 01:20:03,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 119 transitions, 618 flow [2024-06-28 01:20:03,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:20:03,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:20:03,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2024-06-28 01:20:03,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6406779661016949 [2024-06-28 01:20:03,218 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 220 flow. Second operand 5 states and 189 transitions. [2024-06-28 01:20:03,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 119 transitions, 618 flow [2024-06-28 01:20:03,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 119 transitions, 572 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-28 01:20:03,225 INFO L231 Difference]: Finished difference. Result has 74 places, 82 transitions, 369 flow [2024-06-28 01:20:03,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=74, PETRI_TRANSITIONS=82} [2024-06-28 01:20:03,227 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 7 predicate places. [2024-06-28 01:20:03,227 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 369 flow [2024-06-28 01:20:03,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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:03,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:20:03,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:20:03,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:20:03,228 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:20:03,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:20:03,228 INFO L85 PathProgramCache]: Analyzing trace with hash 485944412, now seen corresponding path program 1 times [2024-06-28 01:20:03,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:20:03,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306885517] [2024-06-28 01:20:03,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:20:03,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:20:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:20:03,313 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:03,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:20:03,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306885517] [2024-06-28 01:20:03,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306885517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:20:03,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:20:03,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:20:03,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376598105] [2024-06-28 01:20:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:20:03,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:20:03,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:20:03,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:20:03,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:20:03,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 59 [2024-06-28 01:20:03,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:03,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:03,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 59 [2024-06-28 01:20:03,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:04,472 INFO L124 PetriNetUnfolderBase]: 6850/12123 cut-off events. [2024-06-28 01:20:04,472 INFO L125 PetriNetUnfolderBase]: For 5390/6542 co-relation queries the response was YES. [2024-06-28 01:20:04,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26609 conditions, 12123 events. 6850/12123 cut-off events. For 5390/6542 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 103102 event pairs, 3152 based on Foata normal form. 30/11055 useless extension candidates. Maximal degree in co-relation 26592. Up to 7830 conditions per place. [2024-06-28 01:20:04,546 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 45 selfloop transitions, 7 changer transitions 0/94 dead transitions. [2024-06-28 01:20:04,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 94 transitions, 472 flow [2024-06-28 01:20:04,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:20:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:20:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-06-28 01:20:04,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7796610169491526 [2024-06-28 01:20:04,548 INFO L175 Difference]: Start difference. First operand has 74 places, 82 transitions, 369 flow. Second operand 3 states and 138 transitions. [2024-06-28 01:20:04,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 94 transitions, 472 flow [2024-06-28 01:20:04,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 94 transitions, 460 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-28 01:20:04,552 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 328 flow [2024-06-28 01:20:04,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2024-06-28 01:20:04,552 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 8 predicate places. [2024-06-28 01:20:04,552 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 328 flow [2024-06-28 01:20:04,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:04,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:20:04,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:20:04,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:20:04,553 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:20:04,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:20:04,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1501448232, now seen corresponding path program 1 times [2024-06-28 01:20:04,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:20:04,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369844725] [2024-06-28 01:20:04,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:20:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:20:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:20:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:20:05,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:20:05,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369844725] [2024-06-28 01:20:05,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369844725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:20:05,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:20:05,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:20:05,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022382358] [2024-06-28 01:20:05,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:20:05,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:20:05,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:20:05,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:20:05,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:20:05,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:20:05,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 328 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:05,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:05,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:20:05,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:08,563 INFO L124 PetriNetUnfolderBase]: 24241/35617 cut-off events. [2024-06-28 01:20:08,563 INFO L125 PetriNetUnfolderBase]: For 36910/36910 co-relation queries the response was YES. [2024-06-28 01:20:08,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90732 conditions, 35617 events. 24241/35617 cut-off events. For 36910/36910 co-relation queries the response was YES. Maximal size of possible extension queue 1316. Compared 248252 event pairs, 12666 based on Foata normal form. 8/34582 useless extension candidates. Maximal degree in co-relation 90713. Up to 32024 conditions per place. [2024-06-28 01:20:08,717 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 91 selfloop transitions, 20 changer transitions 1/126 dead transitions. [2024-06-28 01:20:08,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 126 transitions, 690 flow [2024-06-28 01:20:08,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:20:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:20:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2024-06-28 01:20:08,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6101694915254238 [2024-06-28 01:20:08,719 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 328 flow. Second operand 6 states and 216 transitions. [2024-06-28 01:20:08,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 126 transitions, 690 flow [2024-06-28 01:20:08,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 126 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:20:08,728 INFO L231 Difference]: Finished difference. Result has 78 places, 78 transitions, 391 flow [2024-06-28 01:20:08,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=391, PETRI_PLACES=78, PETRI_TRANSITIONS=78} [2024-06-28 01:20:08,730 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 11 predicate places. [2024-06-28 01:20:08,730 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 78 transitions, 391 flow [2024-06-28 01:20:08,731 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:08,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:20:08,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:20:08,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:20:08,731 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:20:08,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:20:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1159558200, now seen corresponding path program 1 times [2024-06-28 01:20:08,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:20:08,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943132593] [2024-06-28 01:20:08,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:20:08,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:20:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:20:09,448 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:09,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:20:09,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943132593] [2024-06-28 01:20:09,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943132593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:20:09,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:20:09,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:20:09,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326698729] [2024-06-28 01:20:09,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:20:09,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:20:09,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:20:09,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:20:09,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:20:09,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:20:09,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 78 transitions, 391 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:09,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:09,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:20:09,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:12,399 INFO L124 PetriNetUnfolderBase]: 20273/30484 cut-off events. [2024-06-28 01:20:12,400 INFO L125 PetriNetUnfolderBase]: For 40963/40963 co-relation queries the response was YES. [2024-06-28 01:20:12,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81802 conditions, 30484 events. 20273/30484 cut-off events. For 40963/40963 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 214693 event pairs, 12394 based on Foata normal form. 3/29358 useless extension candidates. Maximal degree in co-relation 81781. Up to 26959 conditions per place. [2024-06-28 01:20:12,588 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 87 selfloop transitions, 11 changer transitions 0/111 dead transitions. [2024-06-28 01:20:12,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 111 transitions, 716 flow [2024-06-28 01:20:12,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:20:12,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:20:12,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2024-06-28 01:20:12,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5389830508474577 [2024-06-28 01:20:12,589 INFO L175 Difference]: Start difference. First operand has 78 places, 78 transitions, 391 flow. Second operand 5 states and 159 transitions. [2024-06-28 01:20:12,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 111 transitions, 716 flow [2024-06-28 01:20:12,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 111 transitions, 653 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 01:20:12,601 INFO L231 Difference]: Finished difference. Result has 79 places, 87 transitions, 452 flow [2024-06-28 01:20:12,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=452, PETRI_PLACES=79, PETRI_TRANSITIONS=87} [2024-06-28 01:20:12,602 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 12 predicate places. [2024-06-28 01:20:12,602 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 87 transitions, 452 flow [2024-06-28 01:20:12,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:12,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:20:12,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:20:12,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:20:12,603 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:20:12,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:20:12,603 INFO L85 PathProgramCache]: Analyzing trace with hash 545206605, now seen corresponding path program 1 times [2024-06-28 01:20:12,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:20:12,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536740388] [2024-06-28 01:20:12,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:20:12,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:20:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:20:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:20:13,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:20:13,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536740388] [2024-06-28 01:20:13,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536740388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:20:13,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:20:13,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:20:13,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580090404] [2024-06-28 01:20:13,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:20:13,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:20:13,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:20:13,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:20:13,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:20:13,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:20:13,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 87 transitions, 452 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:13,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:13,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:20:13,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:17,190 INFO L124 PetriNetUnfolderBase]: 24285/35748 cut-off events. [2024-06-28 01:20:17,190 INFO L125 PetriNetUnfolderBase]: For 67888/67888 co-relation queries the response was YES. [2024-06-28 01:20:17,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103130 conditions, 35748 events. 24285/35748 cut-off events. For 67888/67888 co-relation queries the response was YES. Maximal size of possible extension queue 1303. Compared 247725 event pairs, 14753 based on Foata normal form. 3/34772 useless extension candidates. Maximal degree in co-relation 103106. Up to 32159 conditions per place. [2024-06-28 01:20:17,393 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 104 selfloop transitions, 16 changer transitions 0/132 dead transitions. [2024-06-28 01:20:17,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 132 transitions, 851 flow [2024-06-28 01:20:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:20:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:20:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2024-06-28 01:20:17,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5310734463276836 [2024-06-28 01:20:17,395 INFO L175 Difference]: Start difference. First operand has 79 places, 87 transitions, 452 flow. Second operand 6 states and 188 transitions. [2024-06-28 01:20:17,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 132 transitions, 851 flow [2024-06-28 01:20:17,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 132 transitions, 826 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-28 01:20:17,407 INFO L231 Difference]: Finished difference. Result has 84 places, 96 transitions, 559 flow [2024-06-28 01:20:17,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=559, PETRI_PLACES=84, PETRI_TRANSITIONS=96} [2024-06-28 01:20:17,408 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 17 predicate places. [2024-06-28 01:20:17,408 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 96 transitions, 559 flow [2024-06-28 01:20:17,408 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:17,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:20:17,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:20:17,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:20:17,409 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:20:17,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:20:17,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1938854041, now seen corresponding path program 2 times [2024-06-28 01:20:17,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:20:17,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388224740] [2024-06-28 01:20:17,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:20:17,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:20:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:20:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:20:18,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:20:18,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388224740] [2024-06-28 01:20:18,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388224740] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:20:18,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:20:18,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:20:18,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942410842] [2024-06-28 01:20:18,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:20:18,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:20:18,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:20:18,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:20:18,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:20:18,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:20:18,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 96 transitions, 559 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:18,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:18,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:20:18,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:21,782 INFO L124 PetriNetUnfolderBase]: 24287/35774 cut-off events. [2024-06-28 01:20:21,783 INFO L125 PetriNetUnfolderBase]: For 93029/93065 co-relation queries the response was YES. [2024-06-28 01:20:22,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110701 conditions, 35774 events. 24287/35774 cut-off events. For 93029/93065 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 247792 event pairs, 14224 based on Foata normal form. 27/34860 useless extension candidates. Maximal degree in co-relation 110674. Up to 32114 conditions per place. [2024-06-28 01:20:22,207 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 101 selfloop transitions, 23 changer transitions 0/136 dead transitions. [2024-06-28 01:20:22,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 136 transitions, 949 flow [2024-06-28 01:20:22,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:20:22,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:20:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-06-28 01:20:22,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5338983050847458 [2024-06-28 01:20:22,209 INFO L175 Difference]: Start difference. First operand has 84 places, 96 transitions, 559 flow. Second operand 6 states and 189 transitions. [2024-06-28 01:20:22,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 136 transitions, 949 flow [2024-06-28 01:20:22,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 136 transitions, 906 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-28 01:20:22,227 INFO L231 Difference]: Finished difference. Result has 87 places, 100 transitions, 621 flow [2024-06-28 01:20:22,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=621, PETRI_PLACES=87, PETRI_TRANSITIONS=100} [2024-06-28 01:20:22,228 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 20 predicate places. [2024-06-28 01:20:22,228 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 100 transitions, 621 flow [2024-06-28 01:20:22,228 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:22,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:20:22,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:20:22,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:20:22,229 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:20:22,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:20:22,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1938845113, now seen corresponding path program 1 times [2024-06-28 01:20:22,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:20:22,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951016721] [2024-06-28 01:20:22,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:20:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:20:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:20:23,395 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,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:20:23,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951016721] [2024-06-28 01:20:23,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951016721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:20:23,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:20:23,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:20:23,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187163211] [2024-06-28 01:20:23,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:20:23,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:20:23,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:20:23,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:20:23,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:20:23,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:20:23,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 100 transitions, 621 flow. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:23,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:20:23,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:27,021 INFO L124 PetriNetUnfolderBase]: 24684/36601 cut-off events. [2024-06-28 01:20:27,022 INFO L125 PetriNetUnfolderBase]: For 129398/129398 co-relation queries the response was YES. [2024-06-28 01:20:27,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119296 conditions, 36601 events. 24684/36601 cut-off events. For 129398/129398 co-relation queries the response was YES. Maximal size of possible extension queue 1377. Compared 258434 event pairs, 17370 based on Foata normal form. 3/35239 useless extension candidates. Maximal degree in co-relation 119268. Up to 32693 conditions per place. [2024-06-28 01:20:27,325 INFO L140 encePairwiseOnDemand]: 45/59 looper letters, 118 selfloop transitions, 35 changer transitions 0/165 dead transitions. [2024-06-28 01:20:27,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 165 transitions, 1251 flow [2024-06-28 01:20:27,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:20:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:20:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 234 transitions. [2024-06-28 01:20:27,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957627118644068 [2024-06-28 01:20:27,345 INFO L175 Difference]: Start difference. First operand has 87 places, 100 transitions, 621 flow. Second operand 8 states and 234 transitions. [2024-06-28 01:20:27,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 165 transitions, 1251 flow [2024-06-28 01:20:27,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 165 transitions, 1170 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-28 01:20:27,449 INFO L231 Difference]: Finished difference. Result has 94 places, 124 transitions, 882 flow [2024-06-28 01:20:27,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=882, PETRI_PLACES=94, PETRI_TRANSITIONS=124} [2024-06-28 01:20:27,450 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 27 predicate places. [2024-06-28 01:20:27,451 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 124 transitions, 882 flow [2024-06-28 01:20:27,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:20:27,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:20:27,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:20:27,454 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:20:27,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:20:27,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1133522121, now seen corresponding path program 1 times [2024-06-28 01:20:27,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:20:27,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615566199] [2024-06-28 01:20:27,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:20:27,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:20:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:20:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:20:28,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:20:28,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615566199] [2024-06-28 01:20:28,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615566199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:20:28,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:20:28,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:20:28,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192365925] [2024-06-28 01:20:28,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:20:28,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:20:28,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:20:28,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:20:28,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:20:28,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:20:28,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 124 transitions, 882 flow. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:28,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:20:28,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand