./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 18:12:34,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 18:12:34,906 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 18:12:34,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 18:12:34,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 18:12:34,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 18:12:34,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 18:12:34,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 18:12:34,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 18:12:34,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 18:12:34,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 18:12:34,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 18:12:34,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 18:12:34,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 18:12:34,950 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 18:12:34,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 18:12:34,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 18:12:34,951 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 18:12:34,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 18:12:34,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 18:12:34,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 18:12:34,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 18:12:34,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 18:12:34,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 18:12:34,953 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 18:12:34,953 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 18:12:34,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 18:12:34,954 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 18:12:34,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 18:12:34,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 18:12:34,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 18:12:34,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 18:12:34,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 18:12:34,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 18:12:34,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 18:12:34,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 18:12:34,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 18:12:34,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 18:12:34,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 18:12:34,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 18:12:34,959 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 18:12:34,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 18:12:34,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 18:12:34,960 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-04 18:12:35,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 18:12:35,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 18:12:35,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 18:12:35,252 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 18:12:35,253 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 18:12:35,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-04 18:12:36,420 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 18:12:36,662 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 18:12:36,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-04 18:12:36,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/346fc74ec/f73ce57c33d04f18826fba291301629a/FLAGb5b7a5872 [2024-06-04 18:12:36,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/346fc74ec/f73ce57c33d04f18826fba291301629a [2024-06-04 18:12:36,692 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 18:12:36,692 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 18:12:36,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-04 18:12:36,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 18:12:36,869 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 18:12:36,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 18:12:36,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 18:12:36,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 18:12:36,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:12:36" (1/2) ... [2024-06-04 18:12:36,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@229ba98b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:36, skipping insertion in model container [2024-06-04 18:12:36,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:12:36" (1/2) ... [2024-06-04 18:12:36,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6a705bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:36, skipping insertion in model container [2024-06-04 18:12:36,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:12:36" (2/2) ... [2024-06-04 18:12:36,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@229ba98b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:36, skipping insertion in model container [2024-06-04 18:12:36,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:12:36" (2/2) ... [2024-06-04 18:12:36,879 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 18:12:36,959 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 18:12:36,961 INFO L97 edCorrectnessWitness]: Location invariant before [L806-L806] ((((((((((((((! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0) [2024-06-04 18:12:36,961 INFO L97 edCorrectnessWitness]: Location invariant before [L807-L807] ((((((((((((((! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0) [2024-06-04 18:12:36,962 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 18:12:36,962 INFO L106 edCorrectnessWitness]: ghost_update [L804-L804] multithreaded = 1; [2024-06-04 18:12:37,008 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 18:12:37,370 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 18:12:37,382 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 18:12:37,691 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 18:12:37,725 INFO L206 MainTranslator]: Completed translation [2024-06-04 18:12:37,726 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:37 WrapperNode [2024-06-04 18:12:37,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 18:12:37,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 18:12:37,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 18:12:37,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 18:12:37,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:37" (1/1) ... [2024-06-04 18:12:37,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:37" (1/1) ... [2024-06-04 18:12:37,864 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 112 [2024-06-04 18:12:37,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 18:12:37,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 18:12:37,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 18:12:37,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 18:12:37,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:37" (1/1) ... [2024-06-04 18:12:37,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:37" (1/1) ... [2024-06-04 18:12:37,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:37" (1/1) ... [2024-06-04 18:12:37,947 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-04 18:12:37,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:37" (1/1) ... [2024-06-04 18:12:37,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:37" (1/1) ... [2024-06-04 18:12:37,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:37" (1/1) ... [2024-06-04 18:12:37,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:37" (1/1) ... [2024-06-04 18:12:37,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:37" (1/1) ... [2024-06-04 18:12:37,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:37" (1/1) ... [2024-06-04 18:12:38,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 18:12:38,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 18:12:38,010 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 18:12:38,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 18:12:38,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:37" (1/1) ... [2024-06-04 18:12:38,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 18:12:38,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 18:12:38,046 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-04 18:12:38,052 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-04 18:12:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 18:12:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 18:12:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 18:12:38,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 18:12:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 18:12:38,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 18:12:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 18:12:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 18:12:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 18:12:38,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 18:12:38,093 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 18:12:38,196 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 18:12:38,198 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 18:12:39,003 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 18:12:39,003 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 18:12:39,207 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 18:12:39,208 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 18:12:39,209 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:12:39 BoogieIcfgContainer [2024-06-04 18:12:39,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 18:12:39,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 18:12:39,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 18:12:39,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 18:12:39,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 06:12:36" (1/4) ... [2024-06-04 18:12:39,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13335fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:12:39, skipping insertion in model container [2024-06-04 18:12:39,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:12:36" (2/4) ... [2024-06-04 18:12:39,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13335fc9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 06:12:39, skipping insertion in model container [2024-06-04 18:12:39,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:37" (3/4) ... [2024-06-04 18:12:39,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13335fc9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 06:12:39, skipping insertion in model container [2024-06-04 18:12:39,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:12:39" (4/4) ... [2024-06-04 18:12:39,225 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-04 18:12:39,241 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 18:12:39,242 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 18:12:39,242 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 18:12:39,328 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 18:12:39,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-04 18:12:39,408 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-04 18:12:39,408 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 18:12:39,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 18:12:39,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-04 18:12:39,413 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-04 18:12:39,434 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 18:12:39,442 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;@567f8bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 18:12:39,442 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 18:12:39,451 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 18:12:39,451 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 18:12:39,452 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 18:12:39,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:39,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 18:12:39,453 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:12:39,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:39,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1303796410, now seen corresponding path program 1 times [2024-06-04 18:12:39,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:39,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665898883] [2024-06-04 18:12:39,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:39,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:43,458 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-04 18:12:43,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:43,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665898883] [2024-06-04 18:12:43,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665898883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:43,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:43,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 18:12:43,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436458467] [2024-06-04 18:12:43,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:43,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 18:12:43,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:43,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 18:12:43,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 18:12:43,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-04 18:12:43,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-04 18:12:43,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:43,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-04 18:12:43,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:43,799 INFO L124 PetriNetUnfolderBase]: 131/254 cut-off events. [2024-06-04 18:12:43,799 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-04 18:12:43,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 254 events. 131/254 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 963 event pairs, 75 based on Foata normal form. 1/249 useless extension candidates. Maximal degree in co-relation 498. Up to 235 conditions per place. [2024-06-04 18:12:43,804 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 22 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-04 18:12:43,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 117 flow [2024-06-04 18:12:43,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 18:12:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 18:12:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-06-04 18:12:43,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2024-06-04 18:12:43,817 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 54 transitions. [2024-06-04 18:12:43,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 117 flow [2024-06-04 18:12:43,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 18:12:43,821 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-04 18:12:43,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-06-04 18:12:43,826 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-04 18:12:43,826 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-04 18:12:43,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-04 18:12:43,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:43,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:43,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 18:12:43,827 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:12:43,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:43,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1182063719, now seen corresponding path program 1 times [2024-06-04 18:12:43,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:43,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626615642] [2024-06-04 18:12:43,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:43,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:46,723 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-04 18:12:46,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:46,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626615642] [2024-06-04 18:12:46,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626615642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:46,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:46,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 18:12:46,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604955752] [2024-06-04 18:12:46,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:46,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 18:12:46,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:46,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 18:12:46,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 18:12:46,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-04 18:12:46,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-04 18:12:46,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:46,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-04 18:12:46,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:46,982 INFO L124 PetriNetUnfolderBase]: 128/249 cut-off events. [2024-06-04 18:12:46,983 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-06-04 18:12:46,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 249 events. 128/249 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 927 event pairs, 57 based on Foata normal form. 2/250 useless extension candidates. Maximal degree in co-relation 559. Up to 221 conditions per place. [2024-06-04 18:12:46,986 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 26 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-04 18:12:46,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 159 flow [2024-06-04 18:12:46,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 18:12:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 18:12:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2024-06-04 18:12:46,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5564516129032258 [2024-06-04 18:12:46,988 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 69 transitions. [2024-06-04 18:12:46,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 159 flow [2024-06-04 18:12:46,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 18:12:46,990 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-04 18:12:46,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-06-04 18:12:46,991 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-04 18:12:46,991 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-04 18:12:46,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-04 18:12:46,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:46,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:46,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 18:12:46,992 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:12:46,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:46,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2091829128, now seen corresponding path program 1 times [2024-06-04 18:12:46,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:46,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451232734] [2024-06-04 18:12:46,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:46,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:50,914 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-04 18:12:50,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:50,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451232734] [2024-06-04 18:12:50,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451232734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:50,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:50,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 18:12:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311824631] [2024-06-04 18:12:50,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:50,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 18:12:50,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:50,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 18:12:50,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 18:12:51,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-04 18:12:51,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-04 18:12:51,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:51,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-04 18:12:51,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:51,283 INFO L124 PetriNetUnfolderBase]: 125/244 cut-off events. [2024-06-04 18:12:51,283 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2024-06-04 18:12:51,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 244 events. 125/244 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 891 event pairs, 39 based on Foata normal form. 2/245 useless extension candidates. Maximal degree in co-relation 612. Up to 207 conditions per place. [2024-06-04 18:12:51,288 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 30 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2024-06-04 18:12:51,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 207 flow [2024-06-04 18:12:51,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 18:12:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 18:12:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2024-06-04 18:12:51,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5419354838709678 [2024-06-04 18:12:51,293 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 84 transitions. [2024-06-04 18:12:51,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 207 flow [2024-06-04 18:12:51,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 198 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 18:12:51,299 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 119 flow [2024-06-04 18:12:51,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-06-04 18:12:51,301 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-04 18:12:51,301 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 119 flow [2024-06-04 18:12:51,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-04 18:12:51,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:51,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:51,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 18:12:51,302 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:12:51,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:51,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1183318545, now seen corresponding path program 1 times [2024-06-04 18:12:51,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:51,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328981814] [2024-06-04 18:12:51,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:51,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:56,070 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-04 18:12:56,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:56,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328981814] [2024-06-04 18:12:56,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328981814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:56,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:56,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 18:12:56,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073542354] [2024-06-04 18:12:56,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:56,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 18:12:56,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:56,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 18:12:56,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 18:12:56,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:12:56,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:56,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:56,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:12:56,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:56,366 INFO L124 PetriNetUnfolderBase]: 123/241 cut-off events. [2024-06-04 18:12:56,367 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2024-06-04 18:12:56,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 241 events. 123/241 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 875 event pairs, 38 based on Foata normal form. 1/241 useless extension candidates. Maximal degree in co-relation 669. Up to 219 conditions per place. [2024-06-04 18:12:56,369 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 26 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2024-06-04 18:12:56,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 201 flow [2024-06-04 18:12:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 18:12:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 18:12:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2024-06-04 18:12:56,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44516129032258067 [2024-06-04 18:12:56,373 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 119 flow. Second operand 5 states and 69 transitions. [2024-06-04 18:12:56,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 201 flow [2024-06-04 18:12:56,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 186 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 18:12:56,377 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 131 flow [2024-06-04 18:12:56,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-04 18:12:56,378 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-04 18:12:56,378 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 131 flow [2024-06-04 18:12:56,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:56,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:56,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:56,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 18:12:56,379 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:12:56,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:56,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1987406221, now seen corresponding path program 1 times [2024-06-04 18:12:56,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:56,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069617643] [2024-06-04 18:12:56,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:56,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:12:59,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:59,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069617643] [2024-06-04 18:12:59,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069617643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:59,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:59,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 18:12:59,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284692805] [2024-06-04 18:12:59,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:59,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 18:12:59,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:59,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 18:12:59,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 18:12:59,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-04 18:12:59,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-04 18:12:59,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:59,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-04 18:12:59,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:59,815 INFO L124 PetriNetUnfolderBase]: 119/233 cut-off events. [2024-06-04 18:12:59,816 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2024-06-04 18:12:59,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 233 events. 119/233 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 827 event pairs, 19 based on Foata normal form. 4/236 useless extension candidates. Maximal degree in co-relation 678. Up to 178 conditions per place. [2024-06-04 18:12:59,818 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 32 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2024-06-04 18:12:59,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 237 flow [2024-06-04 18:12:59,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:12:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:12:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2024-06-04 18:12:59,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053763440860215 [2024-06-04 18:12:59,820 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 131 flow. Second operand 6 states and 94 transitions. [2024-06-04 18:12:59,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 237 flow [2024-06-04 18:12:59,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 226 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 18:12:59,822 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 132 flow [2024-06-04 18:12:59,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2024-06-04 18:12:59,823 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2024-06-04 18:12:59,826 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 132 flow [2024-06-04 18:12:59,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-04 18:12:59,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:59,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:59,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 18:12:59,833 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:12:59,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:59,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1971832074, now seen corresponding path program 1 times [2024-06-04 18:12:59,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:59,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166341460] [2024-06-04 18:12:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:59,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:03,950 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-04 18:13:03,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:03,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166341460] [2024-06-04 18:13:03,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166341460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:03,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:03,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:13:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154135510] [2024-06-04 18:13:03,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:03,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:13:03,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:03,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:13:03,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:13:04,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:13:04,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 132 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-04 18:13:04,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:04,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:13:04,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:04,273 INFO L124 PetriNetUnfolderBase]: 135/263 cut-off events. [2024-06-04 18:13:04,273 INFO L125 PetriNetUnfolderBase]: For 525/525 co-relation queries the response was YES. [2024-06-04 18:13:04,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 263 events. 135/263 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1016 event pairs, 35 based on Foata normal form. 3/263 useless extension candidates. Maximal degree in co-relation 795. Up to 195 conditions per place. [2024-06-04 18:13:04,276 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 29 selfloop transitions, 12 changer transitions 0/45 dead transitions. [2024-06-04 18:13:04,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 270 flow [2024-06-04 18:13:04,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:13:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:13:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2024-06-04 18:13:04,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2024-06-04 18:13:04,277 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 132 flow. Second operand 6 states and 86 transitions. [2024-06-04 18:13:04,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 270 flow [2024-06-04 18:13:04,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 250 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 18:13:04,280 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 180 flow [2024-06-04 18:13:04,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2024-06-04 18:13:04,281 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2024-06-04 18:13:04,281 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 180 flow [2024-06-04 18:13:04,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-04 18:13:04,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:04,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:04,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 18:13:04,282 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:13:04,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:04,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1065870266, now seen corresponding path program 1 times [2024-06-04 18:13:04,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:04,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913019246] [2024-06-04 18:13:04,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:04,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:08,197 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-04 18:13:08,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:08,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913019246] [2024-06-04 18:13:08,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913019246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:08,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:08,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:13:08,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023792200] [2024-06-04 18:13:08,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:08,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:13:08,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:08,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:13:08,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:13:08,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:13:08,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 180 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-04 18:13:08,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:08,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:13:08,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:08,514 INFO L124 PetriNetUnfolderBase]: 145/286 cut-off events. [2024-06-04 18:13:08,515 INFO L125 PetriNetUnfolderBase]: For 741/741 co-relation queries the response was YES. [2024-06-04 18:13:08,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 286 events. 145/286 cut-off events. For 741/741 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1124 event pairs, 37 based on Foata normal form. 2/287 useless extension candidates. Maximal degree in co-relation 980. Up to 241 conditions per place. [2024-06-04 18:13:08,517 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 37 selfloop transitions, 11 changer transitions 0/52 dead transitions. [2024-06-04 18:13:08,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 338 flow [2024-06-04 18:13:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:13:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:13:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-04 18:13:08,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4377880184331797 [2024-06-04 18:13:08,519 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 180 flow. Second operand 7 states and 95 transitions. [2024-06-04 18:13:08,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 338 flow [2024-06-04 18:13:08,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 324 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-04 18:13:08,522 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 235 flow [2024-06-04 18:13:08,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-06-04 18:13:08,523 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2024-06-04 18:13:08,523 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 235 flow [2024-06-04 18:13:08,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-04 18:13:08,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:08,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:08,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 18:13:08,524 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:13:08,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:08,524 INFO L85 PathProgramCache]: Analyzing trace with hash -222427366, now seen corresponding path program 2 times [2024-06-04 18:13:08,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:08,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615697759] [2024-06-04 18:13:08,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:08,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:12,077 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-04 18:13:12,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:12,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615697759] [2024-06-04 18:13:12,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615697759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:12,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:12,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:13:12,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614546420] [2024-06-04 18:13:12,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:12,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:13:12,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:12,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:13:12,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:13:12,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:13:12,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 235 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-04 18:13:12,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:12,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:13:12,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:12,373 INFO L124 PetriNetUnfolderBase]: 151/300 cut-off events. [2024-06-04 18:13:12,374 INFO L125 PetriNetUnfolderBase]: For 1038/1038 co-relation queries the response was YES. [2024-06-04 18:13:12,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 300 events. 151/300 cut-off events. For 1038/1038 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1221 event pairs, 34 based on Foata normal form. 2/301 useless extension candidates. Maximal degree in co-relation 1104. Up to 245 conditions per place. [2024-06-04 18:13:12,376 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 36 selfloop transitions, 12 changer transitions 0/52 dead transitions. [2024-06-04 18:13:12,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 376 flow [2024-06-04 18:13:12,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:13:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:13:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2024-06-04 18:13:12,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44623655913978494 [2024-06-04 18:13:12,382 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 235 flow. Second operand 6 states and 83 transitions. [2024-06-04 18:13:12,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 376 flow [2024-06-04 18:13:12,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 355 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 18:13:12,386 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 269 flow [2024-06-04 18:13:12,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-06-04 18:13:12,387 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2024-06-04 18:13:12,388 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 269 flow [2024-06-04 18:13:12,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-04 18:13:12,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:12,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:12,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 18:13:12,389 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:13:12,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash 997244558, now seen corresponding path program 3 times [2024-06-04 18:13:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:12,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957407493] [2024-06-04 18:13:12,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:12,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:16,081 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-04 18:13:16,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:16,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957407493] [2024-06-04 18:13:16,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957407493] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:16,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:16,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:13:16,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54474027] [2024-06-04 18:13:16,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:16,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:13:16,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:16,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:13:16,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:13:16,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:13:16,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 269 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-04 18:13:16,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:16,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:13:16,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:16,365 INFO L124 PetriNetUnfolderBase]: 141/282 cut-off events. [2024-06-04 18:13:16,366 INFO L125 PetriNetUnfolderBase]: For 1255/1255 co-relation queries the response was YES. [2024-06-04 18:13:16,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 282 events. 141/282 cut-off events. For 1255/1255 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1113 event pairs, 36 based on Foata normal form. 4/282 useless extension candidates. Maximal degree in co-relation 1056. Up to 195 conditions per place. [2024-06-04 18:13:16,369 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 31 selfloop transitions, 16 changer transitions 0/51 dead transitions. [2024-06-04 18:13:16,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 387 flow [2024-06-04 18:13:16,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:13:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:13:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-06-04 18:13:16,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45698924731182794 [2024-06-04 18:13:16,370 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 269 flow. Second operand 6 states and 85 transitions. [2024-06-04 18:13:16,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 387 flow [2024-06-04 18:13:16,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 357 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 18:13:16,374 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 278 flow [2024-06-04 18:13:16,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2024-06-04 18:13:16,375 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2024-06-04 18:13:16,375 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 278 flow [2024-06-04 18:13:16,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-04 18:13:16,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:16,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:16,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 18:13:16,376 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:13:16,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:16,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1274309786, now seen corresponding path program 1 times [2024-06-04 18:13:16,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:16,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644073846] [2024-06-04 18:13:16,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:16,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:20,700 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-04 18:13:20,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:20,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644073846] [2024-06-04 18:13:20,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644073846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:20,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:20,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:13:20,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736985819] [2024-06-04 18:13:20,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:20,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:13:20,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:20,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:13:20,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:13:20,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:13:20,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 278 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-04 18:13:20,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:20,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:13:20,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:21,043 INFO L124 PetriNetUnfolderBase]: 145/291 cut-off events. [2024-06-04 18:13:21,043 INFO L125 PetriNetUnfolderBase]: For 1149/1149 co-relation queries the response was YES. [2024-06-04 18:13:21,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 291 events. 145/291 cut-off events. For 1149/1149 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1164 event pairs, 32 based on Foata normal form. 3/290 useless extension candidates. Maximal degree in co-relation 1076. Up to 193 conditions per place. [2024-06-04 18:13:21,046 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 30 selfloop transitions, 22 changer transitions 0/56 dead transitions. [2024-06-04 18:13:21,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 428 flow [2024-06-04 18:13:21,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:13:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:13:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-04 18:13:21,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-04 18:13:21,047 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 278 flow. Second operand 7 states and 98 transitions. [2024-06-04 18:13:21,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 428 flow [2024-06-04 18:13:21,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 383 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 18:13:21,051 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 312 flow [2024-06-04 18:13:21,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-06-04 18:13:21,051 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2024-06-04 18:13:21,052 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 312 flow [2024-06-04 18:13:21,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-04 18:13:21,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:21,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:21,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 18:13:21,053 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:13:21,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:21,053 INFO L85 PathProgramCache]: Analyzing trace with hash 850088361, now seen corresponding path program 1 times [2024-06-04 18:13:21,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:21,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570050827] [2024-06-04 18:13:21,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:21,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:25,887 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-04 18:13:25,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:25,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570050827] [2024-06-04 18:13:25,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570050827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:25,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:25,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:13:25,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540055190] [2024-06-04 18:13:25,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:25,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:13:25,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:25,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:13:25,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:13:26,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:13:26,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 312 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-04 18:13:26,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:26,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:13:26,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:26,318 INFO L124 PetriNetUnfolderBase]: 162/328 cut-off events. [2024-06-04 18:13:26,318 INFO L125 PetriNetUnfolderBase]: For 1700/1700 co-relation queries the response was YES. [2024-06-04 18:13:26,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 328 events. 162/328 cut-off events. For 1700/1700 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1363 event pairs, 36 based on Foata normal form. 14/338 useless extension candidates. Maximal degree in co-relation 1242. Up to 178 conditions per place. [2024-06-04 18:13:26,321 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 30 selfloop transitions, 22 changer transitions 7/63 dead transitions. [2024-06-04 18:13:26,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 63 transitions, 488 flow [2024-06-04 18:13:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:13:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:13:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-04 18:13:26,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45564516129032256 [2024-06-04 18:13:26,322 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 312 flow. Second operand 8 states and 113 transitions. [2024-06-04 18:13:26,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 63 transitions, 488 flow [2024-06-04 18:13:26,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 437 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 18:13:26,326 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 309 flow [2024-06-04 18:13:26,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=309, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2024-06-04 18:13:26,327 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2024-06-04 18:13:26,327 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 309 flow [2024-06-04 18:13:26,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-04 18:13:26,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:26,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:26,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 18:13:26,328 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:13:26,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:26,329 INFO L85 PathProgramCache]: Analyzing trace with hash 94762925, now seen corresponding path program 1 times [2024-06-04 18:13:26,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:26,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337243573] [2024-06-04 18:13:26,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:26,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:30,362 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-04 18:13:30,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:30,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337243573] [2024-06-04 18:13:30,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337243573] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:30,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:30,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:13:30,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943503758] [2024-06-04 18:13:30,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:30,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:13:30,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:30,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:13:30,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:13:30,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:13:30,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 309 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-04 18:13:30,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:30,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:13:30,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:30,703 INFO L124 PetriNetUnfolderBase]: 148/307 cut-off events. [2024-06-04 18:13:30,703 INFO L125 PetriNetUnfolderBase]: For 1346/1346 co-relation queries the response was YES. [2024-06-04 18:13:30,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 307 events. 148/307 cut-off events. For 1346/1346 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1282 event pairs, 34 based on Foata normal form. 1/307 useless extension candidates. Maximal degree in co-relation 1212. Up to 249 conditions per place. [2024-06-04 18:13:30,705 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 44 selfloop transitions, 12 changer transitions 0/60 dead transitions. [2024-06-04 18:13:30,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 469 flow [2024-06-04 18:13:30,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:13:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:13:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-04 18:13:30,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423963133640553 [2024-06-04 18:13:30,707 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 309 flow. Second operand 7 states and 96 transitions. [2024-06-04 18:13:30,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 469 flow [2024-06-04 18:13:30,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 420 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 18:13:30,710 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 307 flow [2024-06-04 18:13:30,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=307, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-06-04 18:13:30,711 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2024-06-04 18:13:30,711 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 307 flow [2024-06-04 18:13:30,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-04 18:13:30,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:30,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:30,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 18:13:30,712 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:13:30,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:30,713 INFO L85 PathProgramCache]: Analyzing trace with hash 582629231, now seen corresponding path program 1 times [2024-06-04 18:13:30,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:30,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469366146] [2024-06-04 18:13:30,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:30,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:34,921 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-04 18:13:34,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:34,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469366146] [2024-06-04 18:13:34,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469366146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:34,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:34,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:13:34,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715852722] [2024-06-04 18:13:34,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:34,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:13:34,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:34,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:13:34,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:13:34,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:13:34,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 307 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:13:34,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:34,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:13:34,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:35,252 INFO L124 PetriNetUnfolderBase]: 154/317 cut-off events. [2024-06-04 18:13:35,252 INFO L125 PetriNetUnfolderBase]: For 1574/1574 co-relation queries the response was YES. [2024-06-04 18:13:35,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1278 conditions, 317 events. 154/317 cut-off events. For 1574/1574 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1317 event pairs, 36 based on Foata normal form. 2/315 useless extension candidates. Maximal degree in co-relation 1247. Up to 222 conditions per place. [2024-06-04 18:13:35,255 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 38 selfloop transitions, 18 changer transitions 0/60 dead transitions. [2024-06-04 18:13:35,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 475 flow [2024-06-04 18:13:35,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:13:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:13:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-04 18:13:35,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4470046082949309 [2024-06-04 18:13:35,258 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 307 flow. Second operand 7 states and 97 transitions. [2024-06-04 18:13:35,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 475 flow [2024-06-04 18:13:35,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 444 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-04 18:13:35,262 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 346 flow [2024-06-04 18:13:35,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=346, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-06-04 18:13:35,263 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2024-06-04 18:13:35,263 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 346 flow [2024-06-04 18:13:35,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:13:35,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:35,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:35,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 18:13:35,264 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:13:35,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:35,264 INFO L85 PathProgramCache]: Analyzing trace with hash 582925901, now seen corresponding path program 2 times [2024-06-04 18:13:35,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:35,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204610995] [2024-06-04 18:13:35,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:35,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:39,667 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-04 18:13:39,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:39,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204610995] [2024-06-04 18:13:39,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204610995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:39,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:39,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:13:39,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625089301] [2024-06-04 18:13:39,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:39,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:13:39,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:39,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:13:39,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:13:39,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:13:39,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 346 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:13:39,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:39,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:13:39,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:39,968 INFO L124 PetriNetUnfolderBase]: 152/314 cut-off events. [2024-06-04 18:13:39,969 INFO L125 PetriNetUnfolderBase]: For 1747/1747 co-relation queries the response was YES. [2024-06-04 18:13:39,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 314 events. 152/314 cut-off events. For 1747/1747 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1309 event pairs, 36 based on Foata normal form. 1/311 useless extension candidates. Maximal degree in co-relation 1305. Up to 207 conditions per place. [2024-06-04 18:13:39,971 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 37 selfloop transitions, 20 changer transitions 0/61 dead transitions. [2024-06-04 18:13:39,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 504 flow [2024-06-04 18:13:39,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:13:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:13:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-04 18:13:39,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423963133640553 [2024-06-04 18:13:39,973 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 346 flow. Second operand 7 states and 96 transitions. [2024-06-04 18:13:39,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 61 transitions, 504 flow [2024-06-04 18:13:39,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 456 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-04 18:13:39,977 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 363 flow [2024-06-04 18:13:39,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=363, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2024-06-04 18:13:39,978 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2024-06-04 18:13:39,978 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 363 flow [2024-06-04 18:13:39,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:13:39,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:39,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:39,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 18:13:39,979 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:13:39,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:39,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1310038016, now seen corresponding path program 1 times [2024-06-04 18:13:39,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:39,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166970832] [2024-06-04 18:13:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:39,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:43,515 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-04 18:13:43,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:43,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166970832] [2024-06-04 18:13:43,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166970832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:43,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:43,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:13:43,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599498942] [2024-06-04 18:13:43,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:43,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:13:43,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:43,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:13:43,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:13:43,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:13:43,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 363 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:13:43,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:43,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:13:43,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:43,838 INFO L124 PetriNetUnfolderBase]: 150/308 cut-off events. [2024-06-04 18:13:43,839 INFO L125 PetriNetUnfolderBase]: For 1906/1906 co-relation queries the response was YES. [2024-06-04 18:13:43,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 308 events. 150/308 cut-off events. For 1906/1906 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1288 event pairs, 37 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 1314. Up to 204 conditions per place. [2024-06-04 18:13:43,841 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 37 selfloop transitions, 21 changer transitions 1/63 dead transitions. [2024-06-04 18:13:43,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 63 transitions, 537 flow [2024-06-04 18:13:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:13:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:13:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2024-06-04 18:13:43,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2024-06-04 18:13:43,843 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 363 flow. Second operand 6 states and 86 transitions. [2024-06-04 18:13:43,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 63 transitions, 537 flow [2024-06-04 18:13:43,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 488 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 18:13:43,847 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 387 flow [2024-06-04 18:13:43,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2024-06-04 18:13:43,849 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2024-06-04 18:13:43,850 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 387 flow [2024-06-04 18:13:43,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:13:43,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:43,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:43,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 18:13:43,850 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:13:43,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:43,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1824675192, now seen corresponding path program 1 times [2024-06-04 18:13:43,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:43,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377802023] [2024-06-04 18:13:43,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:43,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:48,434 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-04 18:13:48,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:48,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377802023] [2024-06-04 18:13:48,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377802023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:48,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:48,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:13:48,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101140447] [2024-06-04 18:13:48,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:48,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:13:48,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:48,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:13:48,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:13:48,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:13:48,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 387 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:13:48,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:48,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:13:48,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:48,818 INFO L124 PetriNetUnfolderBase]: 154/321 cut-off events. [2024-06-04 18:13:48,818 INFO L125 PetriNetUnfolderBase]: For 2298/2298 co-relation queries the response was YES. [2024-06-04 18:13:48,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 321 events. 154/321 cut-off events. For 2298/2298 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1359 event pairs, 33 based on Foata normal form. 2/319 useless extension candidates. Maximal degree in co-relation 1392. Up to 242 conditions per place. [2024-06-04 18:13:48,821 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 48 selfloop transitions, 17 changer transitions 4/73 dead transitions. [2024-06-04 18:13:48,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 73 transitions, 641 flow [2024-06-04 18:13:48,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:13:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:13:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-04 18:13:48,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42338709677419356 [2024-06-04 18:13:48,823 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 387 flow. Second operand 8 states and 105 transitions. [2024-06-04 18:13:48,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 73 transitions, 641 flow [2024-06-04 18:13:48,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 73 transitions, 586 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 18:13:48,828 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 442 flow [2024-06-04 18:13:48,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=442, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2024-06-04 18:13:48,828 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2024-06-04 18:13:48,829 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 442 flow [2024-06-04 18:13:48,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:13:48,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:48,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:48,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 18:13:48,830 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:13:48,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:48,830 INFO L85 PathProgramCache]: Analyzing trace with hash -252074498, now seen corresponding path program 2 times [2024-06-04 18:13:48,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:48,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857882322] [2024-06-04 18:13:48,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:48,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:53,471 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-04 18:13:53,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:53,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857882322] [2024-06-04 18:13:53,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857882322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:53,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:53,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:13:53,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457393376] [2024-06-04 18:13:53,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:53,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:13:53,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:53,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:13:53,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:13:53,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:13:53,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 442 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:13:53,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:53,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:13:53,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:53,919 INFO L124 PetriNetUnfolderBase]: 165/348 cut-off events. [2024-06-04 18:13:53,919 INFO L125 PetriNetUnfolderBase]: For 3505/3505 co-relation queries the response was YES. [2024-06-04 18:13:53,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1537 conditions, 348 events. 165/348 cut-off events. For 3505/3505 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1523 event pairs, 39 based on Foata normal form. 14/358 useless extension candidates. Maximal degree in co-relation 1501. Up to 182 conditions per place. [2024-06-04 18:13:53,922 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 41 selfloop transitions, 25 changer transitions 6/76 dead transitions. [2024-06-04 18:13:53,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 76 transitions, 662 flow [2024-06-04 18:13:53,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:13:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:13:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-06-04 18:13:53,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44802867383512546 [2024-06-04 18:13:53,924 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 442 flow. Second operand 9 states and 125 transitions. [2024-06-04 18:13:53,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 76 transitions, 662 flow [2024-06-04 18:13:53,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 76 transitions, 620 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-06-04 18:13:53,929 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 464 flow [2024-06-04 18:13:53,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=464, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2024-06-04 18:13:53,930 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2024-06-04 18:13:53,930 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 464 flow [2024-06-04 18:13:53,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:13:53,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:53,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:53,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 18:13:53,931 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:13:53,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:53,932 INFO L85 PathProgramCache]: Analyzing trace with hash 891161544, now seen corresponding path program 3 times [2024-06-04 18:13:53,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:53,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470277137] [2024-06-04 18:13:53,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:53,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:13:58,120 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-04 18:13:58,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:13:58,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470277137] [2024-06-04 18:13:58,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470277137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:13:58,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:13:58,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:13:58,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676878061] [2024-06-04 18:13:58,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:13:58,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:13:58,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:13:58,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:13:58,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:13:58,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:13:58,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 464 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:13:58,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:13:58,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:13:58,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:13:58,484 INFO L124 PetriNetUnfolderBase]: 153/330 cut-off events. [2024-06-04 18:13:58,484 INFO L125 PetriNetUnfolderBase]: For 2213/2213 co-relation queries the response was YES. [2024-06-04 18:13:58,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 330 events. 153/330 cut-off events. For 2213/2213 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1412 event pairs, 34 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 1402. Up to 212 conditions per place. [2024-06-04 18:13:58,487 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 43 selfloop transitions, 22 changer transitions 2/71 dead transitions. [2024-06-04 18:13:58,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 71 transitions, 642 flow [2024-06-04 18:13:58,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:13:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:13:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-04 18:13:58,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-04 18:13:58,488 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 464 flow. Second operand 8 states and 104 transitions. [2024-06-04 18:13:58,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 71 transitions, 642 flow [2024-06-04 18:13:58,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 569 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-06-04 18:13:58,494 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 439 flow [2024-06-04 18:13:58,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=439, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2024-06-04 18:13:58,495 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2024-06-04 18:13:58,495 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 439 flow [2024-06-04 18:13:58,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:13:58,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:13:58,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:13:58,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 18:13:58,496 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:13:58,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:13:58,496 INFO L85 PathProgramCache]: Analyzing trace with hash 870037580, now seen corresponding path program 1 times [2024-06-04 18:13:58,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:13:58,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802261486] [2024-06-04 18:13:58,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:13:58,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:13:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:02,536 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-04 18:14:02,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:02,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802261486] [2024-06-04 18:14:02,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802261486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:02,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:02,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:14:02,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397365326] [2024-06-04 18:14:02,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:02,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:14:02,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:02,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:14:02,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:14:02,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:14:02,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 439 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-04 18:14:02,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:02,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:14:02,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:02,928 INFO L124 PetriNetUnfolderBase]: 157/340 cut-off events. [2024-06-04 18:14:02,929 INFO L125 PetriNetUnfolderBase]: For 2192/2192 co-relation queries the response was YES. [2024-06-04 18:14:02,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1444 conditions, 340 events. 157/340 cut-off events. For 2192/2192 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1481 event pairs, 19 based on Foata normal form. 2/341 useless extension candidates. Maximal degree in co-relation 1408. Up to 251 conditions per place. [2024-06-04 18:14:02,932 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 59 selfloop transitions, 12 changer transitions 0/75 dead transitions. [2024-06-04 18:14:02,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 75 transitions, 631 flow [2024-06-04 18:14:02,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:14:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:14:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-06-04 18:14:02,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4274193548387097 [2024-06-04 18:14:02,933 INFO L175 Difference]: Start difference. First operand has 74 places, 59 transitions, 439 flow. Second operand 8 states and 106 transitions. [2024-06-04 18:14:02,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 75 transitions, 631 flow [2024-06-04 18:14:02,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 576 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-04 18:14:02,939 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 424 flow [2024-06-04 18:14:02,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=424, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2024-06-04 18:14:02,940 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2024-06-04 18:14:02,940 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 60 transitions, 424 flow [2024-06-04 18:14:02,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-04 18:14:02,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:02,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:02,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 18:14:02,941 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:14:02,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:02,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1078969950, now seen corresponding path program 2 times [2024-06-04 18:14:02,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:02,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113756564] [2024-06-04 18:14:02,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:02,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:06,984 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-04 18:14:06,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:06,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113756564] [2024-06-04 18:14:06,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113756564] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:06,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:06,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:14:06,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478623549] [2024-06-04 18:14:06,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:06,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:14:06,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:06,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:14:06,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:14:07,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:14:07,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 60 transitions, 424 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-04 18:14:07,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:07,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:14:07,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:07,365 INFO L124 PetriNetUnfolderBase]: 161/348 cut-off events. [2024-06-04 18:14:07,365 INFO L125 PetriNetUnfolderBase]: For 2297/2297 co-relation queries the response was YES. [2024-06-04 18:14:07,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 348 events. 161/348 cut-off events. For 2297/2297 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1521 event pairs, 33 based on Foata normal form. 2/349 useless extension candidates. Maximal degree in co-relation 1409. Up to 276 conditions per place. [2024-06-04 18:14:07,368 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 58 selfloop transitions, 13 changer transitions 0/75 dead transitions. [2024-06-04 18:14:07,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 75 transitions, 616 flow [2024-06-04 18:14:07,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:14:07,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:14:07,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-04 18:14:07,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4314516129032258 [2024-06-04 18:14:07,371 INFO L175 Difference]: Start difference. First operand has 77 places, 60 transitions, 424 flow. Second operand 8 states and 107 transitions. [2024-06-04 18:14:07,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 75 transitions, 616 flow [2024-06-04 18:14:07,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 75 transitions, 586 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 18:14:07,377 INFO L231 Difference]: Finished difference. Result has 79 places, 61 transitions, 438 flow [2024-06-04 18:14:07,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=438, PETRI_PLACES=79, PETRI_TRANSITIONS=61} [2024-06-04 18:14:07,378 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-06-04 18:14:07,378 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 61 transitions, 438 flow [2024-06-04 18:14:07,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-04 18:14:07,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:07,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:07,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 18:14:07,379 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:14:07,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:07,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1078964990, now seen corresponding path program 1 times [2024-06-04 18:14:07,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:07,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048298508] [2024-06-04 18:14:07,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:07,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:11,566 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-04 18:14:11,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:11,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048298508] [2024-06-04 18:14:11,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048298508] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:11,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:11,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:14:11,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58463338] [2024-06-04 18:14:11,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:11,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:14:11,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:11,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:14:11,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:14:11,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:14:11,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 61 transitions, 438 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:14:11,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:11,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:14:11,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:11,933 INFO L124 PetriNetUnfolderBase]: 164/350 cut-off events. [2024-06-04 18:14:11,933 INFO L125 PetriNetUnfolderBase]: For 2539/2539 co-relation queries the response was YES. [2024-06-04 18:14:11,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 350 events. 164/350 cut-off events. For 2539/2539 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1532 event pairs, 37 based on Foata normal form. 1/345 useless extension candidates. Maximal degree in co-relation 1445. Up to 250 conditions per place. [2024-06-04 18:14:11,936 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 41 selfloop transitions, 25 changer transitions 3/73 dead transitions. [2024-06-04 18:14:11,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 73 transitions, 640 flow [2024-06-04 18:14:11,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:14:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:14:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-06-04 18:14:11,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45622119815668205 [2024-06-04 18:14:11,938 INFO L175 Difference]: Start difference. First operand has 79 places, 61 transitions, 438 flow. Second operand 7 states and 99 transitions. [2024-06-04 18:14:11,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 73 transitions, 640 flow [2024-06-04 18:14:11,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 73 transitions, 606 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 18:14:11,944 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 489 flow [2024-06-04 18:14:11,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=489, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2024-06-04 18:14:11,944 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 50 predicate places. [2024-06-04 18:14:11,945 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 489 flow [2024-06-04 18:14:11,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:14:11,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:11,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:11,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 18:14:11,945 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:14:11,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:11,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1153824844, now seen corresponding path program 3 times [2024-06-04 18:14:11,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:11,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415444746] [2024-06-04 18:14:11,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:11,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:16,156 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-04 18:14:16,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:16,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415444746] [2024-06-04 18:14:16,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415444746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:16,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:16,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:14:16,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702727573] [2024-06-04 18:14:16,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:16,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:14:16,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:16,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:14:16,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:14:16,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:14:16,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 489 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-04 18:14:16,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:16,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:14:16,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:16,424 INFO L124 PetriNetUnfolderBase]: 156/341 cut-off events. [2024-06-04 18:14:16,424 INFO L125 PetriNetUnfolderBase]: For 2490/2490 co-relation queries the response was YES. [2024-06-04 18:14:16,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 341 events. 156/341 cut-off events. For 2490/2490 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1483 event pairs, 29 based on Foata normal form. 2/342 useless extension candidates. Maximal degree in co-relation 1406. Up to 270 conditions per place. [2024-06-04 18:14:16,426 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 56 selfloop transitions, 14 changer transitions 0/74 dead transitions. [2024-06-04 18:14:16,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 74 transitions, 657 flow [2024-06-04 18:14:16,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:14:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:14:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-04 18:14:16,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4153225806451613 [2024-06-04 18:14:16,429 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 489 flow. Second operand 8 states and 103 transitions. [2024-06-04 18:14:16,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 74 transitions, 657 flow [2024-06-04 18:14:16,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 74 transitions, 608 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-04 18:14:16,434 INFO L231 Difference]: Finished difference. Result has 84 places, 63 transitions, 473 flow [2024-06-04 18:14:16,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=473, PETRI_PLACES=84, PETRI_TRANSITIONS=63} [2024-06-04 18:14:16,434 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2024-06-04 18:14:16,434 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 473 flow [2024-06-04 18:14:16,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-04 18:14:16,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:16,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:16,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 18:14:16,435 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:14:16,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:16,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2065474850, now seen corresponding path program 2 times [2024-06-04 18:14:16,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:16,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224897075] [2024-06-04 18:14:16,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:16,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:20,727 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-04 18:14:20,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:20,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224897075] [2024-06-04 18:14:20,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224897075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:20,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:20,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:14:20,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442570132] [2024-06-04 18:14:20,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:20,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:14:20,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:20,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:14:20,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:14:20,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:14:20,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 63 transitions, 473 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:14:20,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:20,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:14:20,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:21,061 INFO L124 PetriNetUnfolderBase]: 159/343 cut-off events. [2024-06-04 18:14:21,061 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2024-06-04 18:14:21,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1433 conditions, 343 events. 159/343 cut-off events. For 2473/2473 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1509 event pairs, 36 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 1393. Up to 228 conditions per place. [2024-06-04 18:14:21,064 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 41 selfloop transitions, 28 changer transitions 0/73 dead transitions. [2024-06-04 18:14:21,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 73 transitions, 653 flow [2024-06-04 18:14:21,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:14:21,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:14:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-04 18:14:21,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43951612903225806 [2024-06-04 18:14:21,065 INFO L175 Difference]: Start difference. First operand has 84 places, 63 transitions, 473 flow. Second operand 8 states and 109 transitions. [2024-06-04 18:14:21,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 73 transitions, 653 flow [2024-06-04 18:14:21,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 73 transitions, 584 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-04 18:14:21,070 INFO L231 Difference]: Finished difference. Result has 84 places, 65 transitions, 491 flow [2024-06-04 18:14:21,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=491, PETRI_PLACES=84, PETRI_TRANSITIONS=65} [2024-06-04 18:14:21,070 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2024-06-04 18:14:21,070 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 65 transitions, 491 flow [2024-06-04 18:14:21,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:14:21,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:21,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:21,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 18:14:21,072 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:14:21,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:21,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1560746718, now seen corresponding path program 3 times [2024-06-04 18:14:21,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:21,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955567171] [2024-06-04 18:14:21,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:21,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:25,799 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-04 18:14:25,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:25,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955567171] [2024-06-04 18:14:25,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955567171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:25,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:25,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:14:25,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509471405] [2024-06-04 18:14:25,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:25,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:14:25,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:25,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:14:25,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:14:25,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:14:25,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 65 transitions, 491 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:14:25,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:25,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:14:25,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:26,146 INFO L124 PetriNetUnfolderBase]: 162/353 cut-off events. [2024-06-04 18:14:26,147 INFO L125 PetriNetUnfolderBase]: For 2665/2665 co-relation queries the response was YES. [2024-06-04 18:14:26,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 353 events. 162/353 cut-off events. For 2665/2665 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1560 event pairs, 32 based on Foata normal form. 1/350 useless extension candidates. Maximal degree in co-relation 1441. Up to 257 conditions per place. [2024-06-04 18:14:26,150 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 52 selfloop transitions, 20 changer transitions 0/76 dead transitions. [2024-06-04 18:14:26,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 76 transitions, 683 flow [2024-06-04 18:14:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:14:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:14:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-04 18:14:26,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4157706093189964 [2024-06-04 18:14:26,151 INFO L175 Difference]: Start difference. First operand has 84 places, 65 transitions, 491 flow. Second operand 9 states and 116 transitions. [2024-06-04 18:14:26,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 76 transitions, 683 flow [2024-06-04 18:14:26,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 76 transitions, 612 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 18:14:26,159 INFO L231 Difference]: Finished difference. Result has 87 places, 67 transitions, 495 flow [2024-06-04 18:14:26,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=495, PETRI_PLACES=87, PETRI_TRANSITIONS=67} [2024-06-04 18:14:26,159 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2024-06-04 18:14:26,159 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 67 transitions, 495 flow [2024-06-04 18:14:26,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:14:26,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:26,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:26,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 18:14:26,160 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:14:26,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:26,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1569020928, now seen corresponding path program 4 times [2024-06-04 18:14:26,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:26,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471168043] [2024-06-04 18:14:26,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:26,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:30,281 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-04 18:14:30,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:30,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471168043] [2024-06-04 18:14:30,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471168043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:30,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:30,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:14:30,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199959135] [2024-06-04 18:14:30,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:30,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:14:30,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:30,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:14:30,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:14:30,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:14:30,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 67 transitions, 495 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:14:30,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:30,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:14:30,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:30,560 INFO L124 PetriNetUnfolderBase]: 160/347 cut-off events. [2024-06-04 18:14:30,560 INFO L125 PetriNetUnfolderBase]: For 2735/2735 co-relation queries the response was YES. [2024-06-04 18:14:30,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 347 events. 160/347 cut-off events. For 2735/2735 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1534 event pairs, 36 based on Foata normal form. 1/342 useless extension candidates. Maximal degree in co-relation 1405. Up to 218 conditions per place. [2024-06-04 18:14:30,563 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 45 selfloop transitions, 28 changer transitions 0/77 dead transitions. [2024-06-04 18:14:30,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 77 transitions, 691 flow [2024-06-04 18:14:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:14:30,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:14:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-04 18:14:30,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2024-06-04 18:14:30,565 INFO L175 Difference]: Start difference. First operand has 87 places, 67 transitions, 495 flow. Second operand 8 states and 108 transitions. [2024-06-04 18:14:30,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 77 transitions, 691 flow [2024-06-04 18:14:30,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 77 transitions, 629 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 18:14:30,573 INFO L231 Difference]: Finished difference. Result has 88 places, 69 transitions, 528 flow [2024-06-04 18:14:30,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=528, PETRI_PLACES=88, PETRI_TRANSITIONS=69} [2024-06-04 18:14:30,573 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 58 predicate places. [2024-06-04 18:14:30,574 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 69 transitions, 528 flow [2024-06-04 18:14:30,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:14:30,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:30,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:30,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 18:14:30,574 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:14:30,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:30,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1354598209, now seen corresponding path program 1 times [2024-06-04 18:14:30,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:30,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497929496] [2024-06-04 18:14:30,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:30,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:35,352 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-04 18:14:35,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:35,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497929496] [2024-06-04 18:14:35,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497929496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:35,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:35,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:14:35,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780159619] [2024-06-04 18:14:35,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:35,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:14:35,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:35,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:14:35,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:14:35,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:14:35,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 69 transitions, 528 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:14:35,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:35,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:14:35,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:35,740 INFO L124 PetriNetUnfolderBase]: 172/375 cut-off events. [2024-06-04 18:14:35,741 INFO L125 PetriNetUnfolderBase]: For 4344/4344 co-relation queries the response was YES. [2024-06-04 18:14:35,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 375 events. 172/375 cut-off events. For 4344/4344 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1705 event pairs, 34 based on Foata normal form. 8/377 useless extension candidates. Maximal degree in co-relation 1518. Up to 255 conditions per place. [2024-06-04 18:14:35,744 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 57 selfloop transitions, 6 changer transitions 15/82 dead transitions. [2024-06-04 18:14:35,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 82 transitions, 730 flow [2024-06-04 18:14:35,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:14:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:14:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2024-06-04 18:14:35,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 18:14:35,745 INFO L175 Difference]: Start difference. First operand has 88 places, 69 transitions, 528 flow. Second operand 7 states and 93 transitions. [2024-06-04 18:14:35,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 82 transitions, 730 flow [2024-06-04 18:14:35,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 82 transitions, 651 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 18:14:35,752 INFO L231 Difference]: Finished difference. Result has 89 places, 66 transitions, 447 flow [2024-06-04 18:14:35,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=447, PETRI_PLACES=89, PETRI_TRANSITIONS=66} [2024-06-04 18:14:35,753 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2024-06-04 18:14:35,753 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 66 transitions, 447 flow [2024-06-04 18:14:35,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:14:35,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:35,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:35,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 18:14:35,754 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:14:35,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1349747507, now seen corresponding path program 2 times [2024-06-04 18:14:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:35,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206561012] [2024-06-04 18:14:35,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:35,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:40,104 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-04 18:14:40,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:40,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206561012] [2024-06-04 18:14:40,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206561012] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:40,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:40,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:14:40,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862844113] [2024-06-04 18:14:40,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:40,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:14:40,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:40,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:14:40,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:14:40,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:14:40,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 66 transitions, 447 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:14:40,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:40,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:14:40,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:40,428 INFO L124 PetriNetUnfolderBase]: 148/325 cut-off events. [2024-06-04 18:14:40,429 INFO L125 PetriNetUnfolderBase]: For 3217/3217 co-relation queries the response was YES. [2024-06-04 18:14:40,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 325 events. 148/325 cut-off events. For 3217/3217 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1424 event pairs, 15 based on Foata normal form. 2/322 useless extension candidates. Maximal degree in co-relation 1299. Up to 169 conditions per place. [2024-06-04 18:14:40,431 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 51 selfloop transitions, 19 changer transitions 0/74 dead transitions. [2024-06-04 18:14:40,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 74 transitions, 651 flow [2024-06-04 18:14:40,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:14:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:14:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-04 18:14:40,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147465437788018 [2024-06-04 18:14:40,439 INFO L175 Difference]: Start difference. First operand has 89 places, 66 transitions, 447 flow. Second operand 7 states and 90 transitions. [2024-06-04 18:14:40,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 74 transitions, 651 flow [2024-06-04 18:14:40,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 74 transitions, 627 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 18:14:40,446 INFO L231 Difference]: Finished difference. Result has 85 places, 67 transitions, 479 flow [2024-06-04 18:14:40,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=479, PETRI_PLACES=85, PETRI_TRANSITIONS=67} [2024-06-04 18:14:40,447 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 55 predicate places. [2024-06-04 18:14:40,447 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 479 flow [2024-06-04 18:14:40,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:14:40,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:40,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:40,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 18:14:40,448 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:14:40,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1349599637, now seen corresponding path program 3 times [2024-06-04 18:14:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:40,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989634177] [2024-06-04 18:14:40,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:45,351 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-04 18:14:45,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:45,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989634177] [2024-06-04 18:14:45,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989634177] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:45,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:45,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:14:45,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756978875] [2024-06-04 18:14:45,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:45,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:14:45,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:45,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:14:45,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:14:45,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:14:45,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 479 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:14:45,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:45,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:14:45,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:45,674 INFO L124 PetriNetUnfolderBase]: 145/320 cut-off events. [2024-06-04 18:14:45,674 INFO L125 PetriNetUnfolderBase]: For 2413/2413 co-relation queries the response was YES. [2024-06-04 18:14:45,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 320 events. 145/320 cut-off events. For 2413/2413 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1396 event pairs, 31 based on Foata normal form. 2/317 useless extension candidates. Maximal degree in co-relation 1273. Up to 209 conditions per place. [2024-06-04 18:14:45,677 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 47 selfloop transitions, 21 changer transitions 1/73 dead transitions. [2024-06-04 18:14:45,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 73 transitions, 635 flow [2024-06-04 18:14:45,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:14:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:14:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-04 18:14:45,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-04 18:14:45,679 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 479 flow. Second operand 7 states and 91 transitions. [2024-06-04 18:14:45,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 73 transitions, 635 flow [2024-06-04 18:14:45,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 73 transitions, 597 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 18:14:45,685 INFO L231 Difference]: Finished difference. Result has 88 places, 67 transitions, 492 flow [2024-06-04 18:14:45,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=492, PETRI_PLACES=88, PETRI_TRANSITIONS=67} [2024-06-04 18:14:45,686 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 58 predicate places. [2024-06-04 18:14:45,686 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 67 transitions, 492 flow [2024-06-04 18:14:45,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-04 18:14:45,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:45,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:45,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 18:14:45,687 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:14:45,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1349593685, now seen corresponding path program 1 times [2024-06-04 18:14:45,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:45,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425642367] [2024-06-04 18:14:45,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:45,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:50,534 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-04 18:14:50,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:50,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425642367] [2024-06-04 18:14:50,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425642367] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:50,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:50,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:14:50,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549839923] [2024-06-04 18:14:50,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:50,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:14:50,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:50,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:14:50,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:14:50,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:14:50,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 67 transitions, 492 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:14:50,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:50,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:14:50,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:50,902 INFO L124 PetriNetUnfolderBase]: 145/328 cut-off events. [2024-06-04 18:14:50,902 INFO L125 PetriNetUnfolderBase]: For 3923/3923 co-relation queries the response was YES. [2024-06-04 18:14:50,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 328 events. 145/328 cut-off events. For 3923/3923 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1465 event pairs, 26 based on Foata normal form. 8/331 useless extension candidates. Maximal degree in co-relation 1325. Up to 162 conditions per place. [2024-06-04 18:14:50,904 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 39 selfloop transitions, 23 changer transitions 9/75 dead transitions. [2024-06-04 18:14:50,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 75 transitions, 680 flow [2024-06-04 18:14:50,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:14:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:14:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-04 18:14:50,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-04 18:14:50,906 INFO L175 Difference]: Start difference. First operand has 88 places, 67 transitions, 492 flow. Second operand 7 states and 98 transitions. [2024-06-04 18:14:50,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 75 transitions, 680 flow [2024-06-04 18:14:50,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 75 transitions, 640 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-04 18:14:50,913 INFO L231 Difference]: Finished difference. Result has 90 places, 61 transitions, 463 flow [2024-06-04 18:14:50,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=463, PETRI_PLACES=90, PETRI_TRANSITIONS=61} [2024-06-04 18:14:50,914 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2024-06-04 18:14:50,914 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 61 transitions, 463 flow [2024-06-04 18:14:50,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:14:50,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:50,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:50,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 18:14:50,915 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:14:50,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:50,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1615907273, now seen corresponding path program 2 times [2024-06-04 18:14:50,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:50,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381338599] [2024-06-04 18:14:50,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:50,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:14:55,641 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-04 18:14:55,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:14:55,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381338599] [2024-06-04 18:14:55,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381338599] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:14:55,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:14:55,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:14:55,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951329355] [2024-06-04 18:14:55,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:14:55,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:14:55,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:14:55,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:14:55,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:14:55,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:14:55,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 61 transitions, 463 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:14:55,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:14:55,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:14:55,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:14:56,012 INFO L124 PetriNetUnfolderBase]: 151/349 cut-off events. [2024-06-04 18:14:56,012 INFO L125 PetriNetUnfolderBase]: For 5530/5530 co-relation queries the response was YES. [2024-06-04 18:14:56,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1645 conditions, 349 events. 151/349 cut-off events. For 5530/5530 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1601 event pairs, 31 based on Foata normal form. 6/351 useless extension candidates. Maximal degree in co-relation 1602. Up to 160 conditions per place. [2024-06-04 18:14:56,015 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 47 selfloop transitions, 22 changer transitions 5/78 dead transitions. [2024-06-04 18:14:56,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 78 transitions, 741 flow [2024-06-04 18:14:56,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:14:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:14:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-04 18:14:56,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44086021505376344 [2024-06-04 18:14:56,017 INFO L175 Difference]: Start difference. First operand has 90 places, 61 transitions, 463 flow. Second operand 9 states and 123 transitions. [2024-06-04 18:14:56,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 78 transitions, 741 flow [2024-06-04 18:14:56,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 78 transitions, 670 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 18:14:56,024 INFO L231 Difference]: Finished difference. Result has 87 places, 60 transitions, 437 flow [2024-06-04 18:14:56,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=437, PETRI_PLACES=87, PETRI_TRANSITIONS=60} [2024-06-04 18:14:56,025 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2024-06-04 18:14:56,025 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 60 transitions, 437 flow [2024-06-04 18:14:56,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:14:56,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:14:56,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:14:56,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 18:14:56,026 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:14:56,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:14:56,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1615640363, now seen corresponding path program 3 times [2024-06-04 18:14:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:14:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709750365] [2024-06-04 18:14:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:14:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:14:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:15:00,353 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-04 18:15:00,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:15:00,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709750365] [2024-06-04 18:15:00,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709750365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:15:00,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:15:00,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:15:00,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445079441] [2024-06-04 18:15:00,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:15:00,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:15:00,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:15:00,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:15:00,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:15:00,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:15:00,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 60 transitions, 437 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:15:00,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:15:00,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:15:00,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:15:00,615 INFO L124 PetriNetUnfolderBase]: 129/302 cut-off events. [2024-06-04 18:15:00,616 INFO L125 PetriNetUnfolderBase]: For 4010/4010 co-relation queries the response was YES. [2024-06-04 18:15:00,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 302 events. 129/302 cut-off events. For 4010/4010 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1331 event pairs, 31 based on Foata normal form. 8/305 useless extension candidates. Maximal degree in co-relation 1231. Up to 157 conditions per place. [2024-06-04 18:15:00,624 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 38 selfloop transitions, 16 changer transitions 12/70 dead transitions. [2024-06-04 18:15:00,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 70 transitions, 619 flow [2024-06-04 18:15:00,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:15:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:15:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-04 18:15:00,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121863799283154 [2024-06-04 18:15:00,625 INFO L175 Difference]: Start difference. First operand has 87 places, 60 transitions, 437 flow. Second operand 9 states and 115 transitions. [2024-06-04 18:15:00,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 70 transitions, 619 flow [2024-06-04 18:15:00,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 70 transitions, 573 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-04 18:15:00,629 INFO L231 Difference]: Finished difference. Result has 87 places, 54 transitions, 389 flow [2024-06-04 18:15:00,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=389, PETRI_PLACES=87, PETRI_TRANSITIONS=54} [2024-06-04 18:15:00,629 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2024-06-04 18:15:00,630 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 54 transitions, 389 flow [2024-06-04 18:15:00,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:15:00,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:15:00,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:15:00,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 18:15:00,630 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:15:00,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:15:00,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2058270101, now seen corresponding path program 4 times [2024-06-04 18:15:00,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:15:00,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623185955] [2024-06-04 18:15:00,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:15:00,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:15:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:15:05,616 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-04 18:15:05,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:15:05,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623185955] [2024-06-04 18:15:05,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623185955] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:15:05,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:15:05,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:15:05,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073842331] [2024-06-04 18:15:05,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:15:05,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:15:05,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:15:05,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:15:05,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:15:05,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:15:05,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 54 transitions, 389 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:15:05,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:15:05,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:15:05,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:15:05,993 INFO L124 PetriNetUnfolderBase]: 134/319 cut-off events. [2024-06-04 18:15:05,993 INFO L125 PetriNetUnfolderBase]: For 5094/5094 co-relation queries the response was YES. [2024-06-04 18:15:05,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 319 events. 134/319 cut-off events. For 5094/5094 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1427 event pairs, 39 based on Foata normal form. 6/320 useless extension candidates. Maximal degree in co-relation 1437. Up to 134 conditions per place. [2024-06-04 18:15:05,995 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 42 selfloop transitions, 16 changer transitions 6/68 dead transitions. [2024-06-04 18:15:05,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 68 transitions, 635 flow [2024-06-04 18:15:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:15:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:15:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-04 18:15:05,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265232974910394 [2024-06-04 18:15:05,996 INFO L175 Difference]: Start difference. First operand has 87 places, 54 transitions, 389 flow. Second operand 9 states and 119 transitions. [2024-06-04 18:15:05,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 68 transitions, 635 flow [2024-06-04 18:15:06,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 68 transitions, 585 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 18:15:06,001 INFO L231 Difference]: Finished difference. Result has 85 places, 52 transitions, 368 flow [2024-06-04 18:15:06,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=368, PETRI_PLACES=85, PETRI_TRANSITIONS=52} [2024-06-04 18:15:06,002 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 55 predicate places. [2024-06-04 18:15:06,002 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 52 transitions, 368 flow [2024-06-04 18:15:06,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:15:06,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:15:06,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:15:06,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 18:15:06,003 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:15:06,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:15:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1145659209, now seen corresponding path program 5 times [2024-06-04 18:15:06,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:15:06,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144811344] [2024-06-04 18:15:06,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:15:06,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:15:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:15:10,436 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-04 18:15:10,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:15:10,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144811344] [2024-06-04 18:15:10,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144811344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:15:10,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:15:10,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:15:10,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458151197] [2024-06-04 18:15:10,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:15:10,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:15:10,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:15:10,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:15:10,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:15:10,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:15:10,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 52 transitions, 368 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:15:10,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:15:10,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:15:10,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:15:10,792 INFO L124 PetriNetUnfolderBase]: 110/270 cut-off events. [2024-06-04 18:15:10,792 INFO L125 PetriNetUnfolderBase]: For 3582/3582 co-relation queries the response was YES. [2024-06-04 18:15:10,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 270 events. 110/270 cut-off events. For 3582/3582 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1158 event pairs, 27 based on Foata normal form. 8/274 useless extension candidates. Maximal degree in co-relation 1062. Up to 149 conditions per place. [2024-06-04 18:15:10,794 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 37 selfloop transitions, 12 changer transitions 12/65 dead transitions. [2024-06-04 18:15:10,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 65 transitions, 546 flow [2024-06-04 18:15:10,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:15:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:15:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 18:15:10,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4229390681003584 [2024-06-04 18:15:10,795 INFO L175 Difference]: Start difference. First operand has 85 places, 52 transitions, 368 flow. Second operand 9 states and 118 transitions. [2024-06-04 18:15:10,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 65 transitions, 546 flow [2024-06-04 18:15:10,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 65 transitions, 505 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-04 18:15:10,800 INFO L231 Difference]: Finished difference. Result has 84 places, 47 transitions, 324 flow [2024-06-04 18:15:10,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=324, PETRI_PLACES=84, PETRI_TRANSITIONS=47} [2024-06-04 18:15:10,801 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2024-06-04 18:15:10,801 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 47 transitions, 324 flow [2024-06-04 18:15:10,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:15:10,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:15:10,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:15:10,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 18:15:10,802 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:15:10,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:15:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1394087497, now seen corresponding path program 6 times [2024-06-04 18:15:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:15:10,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086895780] [2024-06-04 18:15:10,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:15:10,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:15:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:15:14,994 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-04 18:15:14,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:15:14,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086895780] [2024-06-04 18:15:14,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086895780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:15:14,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:15:14,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:15:14,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918892142] [2024-06-04 18:15:14,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:15:14,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:15:14,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:15:14,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:15:14,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:15:15,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:15:15,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 47 transitions, 324 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:15:15,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:15:15,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:15:15,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:15:15,332 INFO L124 PetriNetUnfolderBase]: 118/279 cut-off events. [2024-06-04 18:15:15,332 INFO L125 PetriNetUnfolderBase]: For 4609/4609 co-relation queries the response was YES. [2024-06-04 18:15:15,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 279 events. 118/279 cut-off events. For 4609/4609 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1167 event pairs, 39 based on Foata normal form. 6/280 useless extension candidates. Maximal degree in co-relation 1247. Up to 105 conditions per place. [2024-06-04 18:15:15,334 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 36 selfloop transitions, 15 changer transitions 6/61 dead transitions. [2024-06-04 18:15:15,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 61 transitions, 548 flow [2024-06-04 18:15:15,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:15:15,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:15:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 18:15:15,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4229390681003584 [2024-06-04 18:15:15,336 INFO L175 Difference]: Start difference. First operand has 84 places, 47 transitions, 324 flow. Second operand 9 states and 118 transitions. [2024-06-04 18:15:15,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 61 transitions, 548 flow [2024-06-04 18:15:15,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 61 transitions, 478 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-06-04 18:15:15,342 INFO L231 Difference]: Finished difference. Result has 77 places, 45 transitions, 292 flow [2024-06-04 18:15:15,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=292, PETRI_PLACES=77, PETRI_TRANSITIONS=45} [2024-06-04 18:15:15,342 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2024-06-04 18:15:15,342 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 45 transitions, 292 flow [2024-06-04 18:15:15,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:15:15,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:15:15,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:15:15,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 18:15:15,343 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:15:15,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:15:15,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1393820587, now seen corresponding path program 7 times [2024-06-04 18:15:15,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:15:15,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729855068] [2024-06-04 18:15:15,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:15:15,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:15:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:15:21,157 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-04 18:15:21,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:15:21,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729855068] [2024-06-04 18:15:21,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729855068] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:15:21,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:15:21,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:15:21,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328040739] [2024-06-04 18:15:21,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:15:21,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:15:21,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:15:21,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:15:21,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:15:21,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:15:21,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 45 transitions, 292 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:15:21,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:15:21,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:15:21,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:15:21,488 INFO L124 PetriNetUnfolderBase]: 94/230 cut-off events. [2024-06-04 18:15:21,488 INFO L125 PetriNetUnfolderBase]: For 2783/2783 co-relation queries the response was YES. [2024-06-04 18:15:21,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 230 events. 94/230 cut-off events. For 2783/2783 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 909 event pairs, 27 based on Foata normal form. 8/234 useless extension candidates. Maximal degree in co-relation 846. Up to 120 conditions per place. [2024-06-04 18:15:21,490 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 31 selfloop transitions, 12 changer transitions 11/58 dead transitions. [2024-06-04 18:15:21,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 58 transitions, 448 flow [2024-06-04 18:15:21,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:15:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:15:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-04 18:15:21,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-04 18:15:21,491 INFO L175 Difference]: Start difference. First operand has 77 places, 45 transitions, 292 flow. Second operand 9 states and 117 transitions. [2024-06-04 18:15:21,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 58 transitions, 448 flow [2024-06-04 18:15:21,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 58 transitions, 409 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-04 18:15:21,494 INFO L231 Difference]: Finished difference. Result has 76 places, 41 transitions, 257 flow [2024-06-04 18:15:21,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=257, PETRI_PLACES=76, PETRI_TRANSITIONS=41} [2024-06-04 18:15:21,494 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2024-06-04 18:15:21,495 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 41 transitions, 257 flow [2024-06-04 18:15:21,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:15:21,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:15:21,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:15:21,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 18:15:21,495 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:15:21,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:15:21,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1411689925, now seen corresponding path program 8 times [2024-06-04 18:15:21,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:15:21,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165764995] [2024-06-04 18:15:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:15:21,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:15:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:15:26,108 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-04 18:15:26,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:15:26,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165764995] [2024-06-04 18:15:26,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165764995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:15:26,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:15:26,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:15:26,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084250352] [2024-06-04 18:15:26,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:15:26,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:15:26,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:15:26,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:15:26,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:15:26,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:15:26,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 41 transitions, 257 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:15:26,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:15:26,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:15:26,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:15:26,326 INFO L124 PetriNetUnfolderBase]: 77/196 cut-off events. [2024-06-04 18:15:26,326 INFO L125 PetriNetUnfolderBase]: For 2014/2014 co-relation queries the response was YES. [2024-06-04 18:15:26,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 196 events. 77/196 cut-off events. For 2014/2014 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 700 event pairs, 22 based on Foata normal form. 6/197 useless extension candidates. Maximal degree in co-relation 673. Up to 74 conditions per place. [2024-06-04 18:15:26,327 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 23 selfloop transitions, 10 changer transitions 14/51 dead transitions. [2024-06-04 18:15:26,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 51 transitions, 371 flow [2024-06-04 18:15:26,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:15:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:15:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-04 18:15:26,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-04 18:15:26,329 INFO L175 Difference]: Start difference. First operand has 76 places, 41 transitions, 257 flow. Second operand 9 states and 109 transitions. [2024-06-04 18:15:26,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 51 transitions, 371 flow [2024-06-04 18:15:26,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 51 transitions, 331 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 18:15:26,331 INFO L231 Difference]: Finished difference. Result has 71 places, 35 transitions, 205 flow [2024-06-04 18:15:26,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=205, PETRI_PLACES=71, PETRI_TRANSITIONS=35} [2024-06-04 18:15:26,332 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2024-06-04 18:15:26,332 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 35 transitions, 205 flow [2024-06-04 18:15:26,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:15:26,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:15:26,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:15:26,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 18:15:26,333 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:15:26,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:15:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1195187911, now seen corresponding path program 1 times [2024-06-04 18:15:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:15:26,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280624702] [2024-06-04 18:15:26,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:15:26,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:15:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:15:30,964 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-04 18:15:30,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:15:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280624702] [2024-06-04 18:15:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280624702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:15:30,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:15:30,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:15:30,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728773140] [2024-06-04 18:15:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:15:30,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:15:30,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:15:30,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:15:30,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:15:31,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 18:15:31,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 35 transitions, 205 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:15:31,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:15:31,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 18:15:31,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:15:31,316 INFO L124 PetriNetUnfolderBase]: 69/172 cut-off events. [2024-06-04 18:15:31,317 INFO L125 PetriNetUnfolderBase]: For 1673/1673 co-relation queries the response was YES. [2024-06-04 18:15:31,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 172 events. 69/172 cut-off events. For 1673/1673 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 556 event pairs, 22 based on Foata normal form. 6/173 useless extension candidates. Maximal degree in co-relation 561. Up to 73 conditions per place. [2024-06-04 18:15:31,317 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 21 selfloop transitions, 7 changer transitions 14/46 dead transitions. [2024-06-04 18:15:31,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 46 transitions, 314 flow [2024-06-04 18:15:31,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:15:31,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:15:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-04 18:15:31,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3951612903225806 [2024-06-04 18:15:31,318 INFO L175 Difference]: Start difference. First operand has 71 places, 35 transitions, 205 flow. Second operand 8 states and 98 transitions. [2024-06-04 18:15:31,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 46 transitions, 314 flow [2024-06-04 18:15:31,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 46 transitions, 280 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 18:15:31,320 INFO L231 Difference]: Finished difference. Result has 63 places, 30 transitions, 161 flow [2024-06-04 18:15:31,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=161, PETRI_PLACES=63, PETRI_TRANSITIONS=30} [2024-06-04 18:15:31,320 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 33 predicate places. [2024-06-04 18:15:31,320 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 30 transitions, 161 flow [2024-06-04 18:15:31,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-04 18:15:31,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:15:31,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:15:31,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 18:15:31,321 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:15:31,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:15:31,321 INFO L85 PathProgramCache]: Analyzing trace with hash 724154507, now seen corresponding path program 2 times [2024-06-04 18:15:31,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:15:31,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113167024] [2024-06-04 18:15:31,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:15:31,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:15:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:15:36,341 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-04 18:15:36,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:15:36,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113167024] [2024-06-04 18:15:36,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113167024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:15:36,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:15:36,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:15:36,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632310369] [2024-06-04 18:15:36,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:15:36,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:15:36,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:15:36,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:15:36,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:15:36,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 18:15:36,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 30 transitions, 161 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-04 18:15:36,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:15:36,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 18:15:36,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:15:36,585 INFO L124 PetriNetUnfolderBase]: 36/104 cut-off events. [2024-06-04 18:15:36,585 INFO L125 PetriNetUnfolderBase]: For 607/607 co-relation queries the response was YES. [2024-06-04 18:15:36,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 104 events. 36/104 cut-off events. For 607/607 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs, 3 based on Foata normal form. 6/107 useless extension candidates. Maximal degree in co-relation 286. Up to 24 conditions per place. [2024-06-04 18:15:36,586 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 0 selfloop transitions, 0 changer transitions 36/36 dead transitions. [2024-06-04 18:15:36,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 36 transitions, 211 flow [2024-06-04 18:15:36,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:15:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:15:36,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2024-06-04 18:15:36,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31899641577060933 [2024-06-04 18:15:36,588 INFO L175 Difference]: Start difference. First operand has 63 places, 30 transitions, 161 flow. Second operand 9 states and 89 transitions. [2024-06-04 18:15:36,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 36 transitions, 211 flow [2024-06-04 18:15:36,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 36 transitions, 171 flow, removed 2 selfloop flow, removed 14 redundant places. [2024-06-04 18:15:36,589 INFO L231 Difference]: Finished difference. Result has 50 places, 0 transitions, 0 flow [2024-06-04 18:15:36,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=50, PETRI_TRANSITIONS=0} [2024-06-04 18:15:36,590 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2024-06-04 18:15:36,590 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 0 transitions, 0 flow [2024-06-04 18:15:36,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-04 18:15:36,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-04 18:15:36,600 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 18:15:36,601 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-04 18:15:36,605 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 18:15:36,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 18:15:36,605 INFO L445 BasicCegarLoop]: Path program histogram: [8, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:15:36,609 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 18:15:36,609 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 18:15:36,612 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-04 18:15:36,613 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-04 18:15:36,613 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 06:15:36 BasicIcfg [2024-06-04 18:15:36,613 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 18:15:36,614 INFO L158 Benchmark]: Toolchain (without parser) took 179745.44ms. Allocated memory was 144.7MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 113.9MB in the beginning and 846.4MB in the end (delta: -732.5MB). Peak memory consumption was 655.8MB. Max. memory is 16.1GB. [2024-06-04 18:15:36,614 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 144.7MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 18:15:36,614 INFO L158 Benchmark]: Witness Parser took 3.14ms. Allocated memory is still 144.7MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 18:15:36,615 INFO L158 Benchmark]: CACSL2BoogieTranslator took 856.58ms. Allocated memory was 144.7MB in the beginning and 186.6MB in the end (delta: 41.9MB). Free memory was 113.6MB in the beginning and 109.7MB in the end (delta: 4.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-06-04 18:15:36,615 INFO L158 Benchmark]: Boogie Procedure Inliner took 137.68ms. Allocated memory is still 186.6MB. Free memory was 109.7MB in the beginning and 93.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-04 18:15:36,615 INFO L158 Benchmark]: Boogie Preprocessor took 143.51ms. Allocated memory is still 186.6MB. Free memory was 93.9MB in the beginning and 87.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-04 18:15:36,615 INFO L158 Benchmark]: RCFGBuilder took 1199.45ms. Allocated memory is still 186.6MB. Free memory was 87.6MB in the beginning and 71.8MB in the end (delta: 15.8MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2024-06-04 18:15:36,616 INFO L158 Benchmark]: TraceAbstraction took 177401.08ms. Allocated memory was 186.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 71.8MB in the beginning and 846.4MB in the end (delta: -774.5MB). Peak memory consumption was 571.8MB. Max. memory is 16.1GB. [2024-06-04 18:15:36,617 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 144.7MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 3.14ms. Allocated memory is still 144.7MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 856.58ms. Allocated memory was 144.7MB in the beginning and 186.6MB in the end (delta: 41.9MB). Free memory was 113.6MB in the beginning and 109.7MB in the end (delta: 4.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 137.68ms. Allocated memory is still 186.6MB. Free memory was 109.7MB in the beginning and 93.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 143.51ms. Allocated memory is still 186.6MB. Free memory was 93.9MB in the beginning and 87.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1199.45ms. Allocated memory is still 186.6MB. Free memory was 87.6MB in the beginning and 71.8MB in the end (delta: 15.8MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. * TraceAbstraction took 177401.08ms. Allocated memory was 186.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 71.8MB in the beginning and 846.4MB in the end (delta: -774.5MB). Peak memory consumption was 571.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 806]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 807]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 49 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 177.2s, OverallIterations: 38, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1849 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1556 mSDsluCounter, 964 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 855 mSDsCounter, 274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8461 IncrementalHoareTripleChecker+Invalid, 8735 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 274 mSolverCounterUnsat, 109 mSDtfsCounter, 8461 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=528occurred in iteration=25, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 161.6s InterpolantComputationTime, 589 NumberOfCodeBlocks, 589 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 551 ConstructedInterpolants, 0 QuantifiedInterpolants, 25356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-04 18:15:36,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE