./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/thin002_power.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/thin002_power.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 02:12:54,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:12:54,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:12:54,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:12:54,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:12:54,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:12:54,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:12:54,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:12:54,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:12:54,780 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:12:54,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:12:54,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:12:54,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:12:54,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:12:54,782 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:12:54,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:12:54,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:12:54,783 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:12:54,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:12:54,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:12:54,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:12:54,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:12:54,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:12:54,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:12:54,785 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:12:54,785 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:12:54,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:12:54,786 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:12:54,786 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:12:54,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:12:54,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:12:54,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:12:54,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:12:54,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:12:54,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:12:54,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:12:54,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:12:54,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:12:54,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:12:54,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:12:54,789 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:12:54,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:12:54,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:12:54,791 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 02:12:55,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:12:55,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:12:55,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:12:55,021 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:12:55,021 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:12:55,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2024-06-28 02:12:56,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:12:56,306 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:12:56,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2024-06-28 02:12:56,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c965646a3/bcea873170874bcd8a9828e6fda46112/FLAGcbc4d5309 [2024-06-28 02:12:56,357 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c965646a3/bcea873170874bcd8a9828e6fda46112 [2024-06-28 02:12:56,359 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:12:56,360 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:12:56,361 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/thin002_power.opt.yml/witness.yml [2024-06-28 02:12:56,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:12:56,584 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:12:56,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:12:56,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:12:56,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:12:56,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:12:56" (1/2) ... [2024-06-28 02:12:56,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@165bfe6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:12:56, skipping insertion in model container [2024-06-28 02:12:56,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:12:56" (1/2) ... [2024-06-28 02:12:56,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6fff297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:12:56, skipping insertion in model container [2024-06-28 02:12:56,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:12:56" (2/2) ... [2024-06-28 02:12:56,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@165bfe6f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:56, skipping insertion in model container [2024-06-28 02:12:56,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:12:56" (2/2) ... [2024-06-28 02:12:56,594 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:12:56,771 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:12:56,772 INFO L97 edCorrectnessWitness]: Location invariant before [L878-L878] (((((((((((((((((((((((((((((((((((((((! multithreaded || z$r_buff0_thd1 == (_Bool)0) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || __unbuffered_p3_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p3_EAX$flush_delayed == (_Bool)0) && __unbuffered_p3_EAX$mem_tmp == 0) && __unbuffered_p3_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p3_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p3_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p3_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p3_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p3_EAX$w_buff0 == 0) && __unbuffered_p3_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p3_EAX$w_buff1 == 0) && __unbuffered_p3_EAX$w_buff1_used == (_Bool)0) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd4 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd4 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EAX$read_delayed_var == 0 || (__unbuffered_p3_EAX$read_delayed_var == & z && (*__unbuffered_p3_EAX$read_delayed_var == 0 || *__unbuffered_p3_EAX$read_delayed_var == 1)))) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$mem_tmp == 0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || __unbuffered_p3_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (__unbuffered_p3_EAX$read_delayed_var == 0 || (__unbuffered_p3_EAX$read_delayed_var == & z && (*__unbuffered_p3_EAX$read_delayed_var == 0 || *__unbuffered_p3_EAX$read_delayed_var == 1))))) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1)) [2024-06-28 02:12:56,772 INFO L97 edCorrectnessWitness]: Location invariant before [L880-L880] (((((((((((((((((((((((((((((((((((((((! multithreaded || z$r_buff0_thd1 == (_Bool)0) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || __unbuffered_p3_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p3_EAX$flush_delayed == (_Bool)0) && __unbuffered_p3_EAX$mem_tmp == 0) && __unbuffered_p3_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p3_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p3_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p3_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p3_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p3_EAX$w_buff0 == 0) && __unbuffered_p3_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p3_EAX$w_buff1 == 0) && __unbuffered_p3_EAX$w_buff1_used == (_Bool)0) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd4 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd4 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EAX$read_delayed_var == 0 || (__unbuffered_p3_EAX$read_delayed_var == & z && (*__unbuffered_p3_EAX$read_delayed_var == 0 || *__unbuffered_p3_EAX$read_delayed_var == 1)))) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$mem_tmp == 0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || __unbuffered_p3_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (__unbuffered_p3_EAX$read_delayed_var == 0 || (__unbuffered_p3_EAX$read_delayed_var == & z && (*__unbuffered_p3_EAX$read_delayed_var == 0 || *__unbuffered_p3_EAX$read_delayed_var == 1))))) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1)) [2024-06-28 02:12:56,772 INFO L97 edCorrectnessWitness]: Location invariant before [L883-L883] (((((((((((((((((((((((((((((((((((((((! multithreaded || z$r_buff0_thd1 == (_Bool)0) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || __unbuffered_p3_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p3_EAX$flush_delayed == (_Bool)0) && __unbuffered_p3_EAX$mem_tmp == 0) && __unbuffered_p3_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p3_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p3_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p3_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p3_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p3_EAX$w_buff0 == 0) && __unbuffered_p3_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p3_EAX$w_buff1 == 0) && __unbuffered_p3_EAX$w_buff1_used == (_Bool)0) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd4 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd4 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EAX$read_delayed_var == 0 || (__unbuffered_p3_EAX$read_delayed_var == & z && (*__unbuffered_p3_EAX$read_delayed_var == 0 || *__unbuffered_p3_EAX$read_delayed_var == 1)))) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$mem_tmp == 0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || __unbuffered_p3_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (__unbuffered_p3_EAX$read_delayed_var == 0 || (__unbuffered_p3_EAX$read_delayed_var == & z && (*__unbuffered_p3_EAX$read_delayed_var == 0 || *__unbuffered_p3_EAX$read_delayed_var == 1))))) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1)) [2024-06-28 02:12:56,773 INFO L97 edCorrectnessWitness]: Location invariant before [L882-L882] (((((((((((((((((((((((((((((((((((((((! multithreaded || z$r_buff0_thd1 == (_Bool)0) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || __unbuffered_p3_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p3_EAX$flush_delayed == (_Bool)0) && __unbuffered_p3_EAX$mem_tmp == 0) && __unbuffered_p3_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p3_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p3_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p3_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p3_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p3_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p3_EAX$w_buff0 == 0) && __unbuffered_p3_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p3_EAX$w_buff1 == 0) && __unbuffered_p3_EAX$w_buff1_used == (_Bool)0) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd4 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd4 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EAX$read_delayed_var == 0 || (__unbuffered_p3_EAX$read_delayed_var == & z && (*__unbuffered_p3_EAX$read_delayed_var == 0 || *__unbuffered_p3_EAX$read_delayed_var == 1)))) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$mem_tmp == 0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || __unbuffered_p3_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (__unbuffered_p3_EAX$read_delayed_var == 0 || (__unbuffered_p3_EAX$read_delayed_var == & z && (*__unbuffered_p3_EAX$read_delayed_var == 0 || *__unbuffered_p3_EAX$read_delayed_var == 1))))) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || __unbuffered_p3_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p3_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p3_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1)) [2024-06-28 02:12:56,773 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:12:56,773 INFO L106 edCorrectnessWitness]: ghost_update [L876-L876] multithreaded = 1; [2024-06-28 02:12:56,806 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:12:56,944 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/thin002_power.opt.i[951,964] [2024-06-28 02:12:57,079 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:12:57,091 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 02:12:57,132 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/thin002_power.opt.i[951,964] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:12:57,271 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:12:57,315 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:12:57,316 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:57 WrapperNode [2024-06-28 02:12:57,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:12:57,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:12:57,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:12:57,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:12:57,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:57" (1/1) ... [2024-06-28 02:12:57,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:57" (1/1) ... [2024-06-28 02:12:57,387 INFO L138 Inliner]: procedures = 176, calls = 100, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 291 [2024-06-28 02:12:57,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:12:57,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:12:57,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:12:57,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:12:57,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:57" (1/1) ... [2024-06-28 02:12:57,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:57" (1/1) ... [2024-06-28 02:12:57,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:57" (1/1) ... [2024-06-28 02:12:57,427 INFO L175 MemorySlicer]: Split 50 memory accesses to 2 slices as follows [2, 48]. 96 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-06-28 02:12:57,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:57" (1/1) ... [2024-06-28 02:12:57,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:57" (1/1) ... [2024-06-28 02:12:57,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:57" (1/1) ... [2024-06-28 02:12:57,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:57" (1/1) ... [2024-06-28 02:12:57,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:57" (1/1) ... [2024-06-28 02:12:57,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:57" (1/1) ... [2024-06-28 02:12:57,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:12:57,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:12:57,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:12:57,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:12:57,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:57" (1/1) ... [2024-06-28 02:12:57,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:12:57,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:12:57,504 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 02:12:57,526 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 02:12:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 02:12:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 02:12:57,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 02:12:57,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 02:12:57,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 02:12:57,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:12:57,540 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 02:12:57,540 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 02:12:57,541 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 02:12:57,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 02:12:57,541 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 02:12:57,542 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 02:12:57,542 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 02:12:57,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 02:12:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:12:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 02:12:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 02:12:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:12:57,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:12:57,546 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 02:12:57,724 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:12:57,726 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:12:58,326 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:12:58,327 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:12:58,740 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:12:58,741 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 02:12:58,741 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:12:58 BoogieIcfgContainer [2024-06-28 02:12:58,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:12:58,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:12:58,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:12:58,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:12:58,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:12:56" (1/4) ... [2024-06-28 02:12:58,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce7676a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:12:58, skipping insertion in model container [2024-06-28 02:12:58,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:12:56" (2/4) ... [2024-06-28 02:12:58,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce7676a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:12:58, skipping insertion in model container [2024-06-28 02:12:58,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:57" (3/4) ... [2024-06-28 02:12:58,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce7676a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:12:58, skipping insertion in model container [2024-06-28 02:12:58,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:12:58" (4/4) ... [2024-06-28 02:12:58,748 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.opt.i [2024-06-28 02:12:58,762 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:12:58,762 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-28 02:12:58,763 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:12:58,825 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 02:12:58,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 60 transitions, 136 flow [2024-06-28 02:12:58,913 INFO L124 PetriNetUnfolderBase]: 1/56 cut-off events. [2024-06-28 02:12:58,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:12:58,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 56 events. 1/56 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2024-06-28 02:12:58,916 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 60 transitions, 136 flow [2024-06-28 02:12:58,920 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 56 transitions, 124 flow [2024-06-28 02:12:58,930 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:12:58,943 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;@41829492, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:12:58,943 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-28 02:12:58,958 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:12:58,962 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-28 02:12:58,962 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:12:58,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:58,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:12:58,964 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:12:58,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:58,968 INFO L85 PathProgramCache]: Analyzing trace with hash 860904710, now seen corresponding path program 1 times [2024-06-28 02:12:58,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:58,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353253023] [2024-06-28 02:12:58,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:58,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:00,947 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 02:13:00,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:00,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353253023] [2024-06-28 02:13:00,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353253023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:00,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:00,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:13:00,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910598451] [2024-06-28 02:13:00,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:00,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:13:00,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:00,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:13:00,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:13:01,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2024-06-28 02:13:01,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 02:13:01,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:01,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2024-06-28 02:13:01,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:04,664 INFO L124 PetriNetUnfolderBase]: 18908/27057 cut-off events. [2024-06-28 02:13:04,665 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2024-06-28 02:13:04,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52542 conditions, 27057 events. 18908/27057 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 179637 event pairs, 13531 based on Foata normal form. 576/25326 useless extension candidates. Maximal degree in co-relation 52529. Up to 25227 conditions per place. [2024-06-28 02:13:04,843 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 58 selfloop transitions, 7 changer transitions 0/78 dead transitions. [2024-06-28 02:13:04,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 78 transitions, 307 flow [2024-06-28 02:13:04,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:13:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:13:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2024-06-28 02:13:04,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6722222222222223 [2024-06-28 02:13:04,855 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 124 flow. Second operand 3 states and 121 transitions. [2024-06-28 02:13:04,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 78 transitions, 307 flow [2024-06-28 02:13:04,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 300 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 02:13:04,863 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 171 flow [2024-06-28 02:13:04,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2024-06-28 02:13:04,868 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2024-06-28 02:13:04,869 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 171 flow [2024-06-28 02:13:04,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 02:13:04,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:04,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:04,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:13:04,869 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:13:04,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:04,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1978626529, now seen corresponding path program 1 times [2024-06-28 02:13:04,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:04,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142550170] [2024-06-28 02:13:04,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:04,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:07,224 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 02:13:07,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:07,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142550170] [2024-06-28 02:13:07,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142550170] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:07,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:07,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:13:07,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184218504] [2024-06-28 02:13:07,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:07,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:13:07,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:07,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:13:07,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:13:07,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 60 [2024-06-28 02:13:07,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:07,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:07,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 60 [2024-06-28 02:13:07,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:12,591 INFO L124 PetriNetUnfolderBase]: 30488/43172 cut-off events. [2024-06-28 02:13:12,591 INFO L125 PetriNetUnfolderBase]: For 6250/6264 co-relation queries the response was YES. [2024-06-28 02:13:12,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94707 conditions, 43172 events. 30488/43172 cut-off events. For 6250/6264 co-relation queries the response was YES. Maximal size of possible extension queue 1708. Compared 289709 event pairs, 17050 based on Foata normal form. 9/40660 useless extension candidates. Maximal degree in co-relation 94695. Up to 40283 conditions per place. [2024-06-28 02:13:12,891 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 84 selfloop transitions, 13 changer transitions 0/108 dead transitions. [2024-06-28 02:13:12,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 108 transitions, 494 flow [2024-06-28 02:13:12,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:13:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:13:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2024-06-28 02:13:12,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-06-28 02:13:12,897 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 171 flow. Second operand 4 states and 155 transitions. [2024-06-28 02:13:12,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 108 transitions, 494 flow [2024-06-28 02:13:12,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 482 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:13:12,904 INFO L231 Difference]: Finished difference. Result has 71 places, 73 transitions, 276 flow [2024-06-28 02:13:12,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=276, PETRI_PLACES=71, PETRI_TRANSITIONS=73} [2024-06-28 02:13:12,909 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2024-06-28 02:13:12,910 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 73 transitions, 276 flow [2024-06-28 02:13:12,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:12,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:12,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:12,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:13:12,910 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:13:12,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:12,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1210371424, now seen corresponding path program 1 times [2024-06-28 02:13:12,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:12,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330476952] [2024-06-28 02:13:12,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:12,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:15,410 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 02:13:15,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:15,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330476952] [2024-06-28 02:13:15,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330476952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:15,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:15,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:13:15,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967560964] [2024-06-28 02:13:15,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:15,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:13:15,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:15,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:13:15,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:13:15,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 60 [2024-06-28 02:13:15,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 73 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 02:13:15,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:15,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 60 [2024-06-28 02:13:15,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:20,587 INFO L124 PetriNetUnfolderBase]: 30468/43144 cut-off events. [2024-06-28 02:13:20,588 INFO L125 PetriNetUnfolderBase]: For 16820/16872 co-relation queries the response was YES. [2024-06-28 02:13:20,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105264 conditions, 43144 events. 30468/43144 cut-off events. For 16820/16872 co-relation queries the response was YES. Maximal size of possible extension queue 1708. Compared 290071 event pairs, 14176 based on Foata normal form. 27/40654 useless extension candidates. Maximal degree in co-relation 105249. Up to 40185 conditions per place. [2024-06-28 02:13:20,832 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 97 selfloop transitions, 18 changer transitions 0/126 dead transitions. [2024-06-28 02:13:20,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 126 transitions, 642 flow [2024-06-28 02:13:20,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:13:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:13:20,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2024-06-28 02:13:20,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2024-06-28 02:13:20,834 INFO L175 Difference]: Start difference. First operand has 71 places, 73 transitions, 276 flow. Second operand 5 states and 188 transitions. [2024-06-28 02:13:20,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 126 transitions, 642 flow [2024-06-28 02:13:20,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 126 transitions, 634 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-28 02:13:20,843 INFO L231 Difference]: Finished difference. Result has 75 places, 77 transitions, 348 flow [2024-06-28 02:13:20,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=348, PETRI_PLACES=75, PETRI_TRANSITIONS=77} [2024-06-28 02:13:20,844 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2024-06-28 02:13:20,845 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 348 flow [2024-06-28 02:13:20,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 02:13:20,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:20,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:20,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:13:20,846 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:13:20,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:20,846 INFO L85 PathProgramCache]: Analyzing trace with hash 352357849, now seen corresponding path program 1 times [2024-06-28 02:13:20,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:20,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090845001] [2024-06-28 02:13:20,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:20,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:23,080 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 02:13:23,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:23,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090845001] [2024-06-28 02:13:23,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090845001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:23,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:23,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:13:23,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974892899] [2024-06-28 02:13:23,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:23,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:13:23,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:23,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:13:23,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:13:23,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2024-06-28 02:13:23,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 348 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 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 02:13:23,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:23,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2024-06-28 02:13:23,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:28,458 INFO L124 PetriNetUnfolderBase]: 28139/39930 cut-off events. [2024-06-28 02:13:28,458 INFO L125 PetriNetUnfolderBase]: For 28801/28803 co-relation queries the response was YES. [2024-06-28 02:13:28,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105336 conditions, 39930 events. 28139/39930 cut-off events. For 28801/28803 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 267476 event pairs, 15488 based on Foata normal form. 5/37801 useless extension candidates. Maximal degree in co-relation 105317. Up to 37256 conditions per place. [2024-06-28 02:13:28,676 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 96 selfloop transitions, 15 changer transitions 0/121 dead transitions. [2024-06-28 02:13:28,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 121 transitions, 723 flow [2024-06-28 02:13:28,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:13:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:13:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-06-28 02:13:28,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2024-06-28 02:13:28,677 INFO L175 Difference]: Start difference. First operand has 75 places, 77 transitions, 348 flow. Second operand 5 states and 158 transitions. [2024-06-28 02:13:28,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 121 transitions, 723 flow [2024-06-28 02:13:28,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 121 transitions, 667 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-28 02:13:28,686 INFO L231 Difference]: Finished difference. Result has 78 places, 90 transitions, 445 flow [2024-06-28 02:13:28,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=78, PETRI_TRANSITIONS=90} [2024-06-28 02:13:28,687 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2024-06-28 02:13:28,687 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 90 transitions, 445 flow [2024-06-28 02:13:28,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 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 02:13:28,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:28,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:28,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:13:28,689 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:13:28,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:28,689 INFO L85 PathProgramCache]: Analyzing trace with hash -863958402, now seen corresponding path program 1 times [2024-06-28 02:13:28,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:28,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818289295] [2024-06-28 02:13:28,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:28,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:31,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:31,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818289295] [2024-06-28 02:13:31,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818289295] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:31,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:31,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:13:31,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228093277] [2024-06-28 02:13:31,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:31,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:13:31,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:31,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:13:31,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:13:31,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2024-06-28 02:13:31,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 90 transitions, 445 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 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 02:13:31,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:31,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2024-06-28 02:13:31,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:38,418 INFO L124 PetriNetUnfolderBase]: 36174/50828 cut-off events. [2024-06-28 02:13:38,418 INFO L125 PetriNetUnfolderBase]: For 57471/57702 co-relation queries the response was YES. [2024-06-28 02:13:38,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147062 conditions, 50828 events. 36174/50828 cut-off events. For 57471/57702 co-relation queries the response was YES. Maximal size of possible extension queue 1930. Compared 340309 event pairs, 16291 based on Foata normal form. 86/46997 useless extension candidates. Maximal degree in co-relation 147040. Up to 47199 conditions per place. [2024-06-28 02:13:38,734 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 103 selfloop transitions, 38 changer transitions 0/153 dead transitions. [2024-06-28 02:13:38,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 153 transitions, 957 flow [2024-06-28 02:13:38,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:13:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:13:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2024-06-28 02:13:38,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5611111111111111 [2024-06-28 02:13:38,736 INFO L175 Difference]: Start difference. First operand has 78 places, 90 transitions, 445 flow. Second operand 6 states and 202 transitions. [2024-06-28 02:13:38,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 153 transitions, 957 flow [2024-06-28 02:13:38,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 153 transitions, 941 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-28 02:13:38,768 INFO L231 Difference]: Finished difference. Result has 83 places, 102 transitions, 618 flow [2024-06-28 02:13:38,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=618, PETRI_PLACES=83, PETRI_TRANSITIONS=102} [2024-06-28 02:13:38,772 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 15 predicate places. [2024-06-28 02:13:38,772 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 102 transitions, 618 flow [2024-06-28 02:13:38,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 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 02:13:38,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:38,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:38,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 02:13:38,773 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 02:13:38,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:38,773 INFO L85 PathProgramCache]: Analyzing trace with hash -227322212, now seen corresponding path program 2 times [2024-06-28 02:13:38,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:38,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935121253] [2024-06-28 02:13:38,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:38,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:40,754 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 02:13:40,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:40,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935121253] [2024-06-28 02:13:40,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935121253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:40,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:40,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:13:40,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909773817] [2024-06-28 02:13:40,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:40,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:13:40,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:40,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:13:40,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:13:40,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2024-06-28 02:13:40,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 102 transitions, 618 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 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 02:13:40,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:40,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2024-06-28 02:13:40,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand