./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix039.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/mix039.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/mix039.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix039.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:36:22,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:36:22,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:36:22,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:36:22,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:36:22,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:36:22,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:36:22,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:36:22,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:36:22,860 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:36:22,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:36:22,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:36:22,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:36:22,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:36:22,862 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:36:22,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:36:22,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:36:22,863 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:36:22,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:36:22,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:36:22,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:36:22,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:36:22,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:36:22,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:36:22,864 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:36:22,864 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:36:22,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:36:22,865 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:36:22,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:36:22,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:36:22,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:36:22,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:36:22,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:36:22,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:36:22,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:36:22,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:36:22,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:36:22,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:36:22,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:36:22,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:36:22,867 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:36:22,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:36:22,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:36:22,868 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:36:23,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:36:23,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:36:23,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:36:23,130 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:36:23,131 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:36:23,132 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/mix039.oepc.yml/witness.yml [2024-06-28 01:36:23,333 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:36:23,333 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:36:23,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039.oepc.i [2024-06-28 01:36:24,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:36:24,509 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:36:24,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.oepc.i [2024-06-28 01:36:24,520 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/872023c0f/d4767ba796884968841fbe5cee176529/FLAG358b75dfd [2024-06-28 01:36:24,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/872023c0f/d4767ba796884968841fbe5cee176529 [2024-06-28 01:36:24,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:36:24,532 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:36:24,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:36:24,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:36:24,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:36:24,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:36:23" (1/2) ... [2024-06-28 01:36:24,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb3eacb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:36:24, skipping insertion in model container [2024-06-28 01:36:24,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:36:23" (1/2) ... [2024-06-28 01:36:24,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1850a501 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:36:24, skipping insertion in model container [2024-06-28 01:36:24,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:36:24" (2/2) ... [2024-06-28 01:36:24,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb3eacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:36:24, skipping insertion in model container [2024-06-28 01:36:24,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:36:24" (2/2) ... [2024-06-28 01:36:24,540 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:36:24,638 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:36:24,639 INFO L97 edCorrectnessWitness]: Location invariant before [L879-L879] (((((((((((((((((((((((! multithreaded || ((y == 0 || y == 1) || y == 2)) && (! multithreaded || b$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff0_thd4 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$r_buff1_thd4 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (b$w_buff0 == 0 || b$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || b$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (b$w_buff1 == 0 || b$w_buff1 == 1))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (b$mem_tmp == 0 || b$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (b == 0 || b == 1))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0) [2024-06-28 01:36:24,639 INFO L97 edCorrectnessWitness]: Location invariant before [L874-L874] (((((((((((((((((((((((! multithreaded || ((y == 0 || y == 1) || y == 2)) && (! multithreaded || b$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff0_thd4 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$r_buff1_thd4 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (b$w_buff0 == 0 || b$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || b$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (b$w_buff1 == 0 || b$w_buff1 == 1))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (b$mem_tmp == 0 || b$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (b == 0 || b == 1))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0) [2024-06-28 01:36:24,639 INFO L97 edCorrectnessWitness]: Location invariant before [L878-L878] (((((((((((((((((((((((! multithreaded || ((y == 0 || y == 1) || y == 2)) && (! multithreaded || b$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff0_thd4 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$r_buff1_thd4 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (b$w_buff0 == 0 || b$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || b$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (b$w_buff1 == 0 || b$w_buff1 == 1))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (b$mem_tmp == 0 || b$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (b == 0 || b == 1))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0) [2024-06-28 01:36:24,639 INFO L97 edCorrectnessWitness]: Location invariant before [L876-L876] (((((((((((((((((((((((! multithreaded || ((y == 0 || y == 1) || y == 2)) && (! multithreaded || b$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff0_thd4 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$r_buff1_thd4 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (b$w_buff0 == 0 || b$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || b$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (b$w_buff1 == 0 || b$w_buff1 == 1))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (b$mem_tmp == 0 || b$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (b == 0 || b == 1))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0) [2024-06-28 01:36:24,640 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:36:24,640 INFO L106 edCorrectnessWitness]: ghost_update [L872-L872] multithreaded = 1; [2024-06-28 01:36:24,678 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:36:24,830 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/mix039.oepc.i[945,958] [2024-06-28 01:36:24,971 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:36:24,981 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:36:25,010 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/mix039.oepc.i[945,958] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:36:25,127 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:36:25,182 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:36:25,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:36:25 WrapperNode [2024-06-28 01:36:25,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:36:25,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:36:25,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:36:25,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:36:25,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:36:25" (1/1) ... [2024-06-28 01:36:25,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:36:25" (1/1) ... [2024-06-28 01:36:25,247 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2024-06-28 01:36:25,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:36:25,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:36:25,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:36:25,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:36:25,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:36:25" (1/1) ... [2024-06-28 01:36:25,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:36:25" (1/1) ... [2024-06-28 01:36:25,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:36:25" (1/1) ... [2024-06-28 01:36:25,324 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:36:25,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:36:25" (1/1) ... [2024-06-28 01:36:25,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:36:25" (1/1) ... [2024-06-28 01:36:25,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:36:25" (1/1) ... [2024-06-28 01:36:25,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:36:25" (1/1) ... [2024-06-28 01:36:25,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:36:25" (1/1) ... [2024-06-28 01:36:25,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:36:25" (1/1) ... [2024-06-28 01:36:25,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:36:25,363 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:36:25,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:36:25,364 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:36:25,365 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:36:25" (1/1) ... [2024-06-28 01:36:25,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:36:25,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:36:25,391 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:36:25,412 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:36:25,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:36:25,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:36:25,424 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:36:25,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:36:25,424 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:36:25,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:36:25,425 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 01:36:25,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 01:36:25,425 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 01:36:25,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 01:36:25,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:36:25,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:36:25,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:36:25,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:36:25,428 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:36:25,530 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:36:25,532 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:36:25,895 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:36:25,895 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:36:26,032 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:36:26,032 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:36:26,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:36:26 BoogieIcfgContainer [2024-06-28 01:36:26,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:36:26,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:36:26,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:36:26,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:36:26,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:36:23" (1/4) ... [2024-06-28 01:36:26,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee8094 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:36:26, skipping insertion in model container [2024-06-28 01:36:26,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:36:24" (2/4) ... [2024-06-28 01:36:26,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee8094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:36:26, skipping insertion in model container [2024-06-28 01:36:26,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:36:25" (3/4) ... [2024-06-28 01:36:26,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee8094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:36:26, skipping insertion in model container [2024-06-28 01:36:26,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:36:26" (4/4) ... [2024-06-28 01:36:26,039 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.oepc.i [2024-06-28 01:36:26,052 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:36:26,052 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-28 01:36:26,053 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:36:26,092 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:36:26,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:36:26,183 INFO L124 PetriNetUnfolderBase]: 1/55 cut-off events. [2024-06-28 01:36:26,183 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:36:26,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 1/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2024-06-28 01:36:26,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:36:26,190 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 55 transitions, 122 flow [2024-06-28 01:36:26,202 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:36:26,238 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;@4d83ae54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:36:26,238 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-28 01:36:26,242 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:36:26,242 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:36:26,242 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:36:26,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:36:26,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:36:26,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:36:26,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:36:26,264 INFO L85 PathProgramCache]: Analyzing trace with hash 386818320, now seen corresponding path program 1 times [2024-06-28 01:36:26,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:36:26,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649921076] [2024-06-28 01:36:26,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:36:26,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:36:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:36:27,256 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:36:27,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:36:27,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649921076] [2024-06-28 01:36:27,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649921076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:36:27,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:36:27,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:36:27,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815482939] [2024-06-28 01:36:27,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:36:27,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:36:27,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:36:27,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:36:27,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:36:27,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:36:27,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:27,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:36:27,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:36:27,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:36:31,396 INFO L124 PetriNetUnfolderBase]: 30079/43924 cut-off events. [2024-06-28 01:36:31,397 INFO L125 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2024-06-28 01:36:31,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84160 conditions, 43924 events. 30079/43924 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 1570. Compared 308799 event pairs, 24649 based on Foata normal form. 1081/41852 useless extension candidates. Maximal degree in co-relation 84147. Up to 39769 conditions per place. [2024-06-28 01:36:31,638 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 53 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2024-06-28 01:36:31,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 73 transitions, 285 flow [2024-06-28 01:36:31,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:36:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:36:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-06-28 01:36:31,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2024-06-28 01:36:31,649 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 119 transitions. [2024-06-28 01:36:31,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 73 transitions, 285 flow [2024-06-28 01:36:31,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 278 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 01:36:31,658 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 162 flow [2024-06-28 01:36:31,660 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:36:31,663 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2024-06-28 01:36:31,663 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 162 flow [2024-06-28 01:36:31,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:31,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:36:31,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:36:31,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:36:31,664 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:36:31,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:36:31,664 INFO L85 PathProgramCache]: Analyzing trace with hash 386819209, now seen corresponding path program 1 times [2024-06-28 01:36:31,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:36:31,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393068009] [2024-06-28 01:36:31,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:36:31,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:36:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:36:31,728 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:36:31,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:36:31,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393068009] [2024-06-28 01:36:31,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393068009] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:36:31,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:36:31,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:36:31,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931227222] [2024-06-28 01:36:31,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:36:31,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:36:31,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:36:31,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:36:31,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:36:31,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 59 [2024-06-28 01:36:31,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:31,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:36:31,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 59 [2024-06-28 01:36:31,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:36:32,672 INFO L124 PetriNetUnfolderBase]: 5221/8977 cut-off events. [2024-06-28 01:36:32,673 INFO L125 PetriNetUnfolderBase]: For 688/688 co-relation queries the response was YES. [2024-06-28 01:36:32,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17277 conditions, 8977 events. 5221/8977 cut-off events. For 688/688 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 69968 event pairs, 3410 based on Foata normal form. 0/8255 useless extension candidates. Maximal degree in co-relation 17265. Up to 6080 conditions per place. [2024-06-28 01:36:32,728 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 45 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2024-06-28 01:36:32,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 78 transitions, 297 flow [2024-06-28 01:36:32,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:36:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:36:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2024-06-28 01:36:32,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7966101694915254 [2024-06-28 01:36:32,730 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 162 flow. Second operand 3 states and 141 transitions. [2024-06-28 01:36:32,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 78 transitions, 297 flow [2024-06-28 01:36:32,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:36:32,732 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 154 flow [2024-06-28 01:36:32,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-06-28 01:36:32,733 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2024-06-28 01:36:32,733 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 154 flow [2024-06-28 01:36:32,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:32,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:36:32,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:36:32,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:36:32,734 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:36:32,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:36:32,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1928908936, now seen corresponding path program 1 times [2024-06-28 01:36:32,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:36:32,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219915172] [2024-06-28 01:36:32,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:36:32,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:36:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:36:33,428 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:36:33,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:36:33,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219915172] [2024-06-28 01:36:33,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219915172] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:36:33,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:36:33,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:36:33,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936427198] [2024-06-28 01:36:33,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:36:33,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:36:33,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:36:33,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:36:33,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:36:33,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:36:33,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 154 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:36:33,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:36:33,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:36:33,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:36:36,311 INFO L124 PetriNetUnfolderBase]: 24799/35934 cut-off events. [2024-06-28 01:36:36,311 INFO L125 PetriNetUnfolderBase]: For 8561/8561 co-relation queries the response was YES. [2024-06-28 01:36:36,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77634 conditions, 35934 events. 24799/35934 cut-off events. For 8561/8561 co-relation queries the response was YES. Maximal size of possible extension queue 1276. Compared 242683 event pairs, 17497 based on Foata normal form. 4/34799 useless extension candidates. Maximal degree in co-relation 77621. Up to 32847 conditions per place. [2024-06-28 01:36:36,518 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 65 selfloop transitions, 10 changer transitions 2/91 dead transitions. [2024-06-28 01:36:36,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 91 transitions, 404 flow [2024-06-28 01:36:36,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:36:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:36:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2024-06-28 01:36:36,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6313559322033898 [2024-06-28 01:36:36,520 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 154 flow. Second operand 4 states and 149 transitions. [2024-06-28 01:36:36,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 91 transitions, 404 flow [2024-06-28 01:36:36,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 91 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:36:36,523 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 235 flow [2024-06-28 01:36:36,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2024-06-28 01:36:36,524 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 2 predicate places. [2024-06-28 01:36:36,524 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 235 flow [2024-06-28 01:36:36,524 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:36:36,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:36:36,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:36:36,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:36:36,525 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:36:36,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:36:36,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1744449207, now seen corresponding path program 1 times [2024-06-28 01:36:36,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:36:36,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358888105] [2024-06-28 01:36:36,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:36:36,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:36:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:36:37,614 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:36:37,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:36:37,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358888105] [2024-06-28 01:36:37,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358888105] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:36:37,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:36:37,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:36:37,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210311890] [2024-06-28 01:36:37,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:36:37,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:36:37,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:36:37,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:36:37,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:36:37,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:36:37,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:37,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:36:37,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:36:37,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:36:40,464 INFO L124 PetriNetUnfolderBase]: 25879/35836 cut-off events. [2024-06-28 01:36:40,464 INFO L125 PetriNetUnfolderBase]: For 16625/16625 co-relation queries the response was YES. [2024-06-28 01:36:40,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85971 conditions, 35836 events. 25879/35836 cut-off events. For 16625/16625 co-relation queries the response was YES. Maximal size of possible extension queue 1299. Compared 224184 event pairs, 14230 based on Foata normal form. 4/35373 useless extension candidates. Maximal degree in co-relation 85956. Up to 34215 conditions per place. [2024-06-28 01:36:40,687 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 90 selfloop transitions, 28 changer transitions 0/131 dead transitions. [2024-06-28 01:36:40,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 131 transitions, 686 flow [2024-06-28 01:36:40,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:36:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:36:40,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2024-06-28 01:36:40,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6016949152542372 [2024-06-28 01:36:40,690 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 235 flow. Second operand 6 states and 213 transitions. [2024-06-28 01:36:40,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 131 transitions, 686 flow [2024-06-28 01:36:40,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 131 transitions, 662 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-28 01:36:40,695 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 394 flow [2024-06-28 01:36:40,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2024-06-28 01:36:40,696 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 8 predicate places. [2024-06-28 01:36:40,696 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 394 flow [2024-06-28 01:36:40,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:40,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:36:40,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:36:40,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:36:40,697 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:36:40,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:36:40,698 INFO L85 PathProgramCache]: Analyzing trace with hash 823544122, now seen corresponding path program 1 times [2024-06-28 01:36:40,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:36:40,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130364406] [2024-06-28 01:36:40,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:36:40,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:36:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:36:42,034 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:36:42,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:36:42,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130364406] [2024-06-28 01:36:42,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130364406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:36:42,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:36:42,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:36:42,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533704529] [2024-06-28 01:36:42,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:36:42,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:36:42,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:36:42,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:36:42,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:36:42,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:36:42,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 394 flow. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:42,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:36:42,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:36:42,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:36:45,179 INFO L124 PetriNetUnfolderBase]: 25863/35822 cut-off events. [2024-06-28 01:36:45,179 INFO L125 PetriNetUnfolderBase]: For 35504/35504 co-relation queries the response was YES. [2024-06-28 01:36:45,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95702 conditions, 35822 events. 25863/35822 cut-off events. For 35504/35504 co-relation queries the response was YES. Maximal size of possible extension queue 1300. Compared 224503 event pairs, 12336 based on Foata normal form. 8/35363 useless extension candidates. Maximal degree in co-relation 95683. Up to 34137 conditions per place. [2024-06-28 01:36:45,392 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 100 selfloop transitions, 31 changer transitions 0/144 dead transitions. [2024-06-28 01:36:45,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 144 transitions, 832 flow [2024-06-28 01:36:45,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:36:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:36:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 243 transitions. [2024-06-28 01:36:45,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5883777239709443 [2024-06-28 01:36:45,394 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 394 flow. Second operand 7 states and 243 transitions. [2024-06-28 01:36:45,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 144 transitions, 832 flow [2024-06-28 01:36:45,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 144 transitions, 799 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-06-28 01:36:45,409 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 455 flow [2024-06-28 01:36:45,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=455, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2024-06-28 01:36:45,411 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 13 predicate places. [2024-06-28 01:36:45,411 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 455 flow [2024-06-28 01:36:45,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:45,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:36:45,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:36:45,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:36:45,412 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:36:45,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:36:45,412 INFO L85 PathProgramCache]: Analyzing trace with hash -584643660, now seen corresponding path program 1 times [2024-06-28 01:36:45,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:36:45,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558176582] [2024-06-28 01:36:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:36:45,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:36:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:36:46,015 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:36:46,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:36:46,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558176582] [2024-06-28 01:36:46,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558176582] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:36:46,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:36:46,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:36:46,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44824174] [2024-06-28 01:36:46,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:36:46,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:36:46,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:36:46,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:36:46,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:36:46,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 01:36:46,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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:36:46,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:36:46,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 01:36:46,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:36:49,685 INFO L124 PetriNetUnfolderBase]: 30042/44174 cut-off events. [2024-06-28 01:36:49,686 INFO L125 PetriNetUnfolderBase]: For 60768/60768 co-relation queries the response was YES. [2024-06-28 01:36:49,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118719 conditions, 44174 events. 30042/44174 cut-off events. For 60768/60768 co-relation queries the response was YES. Maximal size of possible extension queue 1528. Compared 310277 event pairs, 17157 based on Foata normal form. 3/42986 useless extension candidates. Maximal degree in co-relation 118697. Up to 39690 conditions per place. [2024-06-28 01:36:49,949 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 85 selfloop transitions, 14 changer transitions 0/110 dead transitions. [2024-06-28 01:36:49,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 110 transitions, 739 flow [2024-06-28 01:36:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:36:49,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:36:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2024-06-28 01:36:49,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.511864406779661 [2024-06-28 01:36:49,951 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 455 flow. Second operand 5 states and 151 transitions. [2024-06-28 01:36:49,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 110 transitions, 739 flow [2024-06-28 01:36:49,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 110 transitions, 663 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-28 01:36:49,961 INFO L231 Difference]: Finished difference. Result has 80 places, 86 transitions, 453 flow [2024-06-28 01:36:49,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=453, PETRI_PLACES=80, PETRI_TRANSITIONS=86} [2024-06-28 01:36:49,962 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 13 predicate places. [2024-06-28 01:36:49,962 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 453 flow [2024-06-28 01:36:49,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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:36:49,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:36:49,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:36:49,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:36:49,963 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:36:49,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:36:49,963 INFO L85 PathProgramCache]: Analyzing trace with hash -944082695, now seen corresponding path program 1 times [2024-06-28 01:36:49,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:36:49,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422040856] [2024-06-28 01:36:49,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:36:49,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:36:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:36:50,746 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:36:50,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:36:50,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422040856] [2024-06-28 01:36:50,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422040856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:36:50,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:36:50,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:36:50,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387981883] [2024-06-28 01:36:50,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:36:50,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:36:50,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:36:50,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:36:50,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:36:50,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 01:36:50,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 86 transitions, 453 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:50,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:36:50,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 01:36:50,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:36:55,477 INFO L124 PetriNetUnfolderBase]: 30172/44591 cut-off events. [2024-06-28 01:36:55,477 INFO L125 PetriNetUnfolderBase]: For 84043/84043 co-relation queries the response was YES. [2024-06-28 01:36:55,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126889 conditions, 44591 events. 30172/44591 cut-off events. For 84043/84043 co-relation queries the response was YES. Maximal size of possible extension queue 1549. Compared 315861 event pairs, 16342 based on Foata normal form. 14/43660 useless extension candidates. Maximal degree in co-relation 126865. Up to 39510 conditions per place. [2024-06-28 01:36:55,749 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 109 selfloop transitions, 25 changer transitions 0/145 dead transitions. [2024-06-28 01:36:55,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 145 transitions, 961 flow [2024-06-28 01:36:55,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:36:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:36:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-06-28 01:36:55,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5480225988700564 [2024-06-28 01:36:55,751 INFO L175 Difference]: Start difference. First operand has 80 places, 86 transitions, 453 flow. Second operand 6 states and 194 transitions. [2024-06-28 01:36:55,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 145 transitions, 961 flow [2024-06-28 01:36:55,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 145 transitions, 921 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-28 01:36:55,763 INFO L231 Difference]: Finished difference. Result has 85 places, 100 transitions, 603 flow [2024-06-28 01:36:55,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=603, PETRI_PLACES=85, PETRI_TRANSITIONS=100} [2024-06-28 01:36:55,764 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 18 predicate places. [2024-06-28 01:36:55,764 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 100 transitions, 603 flow [2024-06-28 01:36:55,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:55,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:36:55,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:36:55,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:36:55,765 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:36:55,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:36:55,766 INFO L85 PathProgramCache]: Analyzing trace with hash 791563762, now seen corresponding path program 1 times [2024-06-28 01:36:55,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:36:55,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645318849] [2024-06-28 01:36:55,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:36:55,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:36:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:36:56,763 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:36:56,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:36:56,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645318849] [2024-06-28 01:36:56,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645318849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:36:56,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:36:56,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:36:56,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721480290] [2024-06-28 01:36:56,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:36:56,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:36:56,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:36:56,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:36:56,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:36:56,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 01:36:56,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 100 transitions, 603 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:56,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:36:56,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 01:36:56,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:01,414 INFO L124 PetriNetUnfolderBase]: 30217/44148 cut-off events. [2024-06-28 01:37:01,415 INFO L125 PetriNetUnfolderBase]: For 120906/120918 co-relation queries the response was YES. [2024-06-28 01:37:01,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139911 conditions, 44148 events. 30217/44148 cut-off events. For 120906/120918 co-relation queries the response was YES. Maximal size of possible extension queue 1508. Compared 304019 event pairs, 15365 based on Foata normal form. 11/43223 useless extension candidates. Maximal degree in co-relation 139884. Up to 39849 conditions per place. [2024-06-28 01:37:01,752 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 120 selfloop transitions, 23 changer transitions 0/154 dead transitions. [2024-06-28 01:37:01,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 154 transitions, 1137 flow [2024-06-28 01:37:01,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:37:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:37:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2024-06-28 01:37:01,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5310734463276836 [2024-06-28 01:37:01,754 INFO L175 Difference]: Start difference. First operand has 85 places, 100 transitions, 603 flow. Second operand 6 states and 188 transitions. [2024-06-28 01:37:01,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 154 transitions, 1137 flow [2024-06-28 01:37:01,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 154 transitions, 1109 flow, removed 13 selfloop flow, removed 1 redundant places. [2024-06-28 01:37:01,792 INFO L231 Difference]: Finished difference. Result has 92 places, 114 transitions, 784 flow [2024-06-28 01:37:01,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=784, PETRI_PLACES=92, PETRI_TRANSITIONS=114} [2024-06-28 01:37:01,793 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 25 predicate places. [2024-06-28 01:37:01,793 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 114 transitions, 784 flow [2024-06-28 01:37:01,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:01,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:01,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:01,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:37:01,794 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:37:01,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:01,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1628475412, now seen corresponding path program 2 times [2024-06-28 01:37:01,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:01,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622311940] [2024-06-28 01:37:01,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:01,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:02,749 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:37:02,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:02,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622311940] [2024-06-28 01:37:02,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622311940] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:02,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:02,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:37:02,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691472007] [2024-06-28 01:37:02,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:02,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:37:02,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:02,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:37:02,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:37:02,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 01:37:02,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 114 transitions, 784 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:02,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:02,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 01:37:02,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:37:07,413 INFO L124 PetriNetUnfolderBase]: 30208/44705 cut-off events. [2024-06-28 01:37:07,413 INFO L125 PetriNetUnfolderBase]: For 157544/157544 co-relation queries the response was YES. [2024-06-28 01:37:07,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149107 conditions, 44705 events. 30208/44705 cut-off events. For 157544/157544 co-relation queries the response was YES. Maximal size of possible extension queue 1551. Compared 316970 event pairs, 16412 based on Foata normal form. 3/43773 useless extension candidates. Maximal degree in co-relation 149075. Up to 39890 conditions per place. [2024-06-28 01:37:07,801 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 119 selfloop transitions, 16 changer transitions 0/146 dead transitions. [2024-06-28 01:37:07,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 146 transitions, 1136 flow [2024-06-28 01:37:07,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:37:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:37:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2024-06-28 01:37:07,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056497175141242 [2024-06-28 01:37:07,803 INFO L175 Difference]: Start difference. First operand has 92 places, 114 transitions, 784 flow. Second operand 6 states and 179 transitions. [2024-06-28 01:37:07,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 146 transitions, 1136 flow [2024-06-28 01:37:07,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 146 transitions, 1084 flow, removed 25 selfloop flow, removed 1 redundant places. [2024-06-28 01:37:07,878 INFO L231 Difference]: Finished difference. Result has 97 places, 114 transitions, 775 flow [2024-06-28 01:37:07,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=775, PETRI_PLACES=97, PETRI_TRANSITIONS=114} [2024-06-28 01:37:07,879 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 30 predicate places. [2024-06-28 01:37:07,879 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 114 transitions, 775 flow [2024-06-28 01:37:07,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:37:07,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:37:07,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:37:07,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:37:07,880 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:37:07,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:37:07,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1431294353, now seen corresponding path program 1 times [2024-06-28 01:37:07,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:37:07,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767818245] [2024-06-28 01:37:07,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:37:07,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:37:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:37:09,061 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:37:09,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:37:09,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767818245] [2024-06-28 01:37:09,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767818245] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:37:09,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:37:09,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:37:09,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247424346] [2024-06-28 01:37:09,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:37:09,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:37:09,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:37:09,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:37:09,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:37:09,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 01:37:09,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 114 transitions, 775 flow. Second operand has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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:37:09,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:37:09,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 01:37:09,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand