./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix008_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/mix008_tso.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix008_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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 02:56:23,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:56:23,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:56:23,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:56:23,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:56:23,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:56:23,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:56:23,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:56:23,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:56:23,653 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:56:23,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:56:23,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:56:23,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:56:23,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:56:23,656 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:56:23,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:56:23,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:56:23,656 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:56:23,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:56:23,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:56:23,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:56:23,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:56:23,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:56:23,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:56:23,657 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:56:23,657 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:56:23,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:56:23,658 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:56:23,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:56:23,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:56:23,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:56:23,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:56:23,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:56:23,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:56:23,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:56:23,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:56:23,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:56:23,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:56:23,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:56:23,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:56:23,660 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:56:23,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:56:23,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:56:23,661 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-28 02:56:23,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:56:23,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:56:23,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:56:23,888 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:56:23,900 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:56:23,901 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/mix008_tso.oepc.yml/witness.yml [2024-06-28 02:56:24,146 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:56:24,146 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:56:24,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i [2024-06-28 02:56:25,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:56:25,354 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:56:25,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i [2024-06-28 02:56:25,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe617e0bf/02293a76c6b04af2a716271a6f2d537b/FLAGe1621e6c8 [2024-06-28 02:56:25,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe617e0bf/02293a76c6b04af2a716271a6f2d537b [2024-06-28 02:56:25,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:56:25,392 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:56:25,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:56:25,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:56:25,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:56:25,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:56:24" (1/2) ... [2024-06-28 02:56:25,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@110d6b3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:56:25, skipping insertion in model container [2024-06-28 02:56:25,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:56:24" (1/2) ... [2024-06-28 02:56:25,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3416d18 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:56:25, skipping insertion in model container [2024-06-28 02:56:25,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:56:25" (2/2) ... [2024-06-28 02:56:25,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@110d6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:56:25, skipping insertion in model container [2024-06-28 02:56:25,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:56:25" (2/2) ... [2024-06-28 02:56:25,402 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:56:25,533 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:56:25,534 INFO L97 edCorrectnessWitness]: Location invariant before [L930-L930] (((((((((((((((((((((((((((((((((((! multithreaded || z$r_buff1_thd2 == (_Bool)0) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 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_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (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)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1)) [2024-06-28 02:56:25,534 INFO L97 edCorrectnessWitness]: Location invariant before [L926-L926] (((((((((((((((((((((((((((((((((((! multithreaded || z$r_buff1_thd2 == (_Bool)0) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 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_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (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)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1)) [2024-06-28 02:56:25,534 INFO L97 edCorrectnessWitness]: Location invariant before [L928-L928] (((((((((((((((((((((((((((((((((((! multithreaded || z$r_buff1_thd2 == (_Bool)0) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 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_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (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)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1)) [2024-06-28 02:56:25,534 INFO L97 edCorrectnessWitness]: Location invariant before [L931-L931] (((((((((((((((((((((((((((((((((((! multithreaded || z$r_buff1_thd2 == (_Bool)0) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 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_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (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)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1)) [2024-06-28 02:56:25,535 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:56:25,535 INFO L106 edCorrectnessWitness]: ghost_update [L924-L924] multithreaded = 1; [2024-06-28 02:56:25,578 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:56:25,937 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:56:25,947 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:56:26,097 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:56:26,124 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:56:26,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:56:26 WrapperNode [2024-06-28 02:56:26,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:56:26,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:56:26,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:56:26,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:56:26,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:56:26" (1/1) ... [2024-06-28 02:56:26,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:56:26" (1/1) ... [2024-06-28 02:56:26,199 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 286 [2024-06-28 02:56:26,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:56:26,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:56:26,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:56:26,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:56:26,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:56:26" (1/1) ... [2024-06-28 02:56:26,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:56:26" (1/1) ... [2024-06-28 02:56:26,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:56:26" (1/1) ... [2024-06-28 02:56:26,225 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 02:56:26,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:56:26" (1/1) ... [2024-06-28 02:56:26,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:56:26" (1/1) ... [2024-06-28 02:56:26,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:56:26" (1/1) ... [2024-06-28 02:56:26,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:56:26" (1/1) ... [2024-06-28 02:56:26,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:56:26" (1/1) ... [2024-06-28 02:56:26,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:56:26" (1/1) ... [2024-06-28 02:56:26,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:56:26,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:56:26,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:56:26,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:56:26,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:56:26" (1/1) ... [2024-06-28 02:56:26,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:56:26,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:56:26,291 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:56:26,298 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:56:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 02:56:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:56:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 02:56:26,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 02:56:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 02:56:26,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 02:56:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 02:56:26,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 02:56:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 02:56:26,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 02:56:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:56:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 02:56:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:56:26,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:56:26,323 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:56:26,476 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:56:26,477 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:56:26,994 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:56:26,994 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:56:27,184 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:56:27,184 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 02:56:27,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:56:27 BoogieIcfgContainer [2024-06-28 02:56:27,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:56:27,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:56:27,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:56:27,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:56:27,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:56:24" (1/4) ... [2024-06-28 02:56:27,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164cb761 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:56:27, skipping insertion in model container [2024-06-28 02:56:27,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:56:25" (2/4) ... [2024-06-28 02:56:27,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164cb761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:56:27, skipping insertion in model container [2024-06-28 02:56:27,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:56:26" (3/4) ... [2024-06-28 02:56:27,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164cb761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:56:27, skipping insertion in model container [2024-06-28 02:56:27,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:56:27" (4/4) ... [2024-06-28 02:56:27,190 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_tso.oepc.i [2024-06-28 02:56:27,203 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:56:27,203 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-28 02:56:27,204 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:56:27,245 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 02:56:27,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 53 transitions, 122 flow [2024-06-28 02:56:27,289 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2024-06-28 02:56:27,289 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:56:27,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 0/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-28 02:56:27,291 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 53 transitions, 122 flow [2024-06-28 02:56:27,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 43 transitions, 98 flow [2024-06-28 02:56:27,327 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:56:27,332 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;@7596b434, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:56:27,333 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-28 02:56:27,336 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:56:27,336 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 02:56:27,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:56:27,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:56:27,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:56:27,337 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 02:56:27,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:56:27,356 INFO L85 PathProgramCache]: Analyzing trace with hash 613012031, now seen corresponding path program 1 times [2024-06-28 02:56:27,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:56:27,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488368927] [2024-06-28 02:56:27,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:56:27,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:56:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:56:29,090 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:56:29,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:56:29,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488368927] [2024-06-28 02:56:29,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488368927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:56:29,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:56:29,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:56:29,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498955211] [2024-06-28 02:56:29,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:56:29,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:56:29,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:56:29,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:56:29,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:56:29,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-28 02:56:29,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:56:29,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:56:29,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-28 02:56:29,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:56:31,364 INFO L124 PetriNetUnfolderBase]: 13599/18732 cut-off events. [2024-06-28 02:56:31,364 INFO L125 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2024-06-28 02:56:31,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37586 conditions, 18732 events. 13599/18732 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 103397 event pairs, 10515 based on Foata normal form. 1/18248 useless extension candidates. Maximal degree in co-relation 37573. Up to 18345 conditions per place. [2024-06-28 02:56:31,462 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 45 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2024-06-28 02:56:31,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 235 flow [2024-06-28 02:56:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:56:31,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:56:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-06-28 02:56:31,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5849056603773585 [2024-06-28 02:56:31,472 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 98 flow. Second operand 3 states and 93 transitions. [2024-06-28 02:56:31,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 235 flow [2024-06-28 02:56:31,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 228 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 02:56:31,477 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 133 flow [2024-06-28 02:56:31,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-06-28 02:56:31,480 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-06-28 02:56:31,480 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 133 flow [2024-06-28 02:56:31,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:56:31,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:56:31,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:56:31,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:56:31,481 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 02:56:31,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:56:31,482 INFO L85 PathProgramCache]: Analyzing trace with hash 694086558, now seen corresponding path program 1 times [2024-06-28 02:56:31,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:56:31,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172091126] [2024-06-28 02:56:31,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:56:31,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:56:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:56:32,802 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:56:32,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:56:32,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172091126] [2024-06-28 02:56:32,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172091126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:56:32,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:56:32,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 02:56:32,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3459255] [2024-06-28 02:56:32,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:56:32,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:56:32,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:56:32,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:56:32,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:56:32,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-28 02:56:32,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:56:32,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:56:32,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-28 02:56:32,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:56:34,958 INFO L124 PetriNetUnfolderBase]: 15578/20977 cut-off events. [2024-06-28 02:56:34,958 INFO L125 PetriNetUnfolderBase]: For 3977/3977 co-relation queries the response was YES. [2024-06-28 02:56:34,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47505 conditions, 20977 events. 15578/20977 cut-off events. For 3977/3977 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 111485 event pairs, 10885 based on Foata normal form. 4/20979 useless extension candidates. Maximal degree in co-relation 47493. Up to 20929 conditions per place. [2024-06-28 02:56:35,050 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 56 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2024-06-28 02:56:35,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 329 flow [2024-06-28 02:56:35,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:56:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:56:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-06-28 02:56:35,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5518867924528302 [2024-06-28 02:56:35,052 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 133 flow. Second operand 4 states and 117 transitions. [2024-06-28 02:56:35,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 329 flow [2024-06-28 02:56:35,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:56:35,056 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 181 flow [2024-06-28 02:56:35,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-06-28 02:56:35,057 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2024-06-28 02:56:35,057 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 181 flow [2024-06-28 02:56:35,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:56:35,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:56:35,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:56:35,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:56:35,058 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 02:56:35,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:56:35,059 INFO L85 PathProgramCache]: Analyzing trace with hash 41848264, now seen corresponding path program 1 times [2024-06-28 02:56:35,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:56:35,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737547148] [2024-06-28 02:56:35,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:56:35,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:56:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:56:36,420 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:56:36,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:56:36,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737547148] [2024-06-28 02:56:36,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737547148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:56:36,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:56:36,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:56:36,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519535033] [2024-06-28 02:56:36,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:56:36,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:56:36,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:56:36,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:56:36,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:56:36,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-28 02:56:36,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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:56:36,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:56:36,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-28 02:56:36,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:56:38,823 INFO L124 PetriNetUnfolderBase]: 15596/21015 cut-off events. [2024-06-28 02:56:38,823 INFO L125 PetriNetUnfolderBase]: For 11411/11411 co-relation queries the response was YES. [2024-06-28 02:56:38,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52629 conditions, 21015 events. 15596/21015 cut-off events. For 11411/11411 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 111875 event pairs, 8781 based on Foata normal form. 7/21020 useless extension candidates. Maximal degree in co-relation 52615. Up to 20850 conditions per place. [2024-06-28 02:56:38,912 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 74 selfloop transitions, 21 changer transitions 0/101 dead transitions. [2024-06-28 02:56:38,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 101 transitions, 545 flow [2024-06-28 02:56:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:56:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:56:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-06-28 02:56:38,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5773584905660377 [2024-06-28 02:56:38,917 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 181 flow. Second operand 5 states and 153 transitions. [2024-06-28 02:56:38,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 101 transitions, 545 flow [2024-06-28 02:56:38,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 526 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-28 02:56:38,922 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 312 flow [2024-06-28 02:56:38,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2024-06-28 02:56:38,923 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2024-06-28 02:56:38,923 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 312 flow [2024-06-28 02:56:38,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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:56:38,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:56:38,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:56:38,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:56:38,925 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 02:56:38,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:56:38,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1020452069, now seen corresponding path program 1 times [2024-06-28 02:56:38,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:56:38,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063413873] [2024-06-28 02:56:38,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:56:38,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:56:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:56:40,668 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:56:40,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:56:40,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063413873] [2024-06-28 02:56:40,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063413873] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:56:40,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:56:40,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:56:40,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296173977] [2024-06-28 02:56:40,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:56:40,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:56:40,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:56:40,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:56:40,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:56:40,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-28 02:56:40,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:56:40,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:56:40,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-28 02:56:40,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:56:43,141 INFO L124 PetriNetUnfolderBase]: 15625/21058 cut-off events. [2024-06-28 02:56:43,141 INFO L125 PetriNetUnfolderBase]: For 27158/27162 co-relation queries the response was YES. [2024-06-28 02:56:43,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60975 conditions, 21058 events. 15625/21058 cut-off events. For 27158/27162 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 112403 event pairs, 7330 based on Foata normal form. 18/21074 useless extension candidates. Maximal degree in co-relation 60958. Up to 20815 conditions per place. [2024-06-28 02:56:43,227 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 81 selfloop transitions, 25 changer transitions 0/112 dead transitions. [2024-06-28 02:56:43,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 112 transitions, 690 flow [2024-06-28 02:56:43,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:56:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:56:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2024-06-28 02:56:43,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5534591194968553 [2024-06-28 02:56:43,230 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 312 flow. Second operand 6 states and 176 transitions. [2024-06-28 02:56:43,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 112 transitions, 690 flow [2024-06-28 02:56:43,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 112 transitions, 678 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-28 02:56:43,239 INFO L231 Difference]: Finished difference. Result has 68 places, 68 transitions, 389 flow [2024-06-28 02:56:43,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=389, PETRI_PLACES=68, PETRI_TRANSITIONS=68} [2024-06-28 02:56:43,241 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2024-06-28 02:56:43,241 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 389 flow [2024-06-28 02:56:43,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:56:43,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:56:43,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:56:43,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:56:43,242 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 02:56:43,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:56:43,242 INFO L85 PathProgramCache]: Analyzing trace with hash 898557513, now seen corresponding path program 1 times [2024-06-28 02:56:43,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:56:43,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725119449] [2024-06-28 02:56:43,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:56:43,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:56:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:56:44,745 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:56:44,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:56:44,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725119449] [2024-06-28 02:56:44,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725119449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:56:44,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:56:44,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:56:44,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074030833] [2024-06-28 02:56:44,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:56:44,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:56:44,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:56:44,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:56:44,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:56:44,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-28 02:56:44,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 389 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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:56:44,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:56:44,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-28 02:56:44,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:56:47,478 INFO L124 PetriNetUnfolderBase]: 13627/18797 cut-off events. [2024-06-28 02:56:47,478 INFO L125 PetriNetUnfolderBase]: For 35019/35019 co-relation queries the response was YES. [2024-06-28 02:56:47,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58560 conditions, 18797 events. 13627/18797 cut-off events. For 35019/35019 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 104364 event pairs, 7453 based on Foata normal form. 3/18568 useless extension candidates. Maximal degree in co-relation 58539. Up to 18372 conditions per place. [2024-06-28 02:56:47,559 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 69 selfloop transitions, 10 changer transitions 0/85 dead transitions. [2024-06-28 02:56:47,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 591 flow [2024-06-28 02:56:47,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:56:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:56:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-06-28 02:56:47,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4490566037735849 [2024-06-28 02:56:47,562 INFO L175 Difference]: Start difference. First operand has 68 places, 68 transitions, 389 flow. Second operand 5 states and 119 transitions. [2024-06-28 02:56:47,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 591 flow [2024-06-28 02:56:47,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 522 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-28 02:56:47,571 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 351 flow [2024-06-28 02:56:47,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=351, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2024-06-28 02:56:47,577 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2024-06-28 02:56:47,578 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 351 flow [2024-06-28 02:56:47,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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:56:47,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:56:47,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:56:47,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 02:56:47,578 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 02:56:47,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:56:47,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2060542119, now seen corresponding path program 1 times [2024-06-28 02:56:47,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:56:47,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111858806] [2024-06-28 02:56:47,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:56:47,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:56:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:56:49,212 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:56:49,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:56:49,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111858806] [2024-06-28 02:56:49,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111858806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:56:49,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:56:49,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:56:49,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23425252] [2024-06-28 02:56:49,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:56:49,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:56:49,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:56:49,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:56:49,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:56:49,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-28 02:56:49,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 351 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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:56:49,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:56:49,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-28 02:56:49,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:56:52,030 INFO L124 PetriNetUnfolderBase]: 13609/18763 cut-off events. [2024-06-28 02:56:52,030 INFO L125 PetriNetUnfolderBase]: For 41020/41020 co-relation queries the response was YES. [2024-06-28 02:56:52,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59582 conditions, 18763 events. 13609/18763 cut-off events. For 41020/41020 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 103668 event pairs, 7129 based on Foata normal form. 6/18529 useless extension candidates. Maximal degree in co-relation 59559. Up to 18318 conditions per place. [2024-06-28 02:56:52,136 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 77 selfloop transitions, 14 changer transitions 0/97 dead transitions. [2024-06-28 02:56:52,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 97 transitions, 625 flow [2024-06-28 02:56:52,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:56:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:56:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-06-28 02:56:52,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44654088050314467 [2024-06-28 02:56:52,137 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 351 flow. Second operand 6 states and 142 transitions. [2024-06-28 02:56:52,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 97 transitions, 625 flow [2024-06-28 02:56:52,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 97 transitions, 596 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-28 02:56:52,148 INFO L231 Difference]: Finished difference. Result has 71 places, 72 transitions, 397 flow [2024-06-28 02:56:52,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=397, PETRI_PLACES=71, PETRI_TRANSITIONS=72} [2024-06-28 02:56:52,148 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 15 predicate places. [2024-06-28 02:56:52,149 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 72 transitions, 397 flow [2024-06-28 02:56:52,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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:56:52,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:56:52,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:56:52,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 02:56:52,149 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 02:56:52,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:56:52,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1421125174, now seen corresponding path program 1 times [2024-06-28 02:56:52,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:56:52,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083086482] [2024-06-28 02:56:52,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:56:52,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:56:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:56:53,698 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:56:53,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:56:53,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083086482] [2024-06-28 02:56:53,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083086482] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:56:53,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:56:53,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:56:53,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358017740] [2024-06-28 02:56:53,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:56:53,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:56:53,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:56:53,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:56:53,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:56:53,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 53 [2024-06-28 02:56:53,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 72 transitions, 397 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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:56:53,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:56:53,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 53 [2024-06-28 02:56:53,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:56:56,588 INFO L124 PetriNetUnfolderBase]: 15611/21040 cut-off events. [2024-06-28 02:56:56,588 INFO L125 PetriNetUnfolderBase]: For 64526/64534 co-relation queries the response was YES. [2024-06-28 02:56:56,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72145 conditions, 21040 events. 15611/21040 cut-off events. For 64526/64534 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 111825 event pairs, 8453 based on Foata normal form. 14/21052 useless extension candidates. Maximal degree in co-relation 72122. Up to 20869 conditions per place. [2024-06-28 02:56:56,724 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 76 selfloop transitions, 25 changer transitions 0/106 dead transitions. [2024-06-28 02:56:56,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 106 transitions, 742 flow [2024-06-28 02:56:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:56:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:56:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-06-28 02:56:56,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591194968553459 [2024-06-28 02:56:56,726 INFO L175 Difference]: Start difference. First operand has 71 places, 72 transitions, 397 flow. Second operand 6 states and 146 transitions. [2024-06-28 02:56:56,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 106 transitions, 742 flow [2024-06-28 02:56:56,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 106 transitions, 699 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 02:56:56,747 INFO L231 Difference]: Finished difference. Result has 73 places, 76 transitions, 450 flow [2024-06-28 02:56:56,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=450, PETRI_PLACES=73, PETRI_TRANSITIONS=76} [2024-06-28 02:56:56,748 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 17 predicate places. [2024-06-28 02:56:56,748 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 76 transitions, 450 flow [2024-06-28 02:56:56,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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:56:56,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:56:56,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:56:56,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 02:56:56,749 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 02:56:56,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:56:56,749 INFO L85 PathProgramCache]: Analyzing trace with hash 225365736, now seen corresponding path program 2 times [2024-06-28 02:56:56,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:56:56,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691104285] [2024-06-28 02:56:56,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:56:56,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:56:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:56:58,285 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:56:58,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:56:58,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691104285] [2024-06-28 02:56:58,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691104285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:56:58,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:56:58,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:56:58,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680174420] [2024-06-28 02:56:58,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:56:58,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:56:58,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:56:58,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:56:58,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:56:58,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 53 [2024-06-28 02:56:58,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 76 transitions, 450 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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:56:58,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:56:58,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 53 [2024-06-28 02:56:58,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:57:01,280 INFO L124 PetriNetUnfolderBase]: 15587/20992 cut-off events. [2024-06-28 02:57:01,282 INFO L125 PetriNetUnfolderBase]: For 75546/75552 co-relation queries the response was YES. [2024-06-28 02:57:01,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73717 conditions, 20992 events. 15587/20992 cut-off events. For 75546/75552 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 111378 event pairs, 8473 based on Foata normal form. 4/20991 useless extension candidates. Maximal degree in co-relation 73693. Up to 20839 conditions per place. [2024-06-28 02:57:01,426 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 69 selfloop transitions, 26 changer transitions 0/100 dead transitions. [2024-06-28 02:57:01,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 100 transitions, 702 flow [2024-06-28 02:57:01,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:57:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:57:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-06-28 02:57:01,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44339622641509435 [2024-06-28 02:57:01,428 INFO L175 Difference]: Start difference. First operand has 73 places, 76 transitions, 450 flow. Second operand 6 states and 141 transitions. [2024-06-28 02:57:01,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 100 transitions, 702 flow [2024-06-28 02:57:01,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 100 transitions, 659 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-28 02:57:01,451 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 470 flow [2024-06-28 02:57:01,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=470, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2024-06-28 02:57:01,452 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 20 predicate places. [2024-06-28 02:57:01,452 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 470 flow [2024-06-28 02:57:01,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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:57:01,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:57:01,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:57:01,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 02:57:01,453 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 02:57:01,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:57:01,454 INFO L85 PathProgramCache]: Analyzing trace with hash 513682280, now seen corresponding path program 1 times [2024-06-28 02:57:01,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:57:01,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42627011] [2024-06-28 02:57:01,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:57:01,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:57:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat