./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix037_tso.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix037_tso.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:35:46,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:35:46,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:35:46,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:35:46,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:35:46,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:35:46,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:35:46,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:35:46,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:35:46,692 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:35:46,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:35:46,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:35:46,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:35:46,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:35:46,693 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:35:46,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:35:46,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:35:46,694 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:35:46,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:35:46,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:35:46,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:35:46,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:35:46,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:35:46,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:35:46,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:35:46,696 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:35:46,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:35:46,696 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:35:46,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:35:46,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:35:46,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:35:46,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:35:46,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:35:46,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:35:46,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:35:46,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:35:46,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:35:46,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:35:46,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:35:46,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:35:46,699 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:35:46,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:35:46,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:35:46,700 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:35:46,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:35:46,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:35:46,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:35:46,869 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:35:46,869 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:35:46,870 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/mix037_tso.oepc.yml/witness.yml [2024-06-28 01:35:47,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:35:47,083 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:35:47,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2024-06-28 01:35:48,045 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:35:48,293 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:35:48,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2024-06-28 01:35:48,317 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28152928f/4c590b2f29cf41138161e2637c7ff864/FLAGc041bf578 [2024-06-28 01:35:48,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28152928f/4c590b2f29cf41138161e2637c7ff864 [2024-06-28 01:35:48,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:35:48,333 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:35:48,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:35:48,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:35:48,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:35:48,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:35:47" (1/2) ... [2024-06-28 01:35:48,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a33349 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:35:48, skipping insertion in model container [2024-06-28 01:35:48,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:35:47" (1/2) ... [2024-06-28 01:35:48,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7d09ec4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:35:48, skipping insertion in model container [2024-06-28 01:35:48,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:35:48" (2/2) ... [2024-06-28 01:35:48,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a33349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:35:48, skipping insertion in model container [2024-06-28 01:35:48,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:35:48" (2/2) ... [2024-06-28 01:35:48,343 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:35:48,467 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:35:48,467 INFO L97 edCorrectnessWitness]: Location invariant before [L865-L865] (((((((((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (b == 0 || b == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0) [2024-06-28 01:35:48,468 INFO L97 edCorrectnessWitness]: Location invariant before [L863-L863] (((((((((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (b == 0 || b == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0) [2024-06-28 01:35:48,468 INFO L97 edCorrectnessWitness]: Location invariant before [L861-L861] (((((((((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (b == 0 || b == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0) [2024-06-28 01:35:48,468 INFO L97 edCorrectnessWitness]: Location invariant before [L866-L866] (((((((((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (b == 0 || b == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0) [2024-06-28 01:35:48,468 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:35:48,468 INFO L106 edCorrectnessWitness]: ghost_update [L859-L859] multithreaded = 1; [2024-06-28 01:35:48,504 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:35:48,650 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/mix037_tso.oepc.i[949,962] [2024-06-28 01:35:48,857 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:35:48,868 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:35:48,894 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/mix037_tso.oepc.i[949,962] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:35:49,009 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:35:49,046 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:35:49,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:35:49 WrapperNode [2024-06-28 01:35:49,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:35:49,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:35:49,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:35:49,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:35:49,053 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:35:49" (1/1) ... [2024-06-28 01:35:49,067 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:35:49" (1/1) ... [2024-06-28 01:35:49,102 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 155 [2024-06-28 01:35:49,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:35:49,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:35:49,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:35:49,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:35:49,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:35:49" (1/1) ... [2024-06-28 01:35:49,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:35:49" (1/1) ... [2024-06-28 01:35:49,115 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:35:49" (1/1) ... [2024-06-28 01:35:49,128 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:35:49,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:35:49" (1/1) ... [2024-06-28 01:35:49,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:35:49" (1/1) ... [2024-06-28 01:35:49,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:35:49" (1/1) ... [2024-06-28 01:35:49,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:35:49" (1/1) ... [2024-06-28 01:35:49,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:35:49" (1/1) ... [2024-06-28 01:35:49,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:35:49" (1/1) ... [2024-06-28 01:35:49,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:35:49,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:35:49,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:35:49,150 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:35:49,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:35:49" (1/1) ... [2024-06-28 01:35:49,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:35:49,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:35:49,201 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:35:49,217 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:35:49,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:35:49,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:35:49,230 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:35:49,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:35:49,231 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:35:49,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:35:49,231 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 01:35:49,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 01:35:49,231 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 01:35:49,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 01:35:49,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:35:49,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:35:49,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:35:49,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:35:49,235 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:35:49,371 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:35:49,373 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:35:49,740 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:35:49,740 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:35:49,882 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:35:49,883 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:35:49,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:35:49 BoogieIcfgContainer [2024-06-28 01:35:49,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:35:49,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:35:49,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:35:49,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:35:49,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:35:47" (1/4) ... [2024-06-28 01:35:49,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3732f3a6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:35:49, skipping insertion in model container [2024-06-28 01:35:49,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:35:48" (2/4) ... [2024-06-28 01:35:49,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3732f3a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:35:49, skipping insertion in model container [2024-06-28 01:35:49,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:35:49" (3/4) ... [2024-06-28 01:35:49,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3732f3a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:35:49, skipping insertion in model container [2024-06-28 01:35:49,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:35:49" (4/4) ... [2024-06-28 01:35:49,891 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2024-06-28 01:35:49,904 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:35:49,905 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-28 01:35:49,905 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:35:49,952 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:35:50,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:35:50,045 INFO L124 PetriNetUnfolderBase]: 1/55 cut-off events. [2024-06-28 01:35:50,045 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:35:50,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 1/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 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:35:50,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:35:50,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 55 transitions, 122 flow [2024-06-28 01:35:50,075 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:35:50,083 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;@9cfff5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:35:50,083 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-28 01:35:50,087 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:35:50,087 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:35:50,087 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:35:50,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:35:50,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:35:50,088 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:35:50,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:35:50,095 INFO L85 PathProgramCache]: Analyzing trace with hash 387919158, now seen corresponding path program 1 times [2024-06-28 01:35:50,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:35:50,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957543349] [2024-06-28 01:35:50,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:35:50,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:35:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:35:51,125 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:35:51,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:35:51,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957543349] [2024-06-28 01:35:51,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957543349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:35:51,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:35:51,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:35:51,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400848228] [2024-06-28 01:35:51,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:35:51,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:35:51,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:35:51,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:35:51,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:35:51,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:35:51,225 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:35:51,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:35:51,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:35:51,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:35:54,968 INFO L124 PetriNetUnfolderBase]: 29456/43285 cut-off events. [2024-06-28 01:35:54,968 INFO L125 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2024-06-28 01:35:55,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82718 conditions, 43285 events. 29456/43285 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 1556. Compared 307853 event pairs, 25591 based on Foata normal form. 1081/40990 useless extension candidates. Maximal degree in co-relation 82705. Up to 38965 conditions per place. [2024-06-28 01:35:55,214 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 54 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2024-06-28 01:35:55,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 74 transitions, 289 flow [2024-06-28 01:35:55,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:35:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:35:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-06-28 01:35:55,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2024-06-28 01:35:55,225 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 120 transitions. [2024-06-28 01:35:55,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 74 transitions, 289 flow [2024-06-28 01:35:55,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 282 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 01:35:55,230 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 162 flow [2024-06-28 01:35:55,231 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:35:55,233 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2024-06-28 01:35:55,234 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 162 flow [2024-06-28 01:35:55,234 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:35:55,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:35:55,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:35:55,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:35:55,235 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:35:55,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:35:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash -871462979, now seen corresponding path program 1 times [2024-06-28 01:35:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:35:55,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665707734] [2024-06-28 01:35:55,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:35:55,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:35:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:35:55,839 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:35:55,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:35:55,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665707734] [2024-06-28 01:35:55,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665707734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:35:55,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:35:55,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:35:55,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121995329] [2024-06-28 01:35:55,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:35:55,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:35:55,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:35:55,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:35:55,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:35:55,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:35:55,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:35:55,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:35:55,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:35:55,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:35:59,558 INFO L124 PetriNetUnfolderBase]: 34255/49498 cut-off events. [2024-06-28 01:35:59,564 INFO L125 PetriNetUnfolderBase]: For 7410/7410 co-relation queries the response was YES. [2024-06-28 01:35:59,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105752 conditions, 49498 events. 34255/49498 cut-off events. For 7410/7410 co-relation queries the response was YES. Maximal size of possible extension queue 1732. Compared 343796 event pairs, 27425 based on Foata normal form. 4/46172 useless extension candidates. Maximal degree in co-relation 105740. Up to 45169 conditions per place. [2024-06-28 01:35:59,817 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 70 selfloop transitions, 11 changer transitions 0/94 dead transitions. [2024-06-28 01:35:59,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 94 transitions, 414 flow [2024-06-28 01:35:59,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:35:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:35:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2024-06-28 01:35:59,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6483050847457628 [2024-06-28 01:35:59,824 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 162 flow. Second operand 4 states and 153 transitions. [2024-06-28 01:35:59,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 94 transitions, 414 flow [2024-06-28 01:35:59,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 94 transitions, 408 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:35:59,828 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 220 flow [2024-06-28 01:35:59,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-06-28 01:35:59,829 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 2 predicate places. [2024-06-28 01:35:59,831 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 220 flow [2024-06-28 01:35:59,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:35:59,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:35:59,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:35:59,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:35:59,838 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:35:59,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:35:59,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1245547419, now seen corresponding path program 1 times [2024-06-28 01:35:59,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:35:59,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228821154] [2024-06-28 01:35:59,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:35:59,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:35:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:36:00,565 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:00,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:36:00,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228821154] [2024-06-28 01:36:00,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228821154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:36:00,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:36:00,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:36:00,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813610237] [2024-06-28 01:36:00,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:36:00,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:36:00,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:36:00,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:36:00,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:36:00,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:36:00,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:00,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:36:00,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:36:00,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:36:04,331 INFO L124 PetriNetUnfolderBase]: 34229/48913 cut-off events. [2024-06-28 01:36:04,331 INFO L125 PetriNetUnfolderBase]: For 20728/20728 co-relation queries the response was YES. [2024-06-28 01:36:04,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115627 conditions, 48913 events. 34229/48913 cut-off events. For 20728/20728 co-relation queries the response was YES. Maximal size of possible extension queue 1722. Compared 333447 event pairs, 22485 based on Foata normal form. 8/45774 useless extension candidates. Maximal degree in co-relation 115613. Up to 45094 conditions per place. [2024-06-28 01:36:04,608 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 87 selfloop transitions, 19 changer transitions 0/119 dead transitions. [2024-06-28 01:36:04,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 119 transitions, 620 flow [2024-06-28 01:36:04,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:36:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:36:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 185 transitions. [2024-06-28 01:36:04,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6271186440677966 [2024-06-28 01:36:04,610 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 220 flow. Second operand 5 states and 185 transitions. [2024-06-28 01:36:04,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 119 transitions, 620 flow [2024-06-28 01:36:04,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 119 transitions, 574 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-28 01:36:04,617 INFO L231 Difference]: Finished difference. Result has 74 places, 82 transitions, 369 flow [2024-06-28 01:36:04,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=74, PETRI_TRANSITIONS=82} [2024-06-28 01:36:04,619 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 7 predicate places. [2024-06-28 01:36:04,619 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 369 flow [2024-06-28 01:36:04,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:04,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:36:04,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:36:04,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:36:04,620 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:36:04,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:36:04,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1256895714, now seen corresponding path program 1 times [2024-06-28 01:36:04,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:36:04,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103576667] [2024-06-28 01:36:04,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:36:04,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:36:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:36:04,687 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:04,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:36:04,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103576667] [2024-06-28 01:36:04,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103576667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:36:04,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:36:04,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:36:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168482885] [2024-06-28 01:36:04,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:36:04,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:36:04,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:36:04,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:36:04,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:36:04,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 59 [2024-06-28 01:36:04,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:04,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:36:04,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 59 [2024-06-28 01:36:04,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:36:06,151 INFO L124 PetriNetUnfolderBase]: 6850/12170 cut-off events. [2024-06-28 01:36:06,151 INFO L125 PetriNetUnfolderBase]: For 5390/6555 co-relation queries the response was YES. [2024-06-28 01:36:06,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26656 conditions, 12170 events. 6850/12170 cut-off events. For 5390/6555 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 103752 event pairs, 3152 based on Foata normal form. 32/11110 useless extension candidates. Maximal degree in co-relation 26639. Up to 7830 conditions per place. [2024-06-28 01:36:06,211 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 45 selfloop transitions, 7 changer transitions 0/94 dead transitions. [2024-06-28 01:36:06,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 94 transitions, 472 flow [2024-06-28 01:36:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:36:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:36:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-06-28 01:36:06,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7796610169491526 [2024-06-28 01:36:06,213 INFO L175 Difference]: Start difference. First operand has 74 places, 82 transitions, 369 flow. Second operand 3 states and 138 transitions. [2024-06-28 01:36:06,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 94 transitions, 472 flow [2024-06-28 01:36:06,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 94 transitions, 460 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-28 01:36:06,220 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 328 flow [2024-06-28 01:36:06,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2024-06-28 01:36:06,221 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 8 predicate places. [2024-06-28 01:36:06,221 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 328 flow [2024-06-28 01:36:06,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:06,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:36:06,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:36:06,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:36:06,222 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:36:06,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:36:06,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1697961736, now seen corresponding path program 1 times [2024-06-28 01:36:06,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:36:06,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229375828] [2024-06-28 01:36:06,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:36:06,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:36:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:36:07,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:36:07,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:36:07,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229375828] [2024-06-28 01:36:07,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229375828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:36:07,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:36:07,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:36:07,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655999001] [2024-06-28 01:36:07,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:36:07,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:36:07,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:36:07,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:36:07,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:36:07,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:36:07,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 328 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:07,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:36:07,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:36:07,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:36:10,875 INFO L124 PetriNetUnfolderBase]: 28211/40723 cut-off events. [2024-06-28 01:36:10,876 INFO L125 PetriNetUnfolderBase]: For 41339/41339 co-relation queries the response was YES. [2024-06-28 01:36:10,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103888 conditions, 40723 events. 28211/40723 cut-off events. For 41339/41339 co-relation queries the response was YES. Maximal size of possible extension queue 1425. Compared 278053 event pairs, 14910 based on Foata normal form. 8/39541 useless extension candidates. Maximal degree in co-relation 103869. Up to 37194 conditions per place. [2024-06-28 01:36:11,133 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 92 selfloop transitions, 20 changer transitions 1/126 dead transitions. [2024-06-28 01:36:11,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 126 transitions, 692 flow [2024-06-28 01:36:11,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:36:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:36:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-06-28 01:36:11,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.596045197740113 [2024-06-28 01:36:11,135 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 328 flow. Second operand 6 states and 211 transitions. [2024-06-28 01:36:11,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 126 transitions, 692 flow [2024-06-28 01:36:11,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 126 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:36:11,142 INFO L231 Difference]: Finished difference. Result has 78 places, 78 transitions, 391 flow [2024-06-28 01:36:11,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=391, PETRI_PLACES=78, PETRI_TRANSITIONS=78} [2024-06-28 01:36:11,142 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 11 predicate places. [2024-06-28 01:36:11,143 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 78 transitions, 391 flow [2024-06-28 01:36:11,143 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:11,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:36:11,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:36:11,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:36:11,143 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:36:11,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:36:11,144 INFO L85 PathProgramCache]: Analyzing trace with hash -991703637, now seen corresponding path program 1 times [2024-06-28 01:36:11,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:36:11,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743308456] [2024-06-28 01:36:11,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:36:11,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:36:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:36:11,980 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:11,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:36:11,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743308456] [2024-06-28 01:36:11,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743308456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:36:11,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:36:11,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:36:11,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586300841] [2024-06-28 01:36:11,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:36:11,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:36:11,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:36:11,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:36:11,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:36:12,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:36:12,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 78 transitions, 391 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:12,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:36:12,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:36:12,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:36:15,565 INFO L124 PetriNetUnfolderBase]: 24243/35671 cut-off events. [2024-06-28 01:36:15,565 INFO L125 PetriNetUnfolderBase]: For 46693/46693 co-relation queries the response was YES. [2024-06-28 01:36:15,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95579 conditions, 35671 events. 24243/35671 cut-off events. For 46693/46693 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 245257 event pairs, 14982 based on Foata normal form. 3/34499 useless extension candidates. Maximal degree in co-relation 95558. Up to 32129 conditions per place. [2024-06-28 01:36:15,862 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 88 selfloop transitions, 11 changer transitions 0/111 dead transitions. [2024-06-28 01:36:15,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 111 transitions, 718 flow [2024-06-28 01:36:15,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:36:15,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:36:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-06-28 01:36:15,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5254237288135594 [2024-06-28 01:36:15,867 INFO L175 Difference]: Start difference. First operand has 78 places, 78 transitions, 391 flow. Second operand 5 states and 155 transitions. [2024-06-28 01:36:15,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 111 transitions, 718 flow [2024-06-28 01:36:15,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 111 transitions, 655 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 01:36:15,879 INFO L231 Difference]: Finished difference. Result has 79 places, 87 transitions, 452 flow [2024-06-28 01:36:15,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=452, PETRI_PLACES=79, PETRI_TRANSITIONS=87} [2024-06-28 01:36:15,882 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 12 predicate places. [2024-06-28 01:36:15,882 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 87 transitions, 452 flow [2024-06-28 01:36:15,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:36:15,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:36:15,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:36:15,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:36:15,883 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:36:15,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:36:15,884 INFO L85 PathProgramCache]: Analyzing trace with hash -472303316, now seen corresponding path program 1 times [2024-06-28 01:36:15,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:36:15,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489475829] [2024-06-28 01:36:15,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:36:15,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:36:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:36:16,985 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:16,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:36:16,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489475829] [2024-06-28 01:36:16,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489475829] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:36:16,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:36:16,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:36:16,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718581324] [2024-06-28 01:36:16,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:36:16,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:36:16,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:36:16,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:36:16,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:36:17,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 01:36:17,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 87 transitions, 452 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:17,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:36:17,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 01:36:17,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:36:21,031 INFO L124 PetriNetUnfolderBase]: 28255/40835 cut-off events. [2024-06-28 01:36:21,031 INFO L125 PetriNetUnfolderBase]: For 75773/75773 co-relation queries the response was YES. [2024-06-28 01:36:21,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117787 conditions, 40835 events. 28255/40835 cut-off events. For 75773/75773 co-relation queries the response was YES. Maximal size of possible extension queue 1380. Compared 276328 event pairs, 17308 based on Foata normal form. 3/39704 useless extension candidates. Maximal degree in co-relation 117763. Up to 37329 conditions per place. [2024-06-28 01:36:21,522 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 105 selfloop transitions, 16 changer transitions 0/132 dead transitions. [2024-06-28 01:36:21,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 132 transitions, 853 flow [2024-06-28 01:36:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:36:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:36:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2024-06-28 01:36:21,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5169491525423728 [2024-06-28 01:36:21,523 INFO L175 Difference]: Start difference. First operand has 79 places, 87 transitions, 452 flow. Second operand 6 states and 183 transitions. [2024-06-28 01:36:21,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 132 transitions, 853 flow [2024-06-28 01:36:21,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 132 transitions, 828 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-28 01:36:21,545 INFO L231 Difference]: Finished difference. Result has 84 places, 96 transitions, 559 flow [2024-06-28 01:36:21,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=559, PETRI_PLACES=84, PETRI_TRANSITIONS=96} [2024-06-28 01:36:21,545 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 17 predicate places. [2024-06-28 01:36:21,545 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 96 transitions, 559 flow [2024-06-28 01:36:21,546 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:21,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:36:21,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:36:21,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:36:21,546 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:36:21,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:36:21,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1148231800, now seen corresponding path program 2 times [2024-06-28 01:36:21,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:36:21,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080630107] [2024-06-28 01:36:21,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:36:21,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:36:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:36:22,457 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:22,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:36:22,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080630107] [2024-06-28 01:36:22,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080630107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:36:22,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:36:22,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:36:22,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985768651] [2024-06-28 01:36:22,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:36:22,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:36:22,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:36:22,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:36:22,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:36:22,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 01:36:22,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 96 transitions, 559 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:22,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:36:22,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 01:36:22,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:36:26,376 INFO L124 PetriNetUnfolderBase]: 28257/40824 cut-off events. [2024-06-28 01:36:26,376 INFO L125 PetriNetUnfolderBase]: For 103531/103563 co-relation queries the response was YES. [2024-06-28 01:36:26,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126301 conditions, 40824 events. 28257/40824 cut-off events. For 103531/103563 co-relation queries the response was YES. Maximal size of possible extension queue 1388. Compared 276582 event pairs, 16684 based on Foata normal form. 27/39740 useless extension candidates. Maximal degree in co-relation 126274. Up to 37284 conditions per place.