./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi008.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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/rfi008.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi008.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 15:42:34,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:42:34,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:42:34,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:42:34,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:42:35,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:42:35,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:42:35,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:42:35,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:42:35,016 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:42:35,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:42:35,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:42:35,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:42:35,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:42:35,019 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:42:35,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:42:35,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:42:35,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:42:35,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:42:35,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:42:35,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:42:35,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:42:35,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:42:35,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:42:35,022 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:42:35,022 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:42:35,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:42:35,023 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:42:35,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:42:35,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:42:35,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:42:35,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:42:35,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:42:35,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:42:35,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:42:35,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:42:35,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:42:35,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:42:35,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:42:35,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:42:35,027 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:42:35,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:42:35,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:42:35,028 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-14 15:42:35,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:42:35,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:42:35,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:42:35,304 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:42:35,304 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:42:35,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i [2024-06-14 15:42:36,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:42:36,733 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:42:36,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i [2024-06-14 15:42:36,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17d98c7a/2dac6795bb7940a88ff5c6a6ae8908c6/FLAG682c03609 [2024-06-14 15:42:36,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17d98c7a/2dac6795bb7940a88ff5c6a6ae8908c6 [2024-06-14 15:42:36,769 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:42:36,770 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:42:36,771 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/rfi008.oepc.yml/witness.yml [2024-06-14 15:42:36,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:42:36,962 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:42:36,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:42:36,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:42:36,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:42:36,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:42:36" (1/2) ... [2024-06-14 15:42:36,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@651ac998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:42:36, skipping insertion in model container [2024-06-14 15:42:36,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:42:36" (1/2) ... [2024-06-14 15:42:36,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@57f805e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:42:36, skipping insertion in model container [2024-06-14 15:42:36,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:42:36" (2/2) ... [2024-06-14 15:42:36,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@651ac998 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:42:36, skipping insertion in model container [2024-06-14 15:42:36,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:42:36" (2/2) ... [2024-06-14 15:42:36,975 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:42:37,079 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:42:37,080 INFO L97 edCorrectnessWitness]: Location invariant before [L835-L835] (((((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_thd2) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )y >= 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_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (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 )x$w_buff0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )x$w_buff1) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 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 )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 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_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 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 )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (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_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 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_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 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_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 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_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 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_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_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_thd2 + (long long )x$r_buff1_thd0 >= 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_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_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_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 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_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 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 )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )x$w_buff1 >= 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$$choice2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$w_buff1 >= 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_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$read_delayed >= 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_thd2) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$w_buff0) - (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 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_thd2 >= 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_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 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_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (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_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 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 )x - (long long )x$r_buff0_thd0 >= 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_thd2 >= 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_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 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$mem_tmp - (long long )x$r_buff0_thd0 >= 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_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 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_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (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_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 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_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 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_thd2 >= 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_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 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)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1))) [2024-06-14 15:42:37,084 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] (((((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_thd2) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )y >= 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_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (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 )x$w_buff0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )x$w_buff1) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 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 )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 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_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 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 )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (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_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 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_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 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_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 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_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 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_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_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_thd2 + (long long )x$r_buff1_thd0 >= 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_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_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_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 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_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 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 )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )x$w_buff1 >= 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$$choice2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$w_buff1 >= 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_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$read_delayed >= 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_thd2) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$w_buff0) - (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 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_thd2 >= 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_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 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_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (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_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 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 )x - (long long )x$r_buff0_thd0 >= 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_thd2 >= 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_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 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$mem_tmp - (long long )x$r_buff0_thd0 >= 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_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 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_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (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_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 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_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 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_thd2 >= 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_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 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)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1))) [2024-06-14 15:42:37,084 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:42:37,085 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-06-14 15:42:37,136 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:42:37,548 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:42:37,560 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:42:37,809 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:42:37,858 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:42:37,859 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:42:37 WrapperNode [2024-06-14 15:42:37,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:42:37,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:42:37,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:42:37,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:42:37,867 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 14.06 03:42:37" (1/1) ... [2024-06-14 15:42:37,905 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 14.06 03:42:37" (1/1) ... [2024-06-14 15:42:37,990 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-06-14 15:42:37,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:42:37,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:42:37,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:42:37,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:42:38,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:42:37" (1/1) ... [2024-06-14 15:42:38,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:42:37" (1/1) ... [2024-06-14 15:42:38,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:42:37" (1/1) ... [2024-06-14 15:42:38,067 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-14 15:42:38,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:42:37" (1/1) ... [2024-06-14 15:42:38,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:42:37" (1/1) ... [2024-06-14 15:42:38,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:42:37" (1/1) ... [2024-06-14 15:42:38,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:42:37" (1/1) ... [2024-06-14 15:42:38,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:42:37" (1/1) ... [2024-06-14 15:42:38,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:42:37" (1/1) ... [2024-06-14 15:42:38,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:42:38,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:42:38,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:42:38,128 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:42:38,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:42:37" (1/1) ... [2024-06-14 15:42:38,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:42:38,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:42:38,161 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-14 15:42:38,190 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-14 15:42:38,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:42:38,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:42:38,207 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:42:38,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:42:38,208 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:42:38,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:42:38,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:42:38,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:42:38,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:42:38,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:42:38,210 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 15:42:38,333 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:42:38,335 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:42:39,317 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:42:39,317 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:42:39,508 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:42:39,508 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:42:39,515 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:42:39 BoogieIcfgContainer [2024-06-14 15:42:39,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:42:39,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:42:39,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:42:39,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:42:39,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:42:36" (1/4) ... [2024-06-14 15:42:39,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73fb7499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:42:39, skipping insertion in model container [2024-06-14 15:42:39,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:42:36" (2/4) ... [2024-06-14 15:42:39,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73fb7499 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:42:39, skipping insertion in model container [2024-06-14 15:42:39,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:42:37" (3/4) ... [2024-06-14 15:42:39,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73fb7499 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:42:39, skipping insertion in model container [2024-06-14 15:42:39,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:42:39" (4/4) ... [2024-06-14 15:42:39,526 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.oepc.i [2024-06-14 15:42:39,545 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:42:39,545 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 15:42:39,545 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:42:39,644 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:42:39,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 15:42:39,745 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-14 15:42:39,746 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:42:39,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 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/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:42:39,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 15:42:39,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-14 15:42:39,767 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:42:39,777 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;@7bc066c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:42:39,778 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 15:42:39,787 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:42:39,788 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-14 15:42:39,788 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:42:39,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:39,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:42:39,789 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-14 15:42:39,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:39,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1460724257, now seen corresponding path program 1 times [2024-06-14 15:42:39,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:39,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796407353] [2024-06-14 15:42:39,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:39,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:45,017 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-14 15:42:45,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:45,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796407353] [2024-06-14 15:42:45,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796407353] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:45,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:45,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:42:45,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226473872] [2024-06-14 15:42:45,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:45,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:42:45,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:45,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:42:45,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:42:45,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:42:45,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 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-14 15:42:45,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:45,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:42:45,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:45,454 INFO L124 PetriNetUnfolderBase]: 162/310 cut-off events. [2024-06-14 15:42:45,455 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-14 15:42:45,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 310 events. 162/310 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1182 event pairs, 97 based on Foata normal form. 1/304 useless extension candidates. Maximal degree in co-relation 609. Up to 288 conditions per place. [2024-06-14 15:42:45,461 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 23 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-14 15:42:45,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 121 flow [2024-06-14 15:42:45,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:42:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:42:45,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-06-14 15:42:45,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2024-06-14 15:42:45,474 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 55 transitions. [2024-06-14 15:42:45,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 121 flow [2024-06-14 15:42:45,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 15:42:45,479 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-14 15:42:45,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-14 15:42:45,484 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-14 15:42:45,484 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-14 15:42:45,485 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-14 15:42:45,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:45,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:45,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:42:45,485 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-14 15:42:45,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:45,486 INFO L85 PathProgramCache]: Analyzing trace with hash 698380346, now seen corresponding path program 1 times [2024-06-14 15:42:45,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:45,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331329950] [2024-06-14 15:42:45,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:45,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:49,306 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-14 15:42:49,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:49,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331329950] [2024-06-14 15:42:49,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331329950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:49,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:49,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:42:49,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804487373] [2024-06-14 15:42:49,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:49,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:42:49,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:49,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:42:49,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:42:49,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:42:49,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 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-14 15:42:49,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:49,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:42:49,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:49,678 INFO L124 PetriNetUnfolderBase]: 159/307 cut-off events. [2024-06-14 15:42:49,679 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-06-14 15:42:49,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 307 events. 159/307 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1169 event pairs, 79 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 682. Up to 274 conditions per place. [2024-06-14 15:42:49,682 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 27 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-14 15:42:49,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 163 flow [2024-06-14 15:42:49,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:42:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:42:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2024-06-14 15:42:49,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-06-14 15:42:49,686 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 70 transitions. [2024-06-14 15:42:49,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 163 flow [2024-06-14 15:42:49,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:42:49,691 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-14 15:42:49,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-14 15:42:49,692 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-14 15:42:49,693 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-14 15:42:49,693 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-14 15:42:49,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:49,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:49,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:42:49,695 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-14 15:42:49,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:49,697 INFO L85 PathProgramCache]: Analyzing trace with hash 173167718, now seen corresponding path program 1 times [2024-06-14 15:42:49,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:49,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189551705] [2024-06-14 15:42:49,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:49,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:55,011 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-14 15:42:55,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:55,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189551705] [2024-06-14 15:42:55,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189551705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:55,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:55,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:42:55,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211120934] [2024-06-14 15:42:55,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:55,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:42:55,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:55,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:42:55,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:42:55,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:42:55,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 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-14 15:42:55,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:55,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:42:55,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:55,466 INFO L124 PetriNetUnfolderBase]: 156/307 cut-off events. [2024-06-14 15:42:55,467 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2024-06-14 15:42:55,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 307 events. 156/307 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1166 event pairs, 61 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 750. Up to 260 conditions per place. [2024-06-14 15:42:55,470 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 31 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-14 15:42:55,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 211 flow [2024-06-14 15:42:55,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:42:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:42:55,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2024-06-14 15:42:55,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-06-14 15:42:55,475 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 85 transitions. [2024-06-14 15:42:55,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 211 flow [2024-06-14 15:42:55,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 202 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 15:42:55,478 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-14 15:42:55,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-14 15:42:55,480 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-14 15:42:55,480 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-14 15:42:55,480 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-14 15:42:55,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:55,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:55,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:42:55,482 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:55,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:55,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1089516699, now seen corresponding path program 1 times [2024-06-14 15:42:55,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:55,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61612367] [2024-06-14 15:42:55,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:55,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:02,211 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-14 15:43:02,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:02,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61612367] [2024-06-14 15:43:02,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61612367] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:02,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:02,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:43:02,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702845020] [2024-06-14 15:43:02,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:02,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:43:02,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:02,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:43:02,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:43:02,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:43:02,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:02,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:02,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:43:02,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:02,906 INFO L124 PetriNetUnfolderBase]: 181/346 cut-off events. [2024-06-14 15:43:02,907 INFO L125 PetriNetUnfolderBase]: For 323/323 co-relation queries the response was YES. [2024-06-14 15:43:02,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 346 events. 181/346 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1257 event pairs, 47 based on Foata normal form. 2/347 useless extension candidates. Maximal degree in co-relation 925. Up to 285 conditions per place. [2024-06-14 15:43:02,912 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 40 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2024-06-14 15:43:02,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 294 flow [2024-06-14 15:43:02,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:43:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:43:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2024-06-14 15:43:02,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48660714285714285 [2024-06-14 15:43:02,916 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 7 states and 109 transitions. [2024-06-14 15:43:02,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 294 flow [2024-06-14 15:43:02,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 274 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 15:43:02,920 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 160 flow [2024-06-14 15:43:02,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2024-06-14 15:43:02,921 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2024-06-14 15:43:02,922 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 160 flow [2024-06-14 15:43:02,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:02,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:02,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:02,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:43:02,923 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:02,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:02,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1533607161, now seen corresponding path program 1 times [2024-06-14 15:43:02,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:02,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942430336] [2024-06-14 15:43:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:02,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:08,529 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-14 15:43:08,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:08,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942430336] [2024-06-14 15:43:08,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942430336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:08,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:08,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:43:08,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460337875] [2024-06-14 15:43:08,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:08,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:43:08,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:08,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:43:08,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:43:08,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:08,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-14 15:43:08,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:08,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:08,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:08,998 INFO L124 PetriNetUnfolderBase]: 211/380 cut-off events. [2024-06-14 15:43:08,998 INFO L125 PetriNetUnfolderBase]: For 560/560 co-relation queries the response was YES. [2024-06-14 15:43:08,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 380 events. 211/380 cut-off events. For 560/560 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1334 event pairs, 56 based on Foata normal form. 1/380 useless extension candidates. Maximal degree in co-relation 1145. Up to 368 conditions per place. [2024-06-14 15:43:09,001 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 33 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2024-06-14 15:43:09,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 256 flow [2024-06-14 15:43:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:43:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:43:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2024-06-14 15:43:09,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:43:09,003 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 160 flow. Second operand 5 states and 62 transitions. [2024-06-14 15:43:09,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 256 flow [2024-06-14 15:43:09,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 233 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 15:43:09,006 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 164 flow [2024-06-14 15:43:09,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2024-06-14 15:43:09,007 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2024-06-14 15:43:09,007 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 164 flow [2024-06-14 15:43:09,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-14 15:43:09,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:09,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:09,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:43:09,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:09,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:09,009 INFO L85 PathProgramCache]: Analyzing trace with hash 584721724, now seen corresponding path program 1 times [2024-06-14 15:43:09,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:09,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229903909] [2024-06-14 15:43:09,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:09,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:13,093 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-14 15:43:13,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:13,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229903909] [2024-06-14 15:43:13,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229903909] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:13,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:13,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:43:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479494130] [2024-06-14 15:43:13,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:13,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:43:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:13,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:43:13,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:43:13,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:43:13,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 164 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:13,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:13,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:43:13,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:13,714 INFO L124 PetriNetUnfolderBase]: 190/355 cut-off events. [2024-06-14 15:43:13,714 INFO L125 PetriNetUnfolderBase]: For 773/773 co-relation queries the response was YES. [2024-06-14 15:43:13,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 355 events. 190/355 cut-off events. For 773/773 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1242 event pairs, 34 based on Foata normal form. 4/358 useless extension candidates. Maximal degree in co-relation 1101. Up to 272 conditions per place. [2024-06-14 15:43:13,718 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 41 selfloop transitions, 12 changer transitions 0/57 dead transitions. [2024-06-14 15:43:13,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 314 flow [2024-06-14 15:43:13,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:43:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:43:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2024-06-14 15:43:13,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4609375 [2024-06-14 15:43:13,719 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 164 flow. Second operand 8 states and 118 transitions. [2024-06-14 15:43:13,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 314 flow [2024-06-14 15:43:13,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 303 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 15:43:13,722 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 171 flow [2024-06-14 15:43:13,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=171, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2024-06-14 15:43:13,723 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-14 15:43:13,723 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 171 flow [2024-06-14 15:43:13,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:13,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:13,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:13,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:43:13,725 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-14 15:43:13,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:13,725 INFO L85 PathProgramCache]: Analyzing trace with hash -297180796, now seen corresponding path program 1 times [2024-06-14 15:43:13,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:13,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788829127] [2024-06-14 15:43:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:13,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:18,991 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-14 15:43:18,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:18,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788829127] [2024-06-14 15:43:18,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788829127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:18,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:18,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:43:18,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216965599] [2024-06-14 15:43:18,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:18,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:43:18,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:18,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:43:18,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:43:19,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:19,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 171 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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-14 15:43:19,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:19,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:19,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:19,494 INFO L124 PetriNetUnfolderBase]: 201/363 cut-off events. [2024-06-14 15:43:19,494 INFO L125 PetriNetUnfolderBase]: For 931/931 co-relation queries the response was YES. [2024-06-14 15:43:19,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 363 events. 201/363 cut-off events. For 931/931 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1227 event pairs, 49 based on Foata normal form. 3/365 useless extension candidates. Maximal degree in co-relation 1194. Up to 342 conditions per place. [2024-06-14 15:43:19,498 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 35 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2024-06-14 15:43:19,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 283 flow [2024-06-14 15:43:19,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:43:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:43:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2024-06-14 15:43:19,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:43:19,500 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 171 flow. Second operand 6 states and 72 transitions. [2024-06-14 15:43:19,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 283 flow [2024-06-14 15:43:19,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 253 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:43:19,503 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 174 flow [2024-06-14 15:43:19,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-06-14 15:43:19,505 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-14 15:43:19,505 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 174 flow [2024-06-14 15:43:19,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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-14 15:43:19,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:19,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:19,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:43:19,506 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-14 15:43:19,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:19,507 INFO L85 PathProgramCache]: Analyzing trace with hash 636740918, now seen corresponding path program 1 times [2024-06-14 15:43:19,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:19,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715137013] [2024-06-14 15:43:19,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:19,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:24,272 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-14 15:43:24,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:24,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715137013] [2024-06-14 15:43:24,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715137013] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:24,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:24,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:43:24,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645921698] [2024-06-14 15:43:24,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:24,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:43:24,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:24,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:43:24,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:43:24,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:24,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 174 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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-14 15:43:24,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:24,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:24,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:24,621 INFO L124 PetriNetUnfolderBase]: 204/368 cut-off events. [2024-06-14 15:43:24,621 INFO L125 PetriNetUnfolderBase]: For 1112/1112 co-relation queries the response was YES. [2024-06-14 15:43:24,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 368 events. 204/368 cut-off events. For 1112/1112 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1263 event pairs, 49 based on Foata normal form. 1/368 useless extension candidates. Maximal degree in co-relation 1247. Up to 340 conditions per place. [2024-06-14 15:43:24,625 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 38 selfloop transitions, 11 changer transitions 0/51 dead transitions. [2024-06-14 15:43:24,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 51 transitions, 326 flow [2024-06-14 15:43:24,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:43:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:43:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2024-06-14 15:43:24,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 15:43:24,627 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 174 flow. Second operand 6 states and 76 transitions. [2024-06-14 15:43:24,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 51 transitions, 326 flow [2024-06-14 15:43:24,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 309 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:43:24,630 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 204 flow [2024-06-14 15:43:24,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-06-14 15:43:24,631 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 19 predicate places. [2024-06-14 15:43:24,631 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 204 flow [2024-06-14 15:43:24,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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-14 15:43:24,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:24,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:24,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:43:24,632 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-14 15:43:24,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:24,633 INFO L85 PathProgramCache]: Analyzing trace with hash 293395208, now seen corresponding path program 2 times [2024-06-14 15:43:24,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:24,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18270818] [2024-06-14 15:43:24,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:24,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:29,033 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-14 15:43:29,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:29,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18270818] [2024-06-14 15:43:29,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18270818] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:29,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:29,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:43:29,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050334136] [2024-06-14 15:43:29,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:29,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:43:29,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:29,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:43:29,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:43:29,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:29,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 204 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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-14 15:43:29,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:29,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:29,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:29,452 INFO L124 PetriNetUnfolderBase]: 202/365 cut-off events. [2024-06-14 15:43:29,453 INFO L125 PetriNetUnfolderBase]: For 1376/1376 co-relation queries the response was YES. [2024-06-14 15:43:29,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 365 events. 202/365 cut-off events. For 1376/1376 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1249 event pairs, 48 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 1298. Up to 350 conditions per place. [2024-06-14 15:43:29,456 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 37 selfloop transitions, 8 changer transitions 0/47 dead transitions. [2024-06-14 15:43:29,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 47 transitions, 308 flow [2024-06-14 15:43:29,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:43:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:43:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-06-14 15:43:29,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 15:43:29,458 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 204 flow. Second operand 6 states and 70 transitions. [2024-06-14 15:43:29,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 47 transitions, 308 flow [2024-06-14 15:43:29,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 296 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-14 15:43:29,460 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 213 flow [2024-06-14 15:43:29,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2024-06-14 15:43:29,461 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2024-06-14 15:43:29,461 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 213 flow [2024-06-14 15:43:29,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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-14 15:43:29,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:29,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:29,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:43:29,462 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-14 15:43:29,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:29,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1965014730, now seen corresponding path program 1 times [2024-06-14 15:43:29,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:29,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613739630] [2024-06-14 15:43:29,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:29,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:34,752 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-14 15:43:34,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:34,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613739630] [2024-06-14 15:43:34,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613739630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:34,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:34,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:43:34,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060305681] [2024-06-14 15:43:34,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:34,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:43:34,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:34,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:43:34,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:43:34,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:34,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 213 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:43:34,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:34,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:34,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:35,249 INFO L124 PetriNetUnfolderBase]: 205/370 cut-off events. [2024-06-14 15:43:35,250 INFO L125 PetriNetUnfolderBase]: For 1723/1723 co-relation queries the response was YES. [2024-06-14 15:43:35,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 370 events. 205/370 cut-off events. For 1723/1723 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1269 event pairs, 48 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 1364. Up to 325 conditions per place. [2024-06-14 15:43:35,252 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 41 selfloop transitions, 16 changer transitions 0/59 dead transitions. [2024-06-14 15:43:35,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 399 flow [2024-06-14 15:43:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:43:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:43:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-14 15:43:35,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39732142857142855 [2024-06-14 15:43:35,254 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 213 flow. Second operand 7 states and 89 transitions. [2024-06-14 15:43:35,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 399 flow [2024-06-14 15:43:35,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 378 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-14 15:43:35,258 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 253 flow [2024-06-14 15:43:35,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=253, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-06-14 15:43:35,260 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 25 predicate places. [2024-06-14 15:43:35,262 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 253 flow [2024-06-14 15:43:35,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:43:35,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:35,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:35,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:43:35,262 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-14 15:43:35,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:35,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1965164677, now seen corresponding path program 1 times [2024-06-14 15:43:35,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:35,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323722478] [2024-06-14 15:43:35,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:35,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:40,086 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-14 15:43:40,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:40,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323722478] [2024-06-14 15:43:40,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323722478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:40,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:40,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:43:40,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795028997] [2024-06-14 15:43:40,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:40,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:43:40,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:40,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:43:40,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:43:40,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:40,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 253 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:43:40,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:40,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:40,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:40,505 INFO L124 PetriNetUnfolderBase]: 224/401 cut-off events. [2024-06-14 15:43:40,505 INFO L125 PetriNetUnfolderBase]: For 2350/2350 co-relation queries the response was YES. [2024-06-14 15:43:40,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1588 conditions, 401 events. 224/401 cut-off events. For 2350/2350 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1392 event pairs, 51 based on Foata normal form. 3/403 useless extension candidates. Maximal degree in co-relation 1560. Up to 346 conditions per place. [2024-06-14 15:43:40,509 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 49 selfloop transitions, 15 changer transitions 0/66 dead transitions. [2024-06-14 15:43:40,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 66 transitions, 461 flow [2024-06-14 15:43:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:43:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:43:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-14 15:43:40,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:43:40,511 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 253 flow. Second operand 7 states and 91 transitions. [2024-06-14 15:43:40,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 66 transitions, 461 flow [2024-06-14 15:43:40,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 438 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 15:43:40,518 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 304 flow [2024-06-14 15:43:40,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-06-14 15:43:40,519 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 30 predicate places. [2024-06-14 15:43:40,519 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 304 flow [2024-06-14 15:43:40,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:43:40,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:40,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:40,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:43:40,520 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-14 15:43:40,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:40,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2130501046, now seen corresponding path program 2 times [2024-06-14 15:43:40,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:40,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795811579] [2024-06-14 15:43:40,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:40,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:45,741 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-14 15:43:45,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:45,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795811579] [2024-06-14 15:43:45,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795811579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:45,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:45,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:43:45,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820005691] [2024-06-14 15:43:45,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:45,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:43:45,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:45,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:43:45,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:43:45,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:45,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 304 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:43:45,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:45,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:45,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:46,215 INFO L124 PetriNetUnfolderBase]: 227/406 cut-off events. [2024-06-14 15:43:46,215 INFO L125 PetriNetUnfolderBase]: For 2725/2725 co-relation queries the response was YES. [2024-06-14 15:43:46,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 406 events. 227/406 cut-off events. For 2725/2725 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1416 event pairs, 50 based on Foata normal form. 1/406 useless extension candidates. Maximal degree in co-relation 1703. Up to 376 conditions per place. [2024-06-14 15:43:46,219 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 48 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2024-06-14 15:43:46,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 462 flow [2024-06-14 15:43:46,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:43:46,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:43:46,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2024-06-14 15:43:46,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:43:46,221 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 304 flow. Second operand 7 states and 84 transitions. [2024-06-14 15:43:46,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 462 flow [2024-06-14 15:43:46,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 451 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-14 15:43:46,226 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 340 flow [2024-06-14 15:43:46,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2024-06-14 15:43:46,227 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2024-06-14 15:43:46,227 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 340 flow [2024-06-14 15:43:46,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:43:46,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:46,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:46,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:43:46,228 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-14 15:43:46,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:46,228 INFO L85 PathProgramCache]: Analyzing trace with hash 527668485, now seen corresponding path program 2 times [2024-06-14 15:43:46,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:46,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209637951] [2024-06-14 15:43:46,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:46,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:50,694 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-14 15:43:50,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:50,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209637951] [2024-06-14 15:43:50,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209637951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:50,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:50,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:43:50,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461294721] [2024-06-14 15:43:50,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:50,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:43:50,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:50,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:43:50,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:43:50,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:50,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 340 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:43:50,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:50,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:50,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:51,175 INFO L124 PetriNetUnfolderBase]: 236/421 cut-off events. [2024-06-14 15:43:51,176 INFO L125 PetriNetUnfolderBase]: For 3389/3389 co-relation queries the response was YES. [2024-06-14 15:43:51,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 421 events. 236/421 cut-off events. For 3389/3389 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1485 event pairs, 49 based on Foata normal form. 3/423 useless extension candidates. Maximal degree in co-relation 1818. Up to 397 conditions per place. [2024-06-14 15:43:51,180 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 52 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2024-06-14 15:43:51,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 500 flow [2024-06-14 15:43:51,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:43:51,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:43:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2024-06-14 15:43:51,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36160714285714285 [2024-06-14 15:43:51,181 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 340 flow. Second operand 7 states and 81 transitions. [2024-06-14 15:43:51,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 500 flow [2024-06-14 15:43:51,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 473 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-14 15:43:51,187 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 356 flow [2024-06-14 15:43:51,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=356, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2024-06-14 15:43:51,187 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 37 predicate places. [2024-06-14 15:43:51,188 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 356 flow [2024-06-14 15:43:51,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:43:51,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:51,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:51,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:43:51,188 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-14 15:43:51,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash -408967995, now seen corresponding path program 3 times [2024-06-14 15:43:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:51,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594557076] [2024-06-14 15:43:51,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:51,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:55,596 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-14 15:43:55,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:55,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594557076] [2024-06-14 15:43:55,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594557076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:55,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:55,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:43:55,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768703313] [2024-06-14 15:43:55,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:55,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:43:55,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:55,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:43:55,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:43:55,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:55,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 356 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:43:55,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:55,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:55,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:56,087 INFO L124 PetriNetUnfolderBase]: 230/412 cut-off events. [2024-06-14 15:43:56,088 INFO L125 PetriNetUnfolderBase]: For 3690/3690 co-relation queries the response was YES. [2024-06-14 15:43:56,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 412 events. 230/412 cut-off events. For 3690/3690 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1445 event pairs, 47 based on Foata normal form. 3/414 useless extension candidates. Maximal degree in co-relation 1797. Up to 376 conditions per place. [2024-06-14 15:43:56,091 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 51 selfloop transitions, 13 changer transitions 0/66 dead transitions. [2024-06-14 15:43:56,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 66 transitions, 512 flow [2024-06-14 15:43:56,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:43:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:43:56,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-14 15:43:56,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3794642857142857 [2024-06-14 15:43:56,093 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 356 flow. Second operand 7 states and 85 transitions. [2024-06-14 15:43:56,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 66 transitions, 512 flow [2024-06-14 15:43:56,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 485 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 15:43:56,098 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 360 flow [2024-06-14 15:43:56,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=360, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2024-06-14 15:43:56,099 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2024-06-14 15:43:56,099 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 360 flow [2024-06-14 15:43:56,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:43:56,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:56,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:56,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:43:56,100 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-14 15:43:56,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:56,101 INFO L85 PathProgramCache]: Analyzing trace with hash -408968212, now seen corresponding path program 3 times [2024-06-14 15:43:56,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:56,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040183426] [2024-06-14 15:43:56,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:56,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:01,123 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-14 15:44:01,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040183426] [2024-06-14 15:44:01,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040183426] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:01,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:01,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:44:01,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875703750] [2024-06-14 15:44:01,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:01,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:44:01,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:01,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:44:01,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:44:01,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:01,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 360 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:44:01,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:01,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:01,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:01,599 INFO L124 PetriNetUnfolderBase]: 228/409 cut-off events. [2024-06-14 15:44:01,599 INFO L125 PetriNetUnfolderBase]: For 3883/3883 co-relation queries the response was YES. [2024-06-14 15:44:01,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1848 conditions, 409 events. 228/409 cut-off events. For 3883/3883 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1443 event pairs, 47 based on Foata normal form. 1/409 useless extension candidates. Maximal degree in co-relation 1813. Up to 391 conditions per place. [2024-06-14 15:44:01,603 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 50 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2024-06-14 15:44:01,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 62 transitions, 496 flow [2024-06-14 15:44:01,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:44:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:44:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-14 15:44:01,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35267857142857145 [2024-06-14 15:44:01,605 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 360 flow. Second operand 7 states and 79 transitions. [2024-06-14 15:44:01,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 62 transitions, 496 flow [2024-06-14 15:44:01,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 62 transitions, 453 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 15:44:01,611 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 342 flow [2024-06-14 15:44:01,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2024-06-14 15:44:01,611 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 40 predicate places. [2024-06-14 15:44:01,612 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 342 flow [2024-06-14 15:44:01,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-14 15:44:01,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:01,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:01,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:44:01,612 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-14 15:44:01,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:01,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2022511671, now seen corresponding path program 1 times [2024-06-14 15:44:01,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:01,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960715908] [2024-06-14 15:44:01,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:01,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:07,231 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-14 15:44:07,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:07,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960715908] [2024-06-14 15:44:07,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960715908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:07,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:07,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:07,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963249519] [2024-06-14 15:44:07,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:07,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:07,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:07,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:07,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:07,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:07,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 342 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:07,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:07,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:07,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:07,759 INFO L124 PetriNetUnfolderBase]: 234/419 cut-off events. [2024-06-14 15:44:07,759 INFO L125 PetriNetUnfolderBase]: For 4420/4420 co-relation queries the response was YES. [2024-06-14 15:44:07,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 419 events. 234/419 cut-off events. For 4420/4420 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1488 event pairs, 46 based on Foata normal form. 2/420 useless extension candidates. Maximal degree in co-relation 1845. Up to 366 conditions per place. [2024-06-14 15:44:07,762 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 60 selfloop transitions, 13 changer transitions 0/75 dead transitions. [2024-06-14 15:44:07,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 75 transitions, 546 flow [2024-06-14 15:44:07,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-14 15:44:07,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38671875 [2024-06-14 15:44:07,765 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 342 flow. Second operand 8 states and 99 transitions. [2024-06-14 15:44:07,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 75 transitions, 546 flow [2024-06-14 15:44:07,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 75 transitions, 511 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 15:44:07,772 INFO L231 Difference]: Finished difference. Result has 72 places, 57 transitions, 355 flow [2024-06-14 15:44:07,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=355, PETRI_PLACES=72, PETRI_TRANSITIONS=57} [2024-06-14 15:44:07,773 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2024-06-14 15:44:07,773 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 355 flow [2024-06-14 15:44:07,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:07,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:07,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:07,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:44:07,776 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-14 15:44:07,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:07,776 INFO L85 PathProgramCache]: Analyzing trace with hash 785915425, now seen corresponding path program 1 times [2024-06-14 15:44:07,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:07,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127899480] [2024-06-14 15:44:07,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:07,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:12,709 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-14 15:44:12,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:12,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127899480] [2024-06-14 15:44:12,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127899480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:12,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:12,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:12,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769999348] [2024-06-14 15:44:12,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:12,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:12,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:12,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:12,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:12,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:12,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 57 transitions, 355 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:12,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:12,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:12,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:13,282 INFO L124 PetriNetUnfolderBase]: 247/440 cut-off events. [2024-06-14 15:44:13,282 INFO L125 PetriNetUnfolderBase]: For 5125/5125 co-relation queries the response was YES. [2024-06-14 15:44:13,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2039 conditions, 440 events. 247/440 cut-off events. For 5125/5125 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1612 event pairs, 47 based on Foata normal form. 1/440 useless extension candidates. Maximal degree in co-relation 2003. Up to 331 conditions per place. [2024-06-14 15:44:13,285 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 52 selfloop transitions, 26 changer transitions 0/80 dead transitions. [2024-06-14 15:44:13,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 80 transitions, 609 flow [2024-06-14 15:44:13,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 15:44:13,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-14 15:44:13,287 INFO L175 Difference]: Start difference. First operand has 72 places, 57 transitions, 355 flow. Second operand 8 states and 105 transitions. [2024-06-14 15:44:13,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 80 transitions, 609 flow [2024-06-14 15:44:13,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 80 transitions, 579 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:44:13,293 INFO L231 Difference]: Finished difference. Result has 75 places, 62 transitions, 425 flow [2024-06-14 15:44:13,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=425, PETRI_PLACES=75, PETRI_TRANSITIONS=62} [2024-06-14 15:44:13,294 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 44 predicate places. [2024-06-14 15:44:13,294 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 425 flow [2024-06-14 15:44:13,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:13,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:13,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:13,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:44:13,295 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-14 15:44:13,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:13,296 INFO L85 PathProgramCache]: Analyzing trace with hash 790383889, now seen corresponding path program 2 times [2024-06-14 15:44:13,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:13,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449020095] [2024-06-14 15:44:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:13,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:19,109 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-14 15:44:19,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:19,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449020095] [2024-06-14 15:44:19,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449020095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:19,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:19,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:19,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676717782] [2024-06-14 15:44:19,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:19,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:19,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:19,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:19,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:19,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:19,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 425 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:19,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:19,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:19,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:19,600 INFO L124 PetriNetUnfolderBase]: 250/445 cut-off events. [2024-06-14 15:44:19,601 INFO L125 PetriNetUnfolderBase]: For 5873/5873 co-relation queries the response was YES. [2024-06-14 15:44:19,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2226 conditions, 445 events. 250/445 cut-off events. For 5873/5873 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1628 event pairs, 48 based on Foata normal form. 1/445 useless extension candidates. Maximal degree in co-relation 2188. Up to 379 conditions per place. [2024-06-14 15:44:19,605 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 58 selfloop transitions, 23 changer transitions 0/83 dead transitions. [2024-06-14 15:44:19,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 693 flow [2024-06-14 15:44:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-14 15:44:19,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:44:19,608 INFO L175 Difference]: Start difference. First operand has 75 places, 62 transitions, 425 flow. Second operand 8 states and 100 transitions. [2024-06-14 15:44:19,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 693 flow [2024-06-14 15:44:19,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 83 transitions, 663 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 15:44:19,618 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 494 flow [2024-06-14 15:44:19,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=494, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2024-06-14 15:44:19,619 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2024-06-14 15:44:19,619 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 494 flow [2024-06-14 15:44:19,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:19,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:19,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:19,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:44:19,621 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-14 15:44:19,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:19,621 INFO L85 PathProgramCache]: Analyzing trace with hash 790563565, now seen corresponding path program 2 times [2024-06-14 15:44:19,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:19,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593346123] [2024-06-14 15:44:19,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:19,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:25,446 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-14 15:44:25,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:25,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593346123] [2024-06-14 15:44:25,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593346123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:25,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:25,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:25,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139043119] [2024-06-14 15:44:25,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:25,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:25,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:25,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:25,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:25,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:25,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 494 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:25,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:25,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:25,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:26,016 INFO L124 PetriNetUnfolderBase]: 259/460 cut-off events. [2024-06-14 15:44:26,017 INFO L125 PetriNetUnfolderBase]: For 6882/6882 co-relation queries the response was YES. [2024-06-14 15:44:26,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 460 events. 259/460 cut-off events. For 6882/6882 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1695 event pairs, 47 based on Foata normal form. 3/462 useless extension candidates. Maximal degree in co-relation 2353. Up to 392 conditions per place. [2024-06-14 15:44:26,021 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 65 selfloop transitions, 20 changer transitions 0/87 dead transitions. [2024-06-14 15:44:26,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 87 transitions, 731 flow [2024-06-14 15:44:26,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-14 15:44:26,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-14 15:44:26,023 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 494 flow. Second operand 8 states and 101 transitions. [2024-06-14 15:44:26,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 87 transitions, 731 flow [2024-06-14 15:44:26,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 87 transitions, 704 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 15:44:26,034 INFO L231 Difference]: Finished difference. Result has 85 places, 71 transitions, 538 flow [2024-06-14 15:44:26,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=538, PETRI_PLACES=85, PETRI_TRANSITIONS=71} [2024-06-14 15:44:26,035 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2024-06-14 15:44:26,035 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 71 transitions, 538 flow [2024-06-14 15:44:26,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:26,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:26,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:26,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:44:26,036 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-14 15:44:26,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:26,036 INFO L85 PathProgramCache]: Analyzing trace with hash 790556869, now seen corresponding path program 3 times [2024-06-14 15:44:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:26,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282787707] [2024-06-14 15:44:26,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:26,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:31,567 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-14 15:44:31,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:31,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282787707] [2024-06-14 15:44:31,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282787707] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:31,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:31,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:31,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247937130] [2024-06-14 15:44:31,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:31,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:31,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:31,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:31,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:31,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:31,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 71 transitions, 538 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:31,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:31,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:31,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:32,010 INFO L124 PetriNetUnfolderBase]: 262/465 cut-off events. [2024-06-14 15:44:32,010 INFO L125 PetriNetUnfolderBase]: For 7319/7319 co-relation queries the response was YES. [2024-06-14 15:44:32,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2516 conditions, 465 events. 262/465 cut-off events. For 7319/7319 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1716 event pairs, 50 based on Foata normal form. 1/465 useless extension candidates. Maximal degree in co-relation 2473. Up to 432 conditions per place. [2024-06-14 15:44:32,015 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 67 selfloop transitions, 15 changer transitions 0/84 dead transitions. [2024-06-14 15:44:32,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 84 transitions, 744 flow [2024-06-14 15:44:32,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-14 15:44:32,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36328125 [2024-06-14 15:44:32,017 INFO L175 Difference]: Start difference. First operand has 85 places, 71 transitions, 538 flow. Second operand 8 states and 93 transitions. [2024-06-14 15:44:32,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 84 transitions, 744 flow [2024-06-14 15:44:32,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 84 transitions, 704 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 15:44:32,028 INFO L231 Difference]: Finished difference. Result has 87 places, 73 transitions, 553 flow [2024-06-14 15:44:32,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=553, PETRI_PLACES=87, PETRI_TRANSITIONS=73} [2024-06-14 15:44:32,028 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-14 15:44:32,029 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 73 transitions, 553 flow [2024-06-14 15:44:32,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:32,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:32,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:32,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:44:32,029 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-14 15:44:32,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2022689487, now seen corresponding path program 3 times [2024-06-14 15:44:32,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:32,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15488620] [2024-06-14 15:44:32,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:32,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:37,320 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-14 15:44:37,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:37,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15488620] [2024-06-14 15:44:37,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15488620] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:37,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:37,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:37,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434645928] [2024-06-14 15:44:37,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:37,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:37,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:37,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:37,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:37,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 73 transitions, 553 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:37,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:37,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:37,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:37,878 INFO L124 PetriNetUnfolderBase]: 265/470 cut-off events. [2024-06-14 15:44:37,879 INFO L125 PetriNetUnfolderBase]: For 8056/8056 co-relation queries the response was YES. [2024-06-14 15:44:37,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2560 conditions, 470 events. 265/470 cut-off events. For 8056/8056 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1744 event pairs, 47 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 2516. Up to 396 conditions per place. [2024-06-14 15:44:37,883 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 66 selfloop transitions, 23 changer transitions 0/91 dead transitions. [2024-06-14 15:44:37,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 91 transitions, 795 flow [2024-06-14 15:44:37,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-14 15:44:37,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40234375 [2024-06-14 15:44:37,885 INFO L175 Difference]: Start difference. First operand has 87 places, 73 transitions, 553 flow. Second operand 8 states and 103 transitions. [2024-06-14 15:44:37,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 91 transitions, 795 flow [2024-06-14 15:44:37,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 91 transitions, 760 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:44:37,900 INFO L231 Difference]: Finished difference. Result has 89 places, 75 transitions, 589 flow [2024-06-14 15:44:37,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=589, PETRI_PLACES=89, PETRI_TRANSITIONS=75} [2024-06-14 15:44:37,901 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 58 predicate places. [2024-06-14 15:44:37,901 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 589 flow [2024-06-14 15:44:37,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:37,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:37,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:37,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:44:37,902 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-14 15:44:37,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:37,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1515023513, now seen corresponding path program 4 times [2024-06-14 15:44:37,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:37,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601557795] [2024-06-14 15:44:37,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:37,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:43,102 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-14 15:44:43,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:43,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601557795] [2024-06-14 15:44:43,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601557795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:43,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:43,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:43,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736283588] [2024-06-14 15:44:43,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:43,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:43,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:43,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:43,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:43,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:43,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 75 transitions, 589 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:43,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:43,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:43,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:43,574 INFO L124 PetriNetUnfolderBase]: 263/467 cut-off events. [2024-06-14 15:44:43,575 INFO L125 PetriNetUnfolderBase]: For 8629/8629 co-relation queries the response was YES. [2024-06-14 15:44:43,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 467 events. 263/467 cut-off events. For 8629/8629 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1728 event pairs, 49 based on Foata normal form. 1/467 useless extension candidates. Maximal degree in co-relation 2560. Up to 446 conditions per place. [2024-06-14 15:44:43,578 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 69 selfloop transitions, 12 changer transitions 0/83 dead transitions. [2024-06-14 15:44:43,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 83 transitions, 769 flow [2024-06-14 15:44:43,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-14 15:44:43,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:44:43,581 INFO L175 Difference]: Start difference. First operand has 89 places, 75 transitions, 589 flow. Second operand 8 states and 88 transitions. [2024-06-14 15:44:43,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 83 transitions, 769 flow [2024-06-14 15:44:43,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 83 transitions, 716 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 15:44:43,591 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 565 flow [2024-06-14 15:44:43,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=565, PETRI_PLACES=91, PETRI_TRANSITIONS=75} [2024-06-14 15:44:43,592 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 60 predicate places. [2024-06-14 15:44:43,592 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 565 flow [2024-06-14 15:44:43,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:43,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:43,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:43,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:44:43,592 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-14 15:44:43,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:43,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1384543259, now seen corresponding path program 1 times [2024-06-14 15:44:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:43,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621025334] [2024-06-14 15:44:43,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:43,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:47,938 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-14 15:44:47,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:47,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621025334] [2024-06-14 15:44:47,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621025334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:47,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:47,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:47,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41688487] [2024-06-14 15:44:47,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:47,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:47,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:47,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:47,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:48,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:48,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 75 transitions, 565 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:48,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:48,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:48,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:48,394 INFO L124 PetriNetUnfolderBase]: 259/461 cut-off events. [2024-06-14 15:44:48,395 INFO L125 PetriNetUnfolderBase]: For 9127/9127 co-relation queries the response was YES. [2024-06-14 15:44:48,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2532 conditions, 461 events. 259/461 cut-off events. For 9127/9127 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1704 event pairs, 46 based on Foata normal form. 2/462 useless extension candidates. Maximal degree in co-relation 2486. Up to 432 conditions per place. [2024-06-14 15:44:48,398 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 73 selfloop transitions, 12 changer transitions 0/87 dead transitions. [2024-06-14 15:44:48,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 87 transitions, 773 flow [2024-06-14 15:44:48,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-14 15:44:48,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515625 [2024-06-14 15:44:48,399 INFO L175 Difference]: Start difference. First operand has 91 places, 75 transitions, 565 flow. Second operand 8 states and 90 transitions. [2024-06-14 15:44:48,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 87 transitions, 773 flow [2024-06-14 15:44:48,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 87 transitions, 732 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:44:48,411 INFO L231 Difference]: Finished difference. Result has 92 places, 77 transitions, 573 flow [2024-06-14 15:44:48,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=573, PETRI_PLACES=92, PETRI_TRANSITIONS=77} [2024-06-14 15:44:48,412 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 61 predicate places. [2024-06-14 15:44:48,412 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 77 transitions, 573 flow [2024-06-14 15:44:48,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:48,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:48,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:48,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:44:48,413 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-14 15:44:48,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:48,414 INFO L85 PathProgramCache]: Analyzing trace with hash -385606735, now seen corresponding path program 4 times [2024-06-14 15:44:48,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:48,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063844507] [2024-06-14 15:44:48,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:53,848 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-14 15:44:53,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:53,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063844507] [2024-06-14 15:44:53,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063844507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:53,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:53,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:53,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837275308] [2024-06-14 15:44:53,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:53,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:53,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:53,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:53,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:53,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:53,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 77 transitions, 573 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:53,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:53,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:53,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:54,378 INFO L124 PetriNetUnfolderBase]: 262/466 cut-off events. [2024-06-14 15:44:54,378 INFO L125 PetriNetUnfolderBase]: For 9573/9573 co-relation queries the response was YES. [2024-06-14 15:44:54,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2611 conditions, 466 events. 262/466 cut-off events. For 9573/9573 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1728 event pairs, 45 based on Foata normal form. 1/466 useless extension candidates. Maximal degree in co-relation 2564. Up to 403 conditions per place. [2024-06-14 15:44:54,383 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 70 selfloop transitions, 19 changer transitions 0/91 dead transitions. [2024-06-14 15:44:54,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 91 transitions, 849 flow [2024-06-14 15:44:54,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-14 15:44:54,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:44:54,385 INFO L175 Difference]: Start difference. First operand has 92 places, 77 transitions, 573 flow. Second operand 8 states and 96 transitions. [2024-06-14 15:44:54,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 91 transitions, 849 flow [2024-06-14 15:44:54,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 813 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 15:44:54,397 INFO L231 Difference]: Finished difference. Result has 94 places, 79 transitions, 600 flow [2024-06-14 15:44:54,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=600, PETRI_PLACES=94, PETRI_TRANSITIONS=79} [2024-06-14 15:44:54,398 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 63 predicate places. [2024-06-14 15:44:54,398 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 79 transitions, 600 flow [2024-06-14 15:44:54,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:54,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:54,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:54,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:44:54,399 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-14 15:44:54,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:54,401 INFO L85 PathProgramCache]: Analyzing trace with hash 207125405, now seen corresponding path program 5 times [2024-06-14 15:44:54,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:54,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590325469] [2024-06-14 15:44:54,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:54,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:59,628 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-14 15:44:59,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:59,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590325469] [2024-06-14 15:44:59,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590325469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:59,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:59,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:59,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444591110] [2024-06-14 15:44:59,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:59,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:59,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:59,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:59,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:59,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:59,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 79 transitions, 600 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:44:59,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:59,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:59,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:00,173 INFO L124 PetriNetUnfolderBase]: 271/481 cut-off events. [2024-06-14 15:45:00,173 INFO L125 PetriNetUnfolderBase]: For 10974/10974 co-relation queries the response was YES. [2024-06-14 15:45:00,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2745 conditions, 481 events. 271/481 cut-off events. For 10974/10974 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1793 event pairs, 48 based on Foata normal form. 3/483 useless extension candidates. Maximal degree in co-relation 2697. Up to 446 conditions per place. [2024-06-14 15:45:00,176 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 78 selfloop transitions, 13 changer transitions 0/93 dead transitions. [2024-06-14 15:45:00,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 93 transitions, 847 flow [2024-06-14 15:45:00,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:45:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:45:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-14 15:45:00,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 15:45:00,177 INFO L175 Difference]: Start difference. First operand has 94 places, 79 transitions, 600 flow. Second operand 8 states and 92 transitions. [2024-06-14 15:45:00,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 93 transitions, 847 flow [2024-06-14 15:45:00,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 93 transitions, 784 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 15:45:00,187 INFO L231 Difference]: Finished difference. Result has 96 places, 82 transitions, 610 flow [2024-06-14 15:45:00,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=610, PETRI_PLACES=96, PETRI_TRANSITIONS=82} [2024-06-14 15:45:00,188 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 65 predicate places. [2024-06-14 15:45:00,188 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 82 transitions, 610 flow [2024-06-14 15:45:00,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:45:00,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:00,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:00,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:45:00,189 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-14 15:45:00,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:00,189 INFO L85 PathProgramCache]: Analyzing trace with hash 206894765, now seen corresponding path program 6 times [2024-06-14 15:45:00,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:00,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954983208] [2024-06-14 15:45:00,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:00,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:06,238 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-14 15:45:06,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:06,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954983208] [2024-06-14 15:45:06,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954983208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:06,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:06,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:45:06,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996641422] [2024-06-14 15:45:06,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:06,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:45:06,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:06,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:45:06,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:45:06,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:45:06,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 82 transitions, 610 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:45:06,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:06,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:45:06,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:06,670 INFO L124 PetriNetUnfolderBase]: 265/472 cut-off events. [2024-06-14 15:45:06,671 INFO L125 PetriNetUnfolderBase]: For 10979/10979 co-relation queries the response was YES. [2024-06-14 15:45:06,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2632 conditions, 472 events. 265/472 cut-off events. For 10979/10979 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1758 event pairs, 45 based on Foata normal form. 3/474 useless extension candidates. Maximal degree in co-relation 2583. Up to 425 conditions per place. [2024-06-14 15:45:06,675 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 77 selfloop transitions, 16 changer transitions 0/95 dead transitions. [2024-06-14 15:45:06,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 95 transitions, 836 flow [2024-06-14 15:45:06,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:45:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:45:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-14 15:45:06,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:45:06,678 INFO L175 Difference]: Start difference. First operand has 96 places, 82 transitions, 610 flow. Second operand 8 states and 96 transitions. [2024-06-14 15:45:06,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 95 transitions, 836 flow [2024-06-14 15:45:06,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 95 transitions, 788 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 15:45:06,689 INFO L231 Difference]: Finished difference. Result has 98 places, 82 transitions, 600 flow [2024-06-14 15:45:06,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=600, PETRI_PLACES=98, PETRI_TRANSITIONS=82} [2024-06-14 15:45:06,690 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2024-06-14 15:45:06,690 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 82 transitions, 600 flow [2024-06-14 15:45:06,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-14 15:45:06,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:06,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:06,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:45:06,691 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-14 15:45:06,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:06,691 INFO L85 PathProgramCache]: Analyzing trace with hash 215476805, now seen corresponding path program 1 times [2024-06-14 15:45:06,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:06,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671390495] [2024-06-14 15:45:06,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:06,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:12,073 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-14 15:45:12,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:12,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671390495] [2024-06-14 15:45:12,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671390495] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:12,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:12,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:45:12,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741699713] [2024-06-14 15:45:12,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:12,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:45:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:12,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:45:12,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:45:12,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:45:12,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 82 transitions, 600 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-14 15:45:12,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:12,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:45:12,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:12,613 INFO L124 PetriNetUnfolderBase]: 262/467 cut-off events. [2024-06-14 15:45:12,613 INFO L125 PetriNetUnfolderBase]: For 10822/10822 co-relation queries the response was YES. [2024-06-14 15:45:12,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2576 conditions, 467 events. 262/467 cut-off events. For 10822/10822 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1715 event pairs, 46 based on Foata normal form. 2/468 useless extension candidates. Maximal degree in co-relation 2526. Up to 440 conditions per place. [2024-06-14 15:45:12,617 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 79 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2024-06-14 15:45:12,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 92 transitions, 802 flow [2024-06-14 15:45:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:45:12,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:45:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-14 15:45:12,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:45:12,619 INFO L175 Difference]: Start difference. First operand has 98 places, 82 transitions, 600 flow. Second operand 8 states and 88 transitions. [2024-06-14 15:45:12,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 92 transitions, 802 flow [2024-06-14 15:45:12,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 755 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:45:12,635 INFO L231 Difference]: Finished difference. Result has 99 places, 82 transitions, 579 flow [2024-06-14 15:45:12,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=579, PETRI_PLACES=99, PETRI_TRANSITIONS=82} [2024-06-14 15:45:12,636 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 68 predicate places. [2024-06-14 15:45:12,636 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 82 transitions, 579 flow [2024-06-14 15:45:12,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-14 15:45:12,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:12,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:12,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:45:12,637 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-14 15:45:12,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1868749770, now seen corresponding path program 1 times [2024-06-14 15:45:12,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:12,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558526174] [2024-06-14 15:45:12,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:18,554 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-14 15:45:18,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:18,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558526174] [2024-06-14 15:45:18,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558526174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:18,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:18,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:18,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537255293] [2024-06-14 15:45:18,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:18,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:18,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:18,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:18,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:18,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:45:18,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 82 transitions, 579 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:45:18,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:18,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:45:18,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:19,118 INFO L124 PetriNetUnfolderBase]: 280/501 cut-off events. [2024-06-14 15:45:19,118 INFO L125 PetriNetUnfolderBase]: For 11259/11259 co-relation queries the response was YES. [2024-06-14 15:45:19,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 501 events. 280/501 cut-off events. For 11259/11259 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1896 event pairs, 54 based on Foata normal form. 1/501 useless extension candidates. Maximal degree in co-relation 2659. Up to 468 conditions per place. [2024-06-14 15:45:19,123 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 87 selfloop transitions, 16 changer transitions 0/105 dead transitions. [2024-06-14 15:45:19,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 105 transitions, 898 flow [2024-06-14 15:45:19,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:45:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:45:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 15:45:19,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-14 15:45:19,126 INFO L175 Difference]: Start difference. First operand has 99 places, 82 transitions, 579 flow. Second operand 10 states and 107 transitions. [2024-06-14 15:45:19,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 105 transitions, 898 flow [2024-06-14 15:45:19,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 105 transitions, 870 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 15:45:19,147 INFO L231 Difference]: Finished difference. Result has 108 places, 94 transitions, 708 flow [2024-06-14 15:45:19,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=708, PETRI_PLACES=108, PETRI_TRANSITIONS=94} [2024-06-14 15:45:19,148 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 77 predicate places. [2024-06-14 15:45:19,148 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 94 transitions, 708 flow [2024-06-14 15:45:19,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:45:19,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:19,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:19,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:45:19,149 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-14 15:45:19,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:19,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1406430428, now seen corresponding path program 2 times [2024-06-14 15:45:19,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:19,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410214892] [2024-06-14 15:45:19,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:19,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:25,098 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-14 15:45:25,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:25,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410214892] [2024-06-14 15:45:25,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410214892] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:25,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:25,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:25,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868882648] [2024-06-14 15:45:25,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:25,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:25,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:25,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:25,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:25,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:45:25,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 94 transitions, 708 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:45:25,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:25,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:45:25,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:25,671 INFO L124 PetriNetUnfolderBase]: 303/536 cut-off events. [2024-06-14 15:45:25,671 INFO L125 PetriNetUnfolderBase]: For 13670/13673 co-relation queries the response was YES. [2024-06-14 15:45:25,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3101 conditions, 536 events. 303/536 cut-off events. For 13670/13673 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2092 event pairs, 43 based on Foata normal form. 3/538 useless extension candidates. Maximal degree in co-relation 3044. Up to 329 conditions per place. [2024-06-14 15:45:25,674 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 70 selfloop transitions, 51 changer transitions 0/123 dead transitions. [2024-06-14 15:45:25,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 123 transitions, 1258 flow [2024-06-14 15:45:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-14 15:45:25,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 15:45:25,675 INFO L175 Difference]: Start difference. First operand has 108 places, 94 transitions, 708 flow. Second operand 9 states and 120 transitions. [2024-06-14 15:45:25,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 123 transitions, 1258 flow [2024-06-14 15:45:25,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 123 transitions, 1233 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 15:45:25,696 INFO L231 Difference]: Finished difference. Result has 115 places, 104 transitions, 916 flow [2024-06-14 15:45:25,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=916, PETRI_PLACES=115, PETRI_TRANSITIONS=104} [2024-06-14 15:45:25,697 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-14 15:45:25,697 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 104 transitions, 916 flow [2024-06-14 15:45:25,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:45:25,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:25,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:25,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:45:25,698 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-14 15:45:25,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:25,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1406430583, now seen corresponding path program 1 times [2024-06-14 15:45:25,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:25,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189169380] [2024-06-14 15:45:25,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:25,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:32,526 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-14 15:45:32,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189169380] [2024-06-14 15:45:32,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189169380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:32,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:32,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:32,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999485939] [2024-06-14 15:45:32,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:32,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:32,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:32,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:32,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:32,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:45:32,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 104 transitions, 916 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-14 15:45:32,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:32,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:45:32,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:32,919 INFO L124 PetriNetUnfolderBase]: 306/541 cut-off events. [2024-06-14 15:45:32,920 INFO L125 PetriNetUnfolderBase]: For 15096/15099 co-relation queries the response was YES. [2024-06-14 15:45:32,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3362 conditions, 541 events. 306/541 cut-off events. For 15096/15099 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2101 event pairs, 51 based on Foata normal form. 3/543 useless extension candidates. Maximal degree in co-relation 3303. Up to 452 conditions per place. [2024-06-14 15:45:32,923 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 84 selfloop transitions, 34 changer transitions 0/120 dead transitions. [2024-06-14 15:45:32,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 120 transitions, 1208 flow [2024-06-14 15:45:32,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 15:45:32,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:45:32,925 INFO L175 Difference]: Start difference. First operand has 115 places, 104 transitions, 916 flow. Second operand 9 states and 117 transitions. [2024-06-14 15:45:32,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 120 transitions, 1208 flow [2024-06-14 15:45:32,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 120 transitions, 1158 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-14 15:45:32,946 INFO L231 Difference]: Finished difference. Result has 121 places, 106 transitions, 961 flow [2024-06-14 15:45:32,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=961, PETRI_PLACES=121, PETRI_TRANSITIONS=106} [2024-06-14 15:45:32,946 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 90 predicate places. [2024-06-14 15:45:32,947 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 106 transitions, 961 flow [2024-06-14 15:45:32,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-14 15:45:32,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:32,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:32,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:45:32,947 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-14 15:45:32,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1406424631, now seen corresponding path program 1 times [2024-06-14 15:45:32,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:32,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638444545] [2024-06-14 15:45:32,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:32,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:40,383 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-14 15:45:40,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:40,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638444545] [2024-06-14 15:45:40,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638444545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:40,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:40,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:40,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161348113] [2024-06-14 15:45:40,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:40,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:40,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:40,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:40,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:40,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:45:40,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 106 transitions, 961 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:45:40,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:40,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:45:40,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:41,078 INFO L124 PetriNetUnfolderBase]: 320/564 cut-off events. [2024-06-14 15:45:41,079 INFO L125 PetriNetUnfolderBase]: For 17025/17028 co-relation queries the response was YES. [2024-06-14 15:45:41,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3543 conditions, 564 events. 320/564 cut-off events. For 17025/17028 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2216 event pairs, 41 based on Foata normal form. 4/567 useless extension candidates. Maximal degree in co-relation 3483. Up to 399 conditions per place. [2024-06-14 15:45:41,084 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 88 selfloop transitions, 42 changer transitions 0/132 dead transitions. [2024-06-14 15:45:41,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 132 transitions, 1379 flow [2024-06-14 15:45:41,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 15:45:41,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-14 15:45:41,086 INFO L175 Difference]: Start difference. First operand has 121 places, 106 transitions, 961 flow. Second operand 9 states and 116 transitions. [2024-06-14 15:45:41,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 132 transitions, 1379 flow [2024-06-14 15:45:41,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 132 transitions, 1300 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:45:41,106 INFO L231 Difference]: Finished difference. Result has 125 places, 114 transitions, 1059 flow [2024-06-14 15:45:41,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1059, PETRI_PLACES=125, PETRI_TRANSITIONS=114} [2024-06-14 15:45:41,106 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 94 predicate places. [2024-06-14 15:45:41,107 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 114 transitions, 1059 flow [2024-06-14 15:45:41,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:45:41,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:41,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:41,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:45:41,107 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-14 15:45:41,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:41,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1406424848, now seen corresponding path program 3 times [2024-06-14 15:45:41,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:41,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502573457] [2024-06-14 15:45:41,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:41,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:46,791 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-14 15:45:46,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:46,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502573457] [2024-06-14 15:45:46,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502573457] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:46,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:46,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:46,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885357602] [2024-06-14 15:45:46,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:46,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:46,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:46,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:46,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:46,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:45:46,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 114 transitions, 1059 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:45:46,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:46,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:45:46,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:47,300 INFO L124 PetriNetUnfolderBase]: 318/561 cut-off events. [2024-06-14 15:45:47,300 INFO L125 PetriNetUnfolderBase]: For 17334/17337 co-relation queries the response was YES. [2024-06-14 15:45:47,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3698 conditions, 561 events. 318/561 cut-off events. For 17334/17337 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2201 event pairs, 40 based on Foata normal form. 3/563 useless extension candidates. Maximal degree in co-relation 3635. Up to 355 conditions per place. [2024-06-14 15:45:47,304 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 77 selfloop transitions, 53 changer transitions 0/132 dead transitions. [2024-06-14 15:45:47,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 132 transitions, 1493 flow [2024-06-14 15:45:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:47,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 15:45:47,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-14 15:45:47,307 INFO L175 Difference]: Start difference. First operand has 125 places, 114 transitions, 1059 flow. Second operand 9 states and 118 transitions. [2024-06-14 15:45:47,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 132 transitions, 1493 flow [2024-06-14 15:45:47,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 132 transitions, 1458 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-14 15:45:47,331 INFO L231 Difference]: Finished difference. Result has 131 places, 114 transitions, 1135 flow [2024-06-14 15:45:47,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1135, PETRI_PLACES=131, PETRI_TRANSITIONS=114} [2024-06-14 15:45:47,332 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 100 predicate places. [2024-06-14 15:45:47,332 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 114 transitions, 1135 flow [2024-06-14 15:45:47,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:45:47,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:47,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:47,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:45:47,333 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-14 15:45:47,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:47,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1720932563, now seen corresponding path program 2 times [2024-06-14 15:45:47,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:47,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843494539] [2024-06-14 15:45:47,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:47,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:53,811 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-14 15:45:53,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:53,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843494539] [2024-06-14 15:45:53,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843494539] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:53,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:53,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:53,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795637531] [2024-06-14 15:45:53,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:53,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:53,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:53,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:53,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:53,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:45:53,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 114 transitions, 1135 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-14 15:45:53,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:53,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:45:53,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:54,257 INFO L124 PetriNetUnfolderBase]: 324/571 cut-off events. [2024-06-14 15:45:54,257 INFO L125 PetriNetUnfolderBase]: For 19252/19255 co-relation queries the response was YES. [2024-06-14 15:45:54,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3872 conditions, 571 events. 324/571 cut-off events. For 19252/19255 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2266 event pairs, 40 based on Foata normal form. 4/574 useless extension candidates. Maximal degree in co-relation 3806. Up to 492 conditions per place. [2024-06-14 15:45:54,261 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 105 selfloop transitions, 25 changer transitions 0/132 dead transitions. [2024-06-14 15:45:54,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 132 transitions, 1463 flow [2024-06-14 15:45:54,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:54,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-14 15:45:54,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 15:45:54,262 INFO L175 Difference]: Start difference. First operand has 131 places, 114 transitions, 1135 flow. Second operand 9 states and 120 transitions. [2024-06-14 15:45:54,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 132 transitions, 1463 flow [2024-06-14 15:45:54,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 132 transitions, 1362 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 15:45:54,287 INFO L231 Difference]: Finished difference. Result has 133 places, 116 transitions, 1113 flow [2024-06-14 15:45:54,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1113, PETRI_PLACES=133, PETRI_TRANSITIONS=116} [2024-06-14 15:45:54,288 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 102 predicate places. [2024-06-14 15:45:54,288 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 116 transitions, 1113 flow [2024-06-14 15:45:54,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-14 15:45:54,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:54,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:54,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:45:54,288 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-14 15:45:54,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1262332508, now seen corresponding path program 4 times [2024-06-14 15:45:54,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:54,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428462427] [2024-06-14 15:45:54,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:54,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:59,713 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-14 15:45:59,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:59,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428462427] [2024-06-14 15:45:59,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428462427] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:59,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:59,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:59,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993134116] [2024-06-14 15:45:59,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:59,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:59,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:59,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:59,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:59,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:45:59,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 116 transitions, 1113 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:45:59,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:59,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:45:59,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:00,222 INFO L124 PetriNetUnfolderBase]: 342/601 cut-off events. [2024-06-14 15:46:00,222 INFO L125 PetriNetUnfolderBase]: For 22382/22385 co-relation queries the response was YES. [2024-06-14 15:46:00,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4009 conditions, 601 events. 342/601 cut-off events. For 22382/22385 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2421 event pairs, 40 based on Foata normal form. 8/608 useless extension candidates. Maximal degree in co-relation 3942. Up to 506 conditions per place. [2024-06-14 15:46:00,226 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 108 selfloop transitions, 28 changer transitions 0/138 dead transitions. [2024-06-14 15:46:00,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 138 transitions, 1498 flow [2024-06-14 15:46:00,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:00,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:00,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 15:46:00,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-14 15:46:00,227 INFO L175 Difference]: Start difference. First operand has 133 places, 116 transitions, 1113 flow. Second operand 9 states and 113 transitions. [2024-06-14 15:46:00,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 138 transitions, 1498 flow [2024-06-14 15:46:00,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 138 transitions, 1439 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:00,253 INFO L231 Difference]: Finished difference. Result has 135 places, 121 transitions, 1182 flow [2024-06-14 15:46:00,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1182, PETRI_PLACES=135, PETRI_TRANSITIONS=121} [2024-06-14 15:46:00,254 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 104 predicate places. [2024-06-14 15:46:00,254 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 121 transitions, 1182 flow [2024-06-14 15:46:00,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:00,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:00,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:00,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:46:00,255 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-14 15:46:00,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:00,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1262539898, now seen corresponding path program 5 times [2024-06-14 15:46:00,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:00,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547520058] [2024-06-14 15:46:00,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:00,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:06,553 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-14 15:46:06,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:06,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547520058] [2024-06-14 15:46:06,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547520058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:06,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:06,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:06,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428121854] [2024-06-14 15:46:06,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:06,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:06,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:06,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:06,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:06,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:06,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 121 transitions, 1182 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:06,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:06,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:06,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:07,099 INFO L124 PetriNetUnfolderBase]: 350/614 cut-off events. [2024-06-14 15:46:07,099 INFO L125 PetriNetUnfolderBase]: For 21535/21538 co-relation queries the response was YES. [2024-06-14 15:46:07,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 614 events. 350/614 cut-off events. For 21535/21538 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2478 event pairs, 43 based on Foata normal form. 3/616 useless extension candidates. Maximal degree in co-relation 4146. Up to 514 conditions per place. [2024-06-14 15:46:07,103 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 107 selfloop transitions, 33 changer transitions 0/142 dead transitions. [2024-06-14 15:46:07,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 142 transitions, 1628 flow [2024-06-14 15:46:07,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 15:46:07,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-14 15:46:07,104 INFO L175 Difference]: Start difference. First operand has 135 places, 121 transitions, 1182 flow. Second operand 9 states and 116 transitions. [2024-06-14 15:46:07,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 142 transitions, 1628 flow [2024-06-14 15:46:07,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 142 transitions, 1548 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:07,140 INFO L231 Difference]: Finished difference. Result has 137 places, 125 transitions, 1225 flow [2024-06-14 15:46:07,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1225, PETRI_PLACES=137, PETRI_TRANSITIONS=125} [2024-06-14 15:46:07,141 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 106 predicate places. [2024-06-14 15:46:07,141 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 125 transitions, 1225 flow [2024-06-14 15:46:07,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:07,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:07,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:07,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:46:07,142 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-14 15:46:07,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:07,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1721140325, now seen corresponding path program 2 times [2024-06-14 15:46:07,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:07,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168907125] [2024-06-14 15:46:07,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:07,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:12,835 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-14 15:46:12,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:12,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168907125] [2024-06-14 15:46:12,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168907125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:12,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:12,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:12,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650282503] [2024-06-14 15:46:12,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:12,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:12,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:12,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:12,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:12,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:12,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 125 transitions, 1225 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:12,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:12,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:12,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:13,335 INFO L124 PetriNetUnfolderBase]: 353/619 cut-off events. [2024-06-14 15:46:13,335 INFO L125 PetriNetUnfolderBase]: For 22784/22787 co-relation queries the response was YES. [2024-06-14 15:46:13,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4273 conditions, 619 events. 353/619 cut-off events. For 22784/22787 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2501 event pairs, 52 based on Foata normal form. 3/621 useless extension candidates. Maximal degree in co-relation 4204. Up to 578 conditions per place. [2024-06-14 15:46:13,340 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 116 selfloop transitions, 20 changer transitions 0/138 dead transitions. [2024-06-14 15:46:13,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 138 transitions, 1549 flow [2024-06-14 15:46:13,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-14 15:46:13,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2024-06-14 15:46:13,342 INFO L175 Difference]: Start difference. First operand has 137 places, 125 transitions, 1225 flow. Second operand 9 states and 102 transitions. [2024-06-14 15:46:13,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 138 transitions, 1549 flow [2024-06-14 15:46:13,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 138 transitions, 1499 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 15:46:13,391 INFO L231 Difference]: Finished difference. Result has 141 places, 127 transitions, 1248 flow [2024-06-14 15:46:13,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1248, PETRI_PLACES=141, PETRI_TRANSITIONS=127} [2024-06-14 15:46:13,391 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 110 predicate places. [2024-06-14 15:46:13,391 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 127 transitions, 1248 flow [2024-06-14 15:46:13,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:13,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:13,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:13,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:46:13,392 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-14 15:46:13,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:13,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1262534101, now seen corresponding path program 3 times [2024-06-14 15:46:13,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:13,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252414891] [2024-06-14 15:46:13,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:13,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:20,022 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-14 15:46:20,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:20,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252414891] [2024-06-14 15:46:20,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252414891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:20,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:20,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:20,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737719313] [2024-06-14 15:46:20,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:20,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:20,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:20,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:20,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:20,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:20,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 127 transitions, 1248 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:20,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:20,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:20,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:20,572 INFO L124 PetriNetUnfolderBase]: 359/629 cut-off events. [2024-06-14 15:46:20,572 INFO L125 PetriNetUnfolderBase]: For 24531/24534 co-relation queries the response was YES. [2024-06-14 15:46:20,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4393 conditions, 629 events. 359/629 cut-off events. For 24531/24534 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2570 event pairs, 40 based on Foata normal form. 4/632 useless extension candidates. Maximal degree in co-relation 4322. Up to 538 conditions per place. [2024-06-14 15:46:20,577 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 114 selfloop transitions, 29 changer transitions 0/145 dead transitions. [2024-06-14 15:46:20,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 145 transitions, 1606 flow [2024-06-14 15:46:20,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 15:46:20,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-14 15:46:20,579 INFO L175 Difference]: Start difference. First operand has 141 places, 127 transitions, 1248 flow. Second operand 9 states and 113 transitions. [2024-06-14 15:46:20,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 145 transitions, 1606 flow [2024-06-14 15:46:20,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 145 transitions, 1549 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:20,612 INFO L231 Difference]: Finished difference. Result has 143 places, 129 transitions, 1282 flow [2024-06-14 15:46:20,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1282, PETRI_PLACES=143, PETRI_TRANSITIONS=129} [2024-06-14 15:46:20,613 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 112 predicate places. [2024-06-14 15:46:20,613 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 129 transitions, 1282 flow [2024-06-14 15:46:20,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:20,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:20,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:20,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:46:20,613 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-14 15:46:20,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:20,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1721134590, now seen corresponding path program 6 times [2024-06-14 15:46:20,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:20,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333555552] [2024-06-14 15:46:20,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:20,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:26,093 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-14 15:46:26,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:26,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333555552] [2024-06-14 15:46:26,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333555552] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:26,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:26,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:26,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928255351] [2024-06-14 15:46:26,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:26,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:26,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:26,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:26,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:26,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:26,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 129 transitions, 1282 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:26,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:26,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:26,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:26,558 INFO L124 PetriNetUnfolderBase]: 357/626 cut-off events. [2024-06-14 15:46:26,559 INFO L125 PetriNetUnfolderBase]: For 24536/24539 co-relation queries the response was YES. [2024-06-14 15:46:26,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4408 conditions, 626 events. 357/626 cut-off events. For 24536/24539 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2563 event pairs, 40 based on Foata normal form. 3/628 useless extension candidates. Maximal degree in co-relation 4336. Up to 527 conditions per place. [2024-06-14 15:46:26,565 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 110 selfloop transitions, 33 changer transitions 0/145 dead transitions. [2024-06-14 15:46:26,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 145 transitions, 1625 flow [2024-06-14 15:46:26,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:46:26,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 15:46:26,566 INFO L175 Difference]: Start difference. First operand has 143 places, 129 transitions, 1282 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:46:26,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 145 transitions, 1625 flow [2024-06-14 15:46:26,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 145 transitions, 1540 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:26,624 INFO L231 Difference]: Finished difference. Result has 145 places, 130 transitions, 1281 flow [2024-06-14 15:46:26,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1281, PETRI_PLACES=145, PETRI_TRANSITIONS=130} [2024-06-14 15:46:26,626 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 114 predicate places. [2024-06-14 15:46:26,626 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 130 transitions, 1281 flow [2024-06-14 15:46:26,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:26,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:26,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:26,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:46:26,627 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:26,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:26,627 INFO L85 PathProgramCache]: Analyzing trace with hash -783466076, now seen corresponding path program 7 times [2024-06-14 15:46:26,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:26,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273219728] [2024-06-14 15:46:26,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:26,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:32,409 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-14 15:46:32,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:32,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273219728] [2024-06-14 15:46:32,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273219728] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:32,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:32,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:32,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116251930] [2024-06-14 15:46:32,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:32,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:32,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:32,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:32,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:32,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:32,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 130 transitions, 1281 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:32,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:32,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:32,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:32,941 INFO L124 PetriNetUnfolderBase]: 375/658 cut-off events. [2024-06-14 15:46:32,941 INFO L125 PetriNetUnfolderBase]: For 29329/29329 co-relation queries the response was YES. [2024-06-14 15:46:32,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4590 conditions, 658 events. 375/658 cut-off events. For 29329/29329 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2703 event pairs, 59 based on Foata normal form. 6/663 useless extension candidates. Maximal degree in co-relation 4517. Up to 598 conditions per place. [2024-06-14 15:46:32,946 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 127 selfloop transitions, 19 changer transitions 0/148 dead transitions. [2024-06-14 15:46:32,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 148 transitions, 1688 flow [2024-06-14 15:46:32,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-14 15:46:32,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-06-14 15:46:32,948 INFO L175 Difference]: Start difference. First operand has 145 places, 130 transitions, 1281 flow. Second operand 9 states and 104 transitions. [2024-06-14 15:46:32,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 148 transitions, 1688 flow [2024-06-14 15:46:32,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 148 transitions, 1629 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 15:46:32,990 INFO L231 Difference]: Finished difference. Result has 148 places, 135 transitions, 1346 flow [2024-06-14 15:46:32,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1346, PETRI_PLACES=148, PETRI_TRANSITIONS=135} [2024-06-14 15:46:32,991 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-14 15:46:32,991 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 135 transitions, 1346 flow [2024-06-14 15:46:32,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:32,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:32,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:32,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:46:32,992 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:32,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:32,992 INFO L85 PathProgramCache]: Analyzing trace with hash 28832653, now seen corresponding path program 4 times [2024-06-14 15:46:32,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:32,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394674438] [2024-06-14 15:46:32,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:32,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:39,174 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-14 15:46:39,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:39,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394674438] [2024-06-14 15:46:39,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394674438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:39,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:39,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:39,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960284531] [2024-06-14 15:46:39,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:39,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:39,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:39,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:39,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:39,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:39,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 135 transitions, 1346 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:39,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:39,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:39,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:39,717 INFO L124 PetriNetUnfolderBase]: 379/665 cut-off events. [2024-06-14 15:46:39,718 INFO L125 PetriNetUnfolderBase]: For 27950/27950 co-relation queries the response was YES. [2024-06-14 15:46:39,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4655 conditions, 665 events. 379/665 cut-off events. For 27950/27950 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2756 event pairs, 63 based on Foata normal form. 3/667 useless extension candidates. Maximal degree in co-relation 4581. Up to 621 conditions per place. [2024-06-14 15:46:39,723 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 127 selfloop transitions, 20 changer transitions 0/149 dead transitions. [2024-06-14 15:46:39,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 149 transitions, 1718 flow [2024-06-14 15:46:39,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-14 15:46:39,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2024-06-14 15:46:39,724 INFO L175 Difference]: Start difference. First operand has 148 places, 135 transitions, 1346 flow. Second operand 9 states and 100 transitions. [2024-06-14 15:46:39,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 149 transitions, 1718 flow [2024-06-14 15:46:39,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 149 transitions, 1644 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:39,770 INFO L231 Difference]: Finished difference. Result has 150 places, 139 transitions, 1380 flow [2024-06-14 15:46:39,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1380, PETRI_PLACES=150, PETRI_TRANSITIONS=139} [2024-06-14 15:46:39,771 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 119 predicate places. [2024-06-14 15:46:39,771 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 139 transitions, 1380 flow [2024-06-14 15:46:39,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:39,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:39,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:39,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:46:39,772 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:39,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:39,772 INFO L85 PathProgramCache]: Analyzing trace with hash -237079674, now seen corresponding path program 8 times [2024-06-14 15:46:39,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:39,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799517433] [2024-06-14 15:46:39,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:39,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:44,867 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-14 15:46:44,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:44,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799517433] [2024-06-14 15:46:44,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799517433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:44,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:44,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700126091] [2024-06-14 15:46:44,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:44,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:44,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:44,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:44,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:44,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:44,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 139 transitions, 1380 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:44,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:44,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:44,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:45,410 INFO L124 PetriNetUnfolderBase]: 401/701 cut-off events. [2024-06-14 15:46:45,410 INFO L125 PetriNetUnfolderBase]: For 30756/30756 co-relation queries the response was YES. [2024-06-14 15:46:45,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5021 conditions, 701 events. 401/701 cut-off events. For 30756/30756 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2938 event pairs, 57 based on Foata normal form. 2/702 useless extension candidates. Maximal degree in co-relation 4946. Up to 561 conditions per place. [2024-06-14 15:46:45,415 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 121 selfloop transitions, 37 changer transitions 0/160 dead transitions. [2024-06-14 15:46:45,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 160 transitions, 1934 flow [2024-06-14 15:46:45,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 15:46:45,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-14 15:46:45,417 INFO L175 Difference]: Start difference. First operand has 150 places, 139 transitions, 1380 flow. Second operand 9 states and 110 transitions. [2024-06-14 15:46:45,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 160 transitions, 1934 flow [2024-06-14 15:46:45,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 160 transitions, 1864 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:45,481 INFO L231 Difference]: Finished difference. Result has 153 places, 146 transitions, 1524 flow [2024-06-14 15:46:45,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1524, PETRI_PLACES=153, PETRI_TRANSITIONS=146} [2024-06-14 15:46:45,481 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 122 predicate places. [2024-06-14 15:46:45,481 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 146 transitions, 1524 flow [2024-06-14 15:46:45,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:45,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:45,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:45,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:46:45,482 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:45,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:45,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2118563627, now seen corresponding path program 3 times [2024-06-14 15:46:45,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:45,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244358098] [2024-06-14 15:46:45,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:45,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:50,933 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-14 15:46:50,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:50,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244358098] [2024-06-14 15:46:50,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244358098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:50,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:50,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:50,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668556857] [2024-06-14 15:46:50,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:50,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:50,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:50,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:50,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:51,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:46:51,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 146 transitions, 1524 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-14 15:46:51,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:51,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:46:51,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:51,513 INFO L124 PetriNetUnfolderBase]: 398/696 cut-off events. [2024-06-14 15:46:51,513 INFO L125 PetriNetUnfolderBase]: For 31029/31029 co-relation queries the response was YES. [2024-06-14 15:46:51,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5096 conditions, 696 events. 398/696 cut-off events. For 31029/31029 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2906 event pairs, 71 based on Foata normal form. 1/696 useless extension candidates. Maximal degree in co-relation 5019. Up to 669 conditions per place. [2024-06-14 15:46:51,518 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 138 selfloop transitions, 15 changer transitions 0/155 dead transitions. [2024-06-14 15:46:51,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 155 transitions, 1865 flow [2024-06-14 15:46:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 15:46:51,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-14 15:46:51,519 INFO L175 Difference]: Start difference. First operand has 153 places, 146 transitions, 1524 flow. Second operand 9 states and 106 transitions. [2024-06-14 15:46:51,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 155 transitions, 1865 flow [2024-06-14 15:46:51,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 155 transitions, 1792 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-14 15:46:51,573 INFO L231 Difference]: Finished difference. Result has 157 places, 147 transitions, 1505 flow [2024-06-14 15:46:51,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1451, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1505, PETRI_PLACES=157, PETRI_TRANSITIONS=147} [2024-06-14 15:46:51,574 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 126 predicate places. [2024-06-14 15:46:51,574 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 147 transitions, 1505 flow [2024-06-14 15:46:51,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-14 15:46:51,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:51,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:51,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:46:51,575 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:51,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:51,576 INFO L85 PathProgramCache]: Analyzing trace with hash -237074094, now seen corresponding path program 9 times [2024-06-14 15:46:51,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:51,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448985856] [2024-06-14 15:46:51,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:56,894 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-14 15:46:56,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:56,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448985856] [2024-06-14 15:46:56,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448985856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:56,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:56,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:56,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198099005] [2024-06-14 15:46:56,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:56,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:56,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:56,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:57,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:57,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 147 transitions, 1505 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:57,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:57,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:57,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:57,478 INFO L124 PetriNetUnfolderBase]: 404/706 cut-off events. [2024-06-14 15:46:57,479 INFO L125 PetriNetUnfolderBase]: For 33063/33063 co-relation queries the response was YES. [2024-06-14 15:46:57,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5184 conditions, 706 events. 404/706 cut-off events. For 33063/33063 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2974 event pairs, 57 based on Foata normal form. 2/707 useless extension candidates. Maximal degree in co-relation 5105. Up to 564 conditions per place. [2024-06-14 15:46:57,484 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 123 selfloop transitions, 39 changer transitions 0/164 dead transitions. [2024-06-14 15:46:57,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 164 transitions, 2023 flow [2024-06-14 15:46:57,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 15:46:57,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-14 15:46:57,485 INFO L175 Difference]: Start difference. First operand has 157 places, 147 transitions, 1505 flow. Second operand 9 states and 110 transitions. [2024-06-14 15:46:57,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 164 transitions, 2023 flow [2024-06-14 15:46:57,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 164 transitions, 1974 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:57,547 INFO L231 Difference]: Finished difference. Result has 159 places, 150 transitions, 1592 flow [2024-06-14 15:46:57,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1592, PETRI_PLACES=159, PETRI_TRANSITIONS=150} [2024-06-14 15:46:57,547 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 128 predicate places. [2024-06-14 15:46:57,547 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 150 transitions, 1592 flow [2024-06-14 15:46:57,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:46:57,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:57,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:57,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:46:57,548 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:57,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1919695397, now seen corresponding path program 5 times [2024-06-14 15:46:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:57,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131737586] [2024-06-14 15:46:57,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:57,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:04,393 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-14 15:47:04,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:04,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131737586] [2024-06-14 15:47:04,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131737586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:04,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:04,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:47:04,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951872606] [2024-06-14 15:47:04,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:04,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:47:04,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:04,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:47:04,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:47:04,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:47:04,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 150 transitions, 1592 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-14 15:47:04,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:04,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:47:04,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:04,905 INFO L124 PetriNetUnfolderBase]: 410/716 cut-off events. [2024-06-14 15:47:04,905 INFO L125 PetriNetUnfolderBase]: For 35013/35013 co-relation queries the response was YES. [2024-06-14 15:47:04,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5338 conditions, 716 events. 410/716 cut-off events. For 35013/35013 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3011 event pairs, 67 based on Foata normal form. 2/717 useless extension candidates. Maximal degree in co-relation 5258. Up to 672 conditions per place. [2024-06-14 15:47:04,911 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 146 selfloop transitions, 16 changer transitions 0/164 dead transitions. [2024-06-14 15:47:04,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 164 transitions, 1982 flow [2024-06-14 15:47:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:04,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 15:47:04,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-14 15:47:04,912 INFO L175 Difference]: Start difference. First operand has 159 places, 150 transitions, 1592 flow. Second operand 9 states and 111 transitions. [2024-06-14 15:47:04,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 164 transitions, 1982 flow [2024-06-14 15:47:04,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 164 transitions, 1903 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 15:47:04,974 INFO L231 Difference]: Finished difference. Result has 162 places, 152 transitions, 1586 flow [2024-06-14 15:47:04,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1586, PETRI_PLACES=162, PETRI_TRANSITIONS=152} [2024-06-14 15:47:04,975 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2024-06-14 15:47:04,975 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 152 transitions, 1586 flow [2024-06-14 15:47:04,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-14 15:47:04,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:04,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:04,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:47:04,976 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:04,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:04,976 INFO L85 PathProgramCache]: Analyzing trace with hash 931094073, now seen corresponding path program 6 times [2024-06-14 15:47:04,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:04,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637774803] [2024-06-14 15:47:04,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:04,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637774803] [2024-06-14 15:47:11,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637774803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:11,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:11,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125707293] [2024-06-14 15:47:11,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:11,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:11,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:11,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:11,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:11,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:47:11,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 152 transitions, 1586 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:47:11,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:11,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:47:11,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:12,272 INFO L124 PetriNetUnfolderBase]: 416/726 cut-off events. [2024-06-14 15:47:12,272 INFO L125 PetriNetUnfolderBase]: For 36631/36631 co-relation queries the response was YES. [2024-06-14 15:47:12,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5387 conditions, 726 events. 416/726 cut-off events. For 36631/36631 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3080 event pairs, 63 based on Foata normal form. 2/727 useless extension candidates. Maximal degree in co-relation 5306. Up to 638 conditions per place. [2024-06-14 15:47:12,278 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 138 selfloop transitions, 27 changer transitions 0/167 dead transitions. [2024-06-14 15:47:12,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 167 transitions, 2076 flow [2024-06-14 15:47:12,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 15:47:12,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-14 15:47:12,279 INFO L175 Difference]: Start difference. First operand has 162 places, 152 transitions, 1586 flow. Second operand 9 states and 106 transitions. [2024-06-14 15:47:12,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 167 transitions, 2076 flow [2024-06-14 15:47:12,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 167 transitions, 2023 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-14 15:47:12,374 INFO L231 Difference]: Finished difference. Result has 164 places, 154 transitions, 1628 flow [2024-06-14 15:47:12,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1533, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1628, PETRI_PLACES=164, PETRI_TRANSITIONS=154} [2024-06-14 15:47:12,375 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 133 predicate places. [2024-06-14 15:47:12,375 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 154 transitions, 1628 flow [2024-06-14 15:47:12,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:47:12,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:12,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:12,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:47:12,376 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:12,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:12,377 INFO L85 PathProgramCache]: Analyzing trace with hash 931295883, now seen corresponding path program 7 times [2024-06-14 15:47:12,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:12,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128235088] [2024-06-14 15:47:12,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:12,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:18,449 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-14 15:47:18,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:18,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128235088] [2024-06-14 15:47:18,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128235088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:18,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:18,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:18,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067710955] [2024-06-14 15:47:18,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:18,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:18,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:18,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:18,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:18,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:47:18,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 154 transitions, 1628 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:47:18,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:18,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:47:18,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:18,981 INFO L124 PetriNetUnfolderBase]: 412/720 cut-off events. [2024-06-14 15:47:18,981 INFO L125 PetriNetUnfolderBase]: For 36184/36184 co-relation queries the response was YES. [2024-06-14 15:47:18,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5304 conditions, 720 events. 412/720 cut-off events. For 36184/36184 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3045 event pairs, 64 based on Foata normal form. 2/721 useless extension candidates. Maximal degree in co-relation 5222. Up to 664 conditions per place. [2024-06-14 15:47:18,986 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 147 selfloop transitions, 19 changer transitions 0/168 dead transitions. [2024-06-14 15:47:18,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 2002 flow [2024-06-14 15:47:18,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 15:47:18,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-14 15:47:18,987 INFO L175 Difference]: Start difference. First operand has 164 places, 154 transitions, 1628 flow. Second operand 9 states and 106 transitions. [2024-06-14 15:47:18,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 2002 flow [2024-06-14 15:47:19,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 168 transitions, 1920 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-14 15:47:19,049 INFO L231 Difference]: Finished difference. Result has 167 places, 154 transitions, 1589 flow [2024-06-14 15:47:19,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1589, PETRI_PLACES=167, PETRI_TRANSITIONS=154} [2024-06-14 15:47:19,049 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2024-06-14 15:47:19,049 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 154 transitions, 1589 flow [2024-06-14 15:47:19,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:47:19,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:19,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:19,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:47:19,050 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:19,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:19,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2118771172, now seen corresponding path program 10 times [2024-06-14 15:47:19,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:19,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342576229] [2024-06-14 15:47:19,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:19,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:24,300 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-14 15:47:24,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:24,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342576229] [2024-06-14 15:47:24,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342576229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:24,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:24,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:24,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70973401] [2024-06-14 15:47:24,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:24,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:24,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:24,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:24,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:24,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:47:24,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 154 transitions, 1589 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:47:24,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:24,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:47:24,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:24,868 INFO L124 PetriNetUnfolderBase]: 400/702 cut-off events. [2024-06-14 15:47:24,868 INFO L125 PetriNetUnfolderBase]: For 35133/35133 co-relation queries the response was YES. [2024-06-14 15:47:24,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4882 conditions, 702 events. 400/702 cut-off events. For 35133/35133 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2968 event pairs, 57 based on Foata normal form. 6/707 useless extension candidates. Maximal degree in co-relation 4799. Up to 630 conditions per place. [2024-06-14 15:47:24,873 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 145 selfloop transitions, 22 changer transitions 0/169 dead transitions. [2024-06-14 15:47:24,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 169 transitions, 1978 flow [2024-06-14 15:47:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-14 15:47:24,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:47:24,874 INFO L175 Difference]: Start difference. First operand has 167 places, 154 transitions, 1589 flow. Second operand 9 states and 108 transitions. [2024-06-14 15:47:24,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 169 transitions, 1978 flow [2024-06-14 15:47:24,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 169 transitions, 1849 flow, removed 28 selfloop flow, removed 9 redundant places. [2024-06-14 15:47:24,944 INFO L231 Difference]: Finished difference. Result has 167 places, 154 transitions, 1514 flow [2024-06-14 15:47:24,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1514, PETRI_PLACES=167, PETRI_TRANSITIONS=154} [2024-06-14 15:47:24,945 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2024-06-14 15:47:24,945 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 154 transitions, 1514 flow [2024-06-14 15:47:24,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:47:24,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:24,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:24,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:47:24,946 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:24,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1583960870, now seen corresponding path program 11 times [2024-06-14 15:47:24,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:24,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746905354] [2024-06-14 15:47:24,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:24,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:32,123 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-14 15:47:32,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:32,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746905354] [2024-06-14 15:47:32,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746905354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:32,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:32,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:32,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693298066] [2024-06-14 15:47:32,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:32,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:32,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:32,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:32,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:47:32,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 154 transitions, 1514 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:47:32,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:32,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:47:32,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:32,785 INFO L124 PetriNetUnfolderBase]: 418/733 cut-off events. [2024-06-14 15:47:32,785 INFO L125 PetriNetUnfolderBase]: For 31033/31036 co-relation queries the response was YES. [2024-06-14 15:47:32,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4947 conditions, 733 events. 418/733 cut-off events. For 31033/31036 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3151 event pairs, 57 based on Foata normal form. 3/735 useless extension candidates. Maximal degree in co-relation 4864. Up to 667 conditions per place. [2024-06-14 15:47:32,789 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 153 selfloop transitions, 26 changer transitions 0/181 dead transitions. [2024-06-14 15:47:32,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 181 transitions, 2032 flow [2024-06-14 15:47:32,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:47:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:47:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-14 15:47:32,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-14 15:47:32,791 INFO L175 Difference]: Start difference. First operand has 167 places, 154 transitions, 1514 flow. Second operand 10 states and 116 transitions. [2024-06-14 15:47:32,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 181 transitions, 2032 flow [2024-06-14 15:47:32,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 181 transitions, 1933 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 15:47:32,870 INFO L231 Difference]: Finished difference. Result has 171 places, 165 transitions, 1617 flow [2024-06-14 15:47:32,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1415, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1617, PETRI_PLACES=171, PETRI_TRANSITIONS=165} [2024-06-14 15:47:32,870 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 140 predicate places. [2024-06-14 15:47:32,870 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 165 transitions, 1617 flow [2024-06-14 15:47:32,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:47:32,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:32,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:32,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:47:32,871 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:32,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:32,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1926715244, now seen corresponding path program 12 times [2024-06-14 15:47:32,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:32,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424311258] [2024-06-14 15:47:32,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:32,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:39,102 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-14 15:47:39,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:39,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424311258] [2024-06-14 15:47:39,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424311258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:39,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:39,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:39,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654156502] [2024-06-14 15:47:39,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:39,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:39,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:39,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:39,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:39,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:47:39,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 165 transitions, 1617 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:47:39,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:39,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:47:39,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:39,673 INFO L124 PetriNetUnfolderBase]: 424/743 cut-off events. [2024-06-14 15:47:39,673 INFO L125 PetriNetUnfolderBase]: For 32226/32226 co-relation queries the response was YES. [2024-06-14 15:47:39,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5041 conditions, 743 events. 424/743 cut-off events. For 32226/32226 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3201 event pairs, 63 based on Foata normal form. 1/743 useless extension candidates. Maximal degree in co-relation 4954. Up to 704 conditions per place. [2024-06-14 15:47:39,679 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 166 selfloop transitions, 19 changer transitions 0/187 dead transitions. [2024-06-14 15:47:39,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 187 transitions, 2124 flow [2024-06-14 15:47:39,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:47:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:47:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-14 15:47:39,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-14 15:47:39,681 INFO L175 Difference]: Start difference. First operand has 171 places, 165 transitions, 1617 flow. Second operand 10 states and 112 transitions. [2024-06-14 15:47:39,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 187 transitions, 2124 flow [2024-06-14 15:47:39,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 187 transitions, 2067 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-14 15:47:39,762 INFO L231 Difference]: Finished difference. Result has 181 places, 173 transitions, 1731 flow [2024-06-14 15:47:39,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1562, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1731, PETRI_PLACES=181, PETRI_TRANSITIONS=173} [2024-06-14 15:47:39,763 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 150 predicate places. [2024-06-14 15:47:39,763 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 173 transitions, 1731 flow [2024-06-14 15:47:39,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:47:39,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:39,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:39,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:47:39,763 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:39,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:39,764 INFO L85 PathProgramCache]: Analyzing trace with hash 654918112, now seen corresponding path program 13 times [2024-06-14 15:47:39,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:39,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427315694] [2024-06-14 15:47:39,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:39,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:46,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-14 15:47:46,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:46,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427315694] [2024-06-14 15:47:46,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427315694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:46,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:46,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:46,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699457491] [2024-06-14 15:47:46,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:46,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:46,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:46,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:46,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:46,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:47:46,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 173 transitions, 1731 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:47:46,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:46,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:47:46,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:47,124 INFO L124 PetriNetUnfolderBase]: 437/766 cut-off events. [2024-06-14 15:47:47,124 INFO L125 PetriNetUnfolderBase]: For 34851/34851 co-relation queries the response was YES. [2024-06-14 15:47:47,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5204 conditions, 766 events. 437/766 cut-off events. For 34851/34851 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3339 event pairs, 56 based on Foata normal form. 2/767 useless extension candidates. Maximal degree in co-relation 5112. Up to 632 conditions per place. [2024-06-14 15:47:47,130 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 160 selfloop transitions, 39 changer transitions 0/201 dead transitions. [2024-06-14 15:47:47,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 201 transitions, 2373 flow [2024-06-14 15:47:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:47:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:47:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-14 15:47:47,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:47:47,132 INFO L175 Difference]: Start difference. First operand has 181 places, 173 transitions, 1731 flow. Second operand 11 states and 132 transitions. [2024-06-14 15:47:47,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 201 transitions, 2373 flow [2024-06-14 15:47:47,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 201 transitions, 2309 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-14 15:47:47,219 INFO L231 Difference]: Finished difference. Result has 190 places, 183 transitions, 1878 flow [2024-06-14 15:47:47,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1878, PETRI_PLACES=190, PETRI_TRANSITIONS=183} [2024-06-14 15:47:47,220 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 159 predicate places. [2024-06-14 15:47:47,220 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 183 transitions, 1878 flow [2024-06-14 15:47:47,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-14 15:47:47,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:47,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:47,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:47:47,221 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:47,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:47,222 INFO L85 PathProgramCache]: Analyzing trace with hash -654261058, now seen corresponding path program 1 times [2024-06-14 15:47:47,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:47,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822041905] [2024-06-14 15:47:47,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:47,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:53,816 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-14 15:47:53,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:53,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822041905] [2024-06-14 15:47:53,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822041905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:53,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:53,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:53,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522855624] [2024-06-14 15:47:53,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:53,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:53,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:53,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:53,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:54,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:47:54,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 183 transitions, 1878 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:54,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:54,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:47:54,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:54,678 INFO L124 PetriNetUnfolderBase]: 448/787 cut-off events. [2024-06-14 15:47:54,678 INFO L125 PetriNetUnfolderBase]: For 39283/39283 co-relation queries the response was YES. [2024-06-14 15:47:54,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5526 conditions, 787 events. 448/787 cut-off events. For 39283/39283 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3477 event pairs, 40 based on Foata normal form. 2/788 useless extension candidates. Maximal degree in co-relation 5431. Up to 640 conditions per place. [2024-06-14 15:47:54,685 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 161 selfloop transitions, 43 changer transitions 0/206 dead transitions. [2024-06-14 15:47:54,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 206 transitions, 2474 flow [2024-06-14 15:47:54,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:47:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:47:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-14 15:47:54,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3664772727272727 [2024-06-14 15:47:54,686 INFO L175 Difference]: Start difference. First operand has 190 places, 183 transitions, 1878 flow. Second operand 11 states and 129 transitions. [2024-06-14 15:47:54,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 206 transitions, 2474 flow [2024-06-14 15:47:54,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 206 transitions, 2415 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-14 15:47:54,766 INFO L231 Difference]: Finished difference. Result has 197 places, 185 transitions, 1947 flow [2024-06-14 15:47:54,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1819, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1947, PETRI_PLACES=197, PETRI_TRANSITIONS=185} [2024-06-14 15:47:54,767 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 166 predicate places. [2024-06-14 15:47:54,767 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 185 transitions, 1947 flow [2024-06-14 15:47:54,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:54,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:54,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:54,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:47:54,767 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:54,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:54,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468398, now seen corresponding path program 1 times [2024-06-14 15:47:54,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:54,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940958461] [2024-06-14 15:47:54,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:54,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:00,910 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-14 15:48:00,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:00,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940958461] [2024-06-14 15:48:00,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940958461] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:00,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:00,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:00,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454857496] [2024-06-14 15:48:00,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:00,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:00,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:00,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:00,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:01,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:01,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 185 transitions, 1947 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:01,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:01,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:01,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:01,647 INFO L124 PetriNetUnfolderBase]: 460/807 cut-off events. [2024-06-14 15:48:01,647 INFO L125 PetriNetUnfolderBase]: For 39405/39405 co-relation queries the response was YES. [2024-06-14 15:48:01,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5730 conditions, 807 events. 460/807 cut-off events. For 39405/39405 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3584 event pairs, 55 based on Foata normal form. 1/807 useless extension candidates. Maximal degree in co-relation 5633. Up to 665 conditions per place. [2024-06-14 15:48:01,655 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 154 selfloop transitions, 56 changer transitions 0/212 dead transitions. [2024-06-14 15:48:01,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 212 transitions, 2600 flow [2024-06-14 15:48:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:48:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:48:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 15:48:01,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-14 15:48:01,656 INFO L175 Difference]: Start difference. First operand has 197 places, 185 transitions, 1947 flow. Second operand 11 states and 131 transitions. [2024-06-14 15:48:01,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 212 transitions, 2600 flow [2024-06-14 15:48:01,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 212 transitions, 2498 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 15:48:01,755 INFO L231 Difference]: Finished difference. Result has 202 places, 193 transitions, 2058 flow [2024-06-14 15:48:01,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1849, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2058, PETRI_PLACES=202, PETRI_TRANSITIONS=193} [2024-06-14 15:48:01,756 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 171 predicate places. [2024-06-14 15:48:01,756 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 193 transitions, 2058 flow [2024-06-14 15:48:01,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:01,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:01,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:01,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:48:01,756 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:01,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:01,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468522, now seen corresponding path program 2 times [2024-06-14 15:48:01,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:01,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406697273] [2024-06-14 15:48:01,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:01,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:07,677 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-14 15:48:07,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:07,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406697273] [2024-06-14 15:48:07,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406697273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:07,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:07,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:07,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728294783] [2024-06-14 15:48:07,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:07,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:07,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:07,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:07,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:07,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:07,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 193 transitions, 2058 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:07,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:07,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:07,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:08,477 INFO L124 PetriNetUnfolderBase]: 464/815 cut-off events. [2024-06-14 15:48:08,477 INFO L125 PetriNetUnfolderBase]: For 42515/42515 co-relation queries the response was YES. [2024-06-14 15:48:08,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5818 conditions, 815 events. 464/815 cut-off events. For 42515/42515 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3641 event pairs, 56 based on Foata normal form. 2/816 useless extension candidates. Maximal degree in co-relation 5719. Up to 698 conditions per place. [2024-06-14 15:48:08,484 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 164 selfloop transitions, 47 changer transitions 0/213 dead transitions. [2024-06-14 15:48:08,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 213 transitions, 2540 flow [2024-06-14 15:48:08,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:48:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:48:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-14 15:48:08,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 15:48:08,485 INFO L175 Difference]: Start difference. First operand has 202 places, 193 transitions, 2058 flow. Second operand 11 states and 128 transitions. [2024-06-14 15:48:08,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 213 transitions, 2540 flow [2024-06-14 15:48:08,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 213 transitions, 2427 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 15:48:08,577 INFO L231 Difference]: Finished difference. Result has 206 places, 194 transitions, 2058 flow [2024-06-14 15:48:08,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1945, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2058, PETRI_PLACES=206, PETRI_TRANSITIONS=194} [2024-06-14 15:48:08,577 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 175 predicate places. [2024-06-14 15:48:08,577 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 194 transitions, 2058 flow [2024-06-14 15:48:08,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:08,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:08,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:08,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:48:08,578 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:08,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:08,578 INFO L85 PathProgramCache]: Analyzing trace with hash -764965344, now seen corresponding path program 2 times [2024-06-14 15:48:08,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:08,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945853742] [2024-06-14 15:48:08,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:08,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:15,100 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-14 15:48:15,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:15,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945853742] [2024-06-14 15:48:15,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945853742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:15,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:15,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:15,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292922484] [2024-06-14 15:48:15,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:15,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:15,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:15,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:15,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:15,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:15,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 194 transitions, 2058 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:15,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:15,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:15,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:15,925 INFO L124 PetriNetUnfolderBase]: 470/825 cut-off events. [2024-06-14 15:48:15,925 INFO L125 PetriNetUnfolderBase]: For 42849/42849 co-relation queries the response was YES. [2024-06-14 15:48:15,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5894 conditions, 825 events. 470/825 cut-off events. For 42849/42849 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3715 event pairs, 57 based on Foata normal form. 1/825 useless extension candidates. Maximal degree in co-relation 5794. Up to 713 conditions per place. [2024-06-14 15:48:15,932 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 162 selfloop transitions, 50 changer transitions 0/214 dead transitions. [2024-06-14 15:48:15,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 214 transitions, 2672 flow [2024-06-14 15:48:15,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:15,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 15:48:15,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 15:48:15,935 INFO L175 Difference]: Start difference. First operand has 206 places, 194 transitions, 2058 flow. Second operand 10 states and 118 transitions. [2024-06-14 15:48:15,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 214 transitions, 2672 flow [2024-06-14 15:48:16,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 214 transitions, 2561 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:48:16,043 INFO L231 Difference]: Finished difference. Result has 206 places, 198 transitions, 2099 flow [2024-06-14 15:48:16,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1947, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2099, PETRI_PLACES=206, PETRI_TRANSITIONS=198} [2024-06-14 15:48:16,044 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 175 predicate places. [2024-06-14 15:48:16,044 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 198 transitions, 2099 flow [2024-06-14 15:48:16,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:16,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:16,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:16,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:48:16,045 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:16,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:16,046 INFO L85 PathProgramCache]: Analyzing trace with hash -764960508, now seen corresponding path program 1 times [2024-06-14 15:48:16,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:16,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266303822] [2024-06-14 15:48:16,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:16,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:22,832 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-14 15:48:22,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:22,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266303822] [2024-06-14 15:48:22,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266303822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:22,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:22,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:22,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114736544] [2024-06-14 15:48:22,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:22,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:22,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:22,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:22,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:23,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:48:23,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 198 transitions, 2099 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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-14 15:48:23,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:23,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:48:23,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:23,416 INFO L124 PetriNetUnfolderBase]: 494/865 cut-off events. [2024-06-14 15:48:23,417 INFO L125 PetriNetUnfolderBase]: For 51900/51900 co-relation queries the response was YES. [2024-06-14 15:48:23,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6296 conditions, 865 events. 494/865 cut-off events. For 51900/51900 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3920 event pairs, 57 based on Foata normal form. 4/868 useless extension candidates. Maximal degree in co-relation 6196. Up to 680 conditions per place. [2024-06-14 15:48:23,425 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 161 selfloop transitions, 58 changer transitions 0/221 dead transitions. [2024-06-14 15:48:23,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 221 transitions, 2783 flow [2024-06-14 15:48:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:23,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 15:48:23,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-14 15:48:23,426 INFO L175 Difference]: Start difference. First operand has 206 places, 198 transitions, 2099 flow. Second operand 10 states and 133 transitions. [2024-06-14 15:48:23,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 221 transitions, 2783 flow [2024-06-14 15:48:23,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 221 transitions, 2656 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:48:23,537 INFO L231 Difference]: Finished difference. Result has 208 places, 203 transitions, 2199 flow [2024-06-14 15:48:23,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1972, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2199, PETRI_PLACES=208, PETRI_TRANSITIONS=203} [2024-06-14 15:48:23,538 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 177 predicate places. [2024-06-14 15:48:23,538 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 203 transitions, 2199 flow [2024-06-14 15:48:23,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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-14 15:48:23,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:23,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:23,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:48:23,539 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:23,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:23,539 INFO L85 PathProgramCache]: Analyzing trace with hash -764965468, now seen corresponding path program 3 times [2024-06-14 15:48:23,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:23,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088103566] [2024-06-14 15:48:23,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:23,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:30,186 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-14 15:48:30,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:30,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088103566] [2024-06-14 15:48:30,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088103566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:30,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:30,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:30,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001368807] [2024-06-14 15:48:30,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:30,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:30,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:30,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:30,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:30,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:30,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 203 transitions, 2199 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:30,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:30,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:30,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:30,858 INFO L124 PetriNetUnfolderBase]: 491/860 cut-off events. [2024-06-14 15:48:30,858 INFO L125 PetriNetUnfolderBase]: For 47747/47747 co-relation queries the response was YES. [2024-06-14 15:48:30,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6247 conditions, 860 events. 491/860 cut-off events. For 47747/47747 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3913 event pairs, 62 based on Foata normal form. 2/861 useless extension candidates. Maximal degree in co-relation 6146. Up to 769 conditions per place. [2024-06-14 15:48:30,865 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 178 selfloop transitions, 39 changer transitions 0/219 dead transitions. [2024-06-14 15:48:30,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 219 transitions, 2673 flow [2024-06-14 15:48:30,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 15:48:30,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 15:48:30,866 INFO L175 Difference]: Start difference. First operand has 208 places, 203 transitions, 2199 flow. Second operand 10 states and 115 transitions. [2024-06-14 15:48:30,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 219 transitions, 2673 flow [2024-06-14 15:48:30,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 219 transitions, 2556 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-14 15:48:30,977 INFO L231 Difference]: Finished difference. Result has 212 places, 203 transitions, 2165 flow [2024-06-14 15:48:30,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2165, PETRI_PLACES=212, PETRI_TRANSITIONS=203} [2024-06-14 15:48:30,977 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 181 predicate places. [2024-06-14 15:48:30,977 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 203 transitions, 2165 flow [2024-06-14 15:48:30,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:30,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:30,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:30,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:48:30,978 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:30,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:30,978 INFO L85 PathProgramCache]: Analyzing trace with hash -654732820, now seen corresponding path program 3 times [2024-06-14 15:48:30,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:30,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389230150] [2024-06-14 15:48:30,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:30,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:37,550 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-14 15:48:37,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:37,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389230150] [2024-06-14 15:48:37,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389230150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:37,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:37,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:37,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782633593] [2024-06-14 15:48:37,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:37,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:37,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:37,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:37,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:37,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:37,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 203 transitions, 2165 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:37,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:37,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:37,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:38,227 INFO L124 PetriNetUnfolderBase]: 487/853 cut-off events. [2024-06-14 15:48:38,227 INFO L125 PetriNetUnfolderBase]: For 46220/46220 co-relation queries the response was YES. [2024-06-14 15:48:38,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6089 conditions, 853 events. 487/853 cut-off events. For 46220/46220 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3866 event pairs, 62 based on Foata normal form. 1/853 useless extension candidates. Maximal degree in co-relation 5986. Up to 758 conditions per place. [2024-06-14 15:48:38,234 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 170 selfloop transitions, 46 changer transitions 0/218 dead transitions. [2024-06-14 15:48:38,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 218 transitions, 2635 flow [2024-06-14 15:48:38,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 15:48:38,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 15:48:38,236 INFO L175 Difference]: Start difference. First operand has 212 places, 203 transitions, 2165 flow. Second operand 10 states and 115 transitions. [2024-06-14 15:48:38,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 218 transitions, 2635 flow [2024-06-14 15:48:38,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 218 transitions, 2502 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-06-14 15:48:38,352 INFO L231 Difference]: Finished difference. Result has 212 places, 203 transitions, 2134 flow [2024-06-14 15:48:38,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2032, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2134, PETRI_PLACES=212, PETRI_TRANSITIONS=203} [2024-06-14 15:48:38,352 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 181 predicate places. [2024-06-14 15:48:38,352 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 203 transitions, 2134 flow [2024-06-14 15:48:38,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:38,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:38,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:38,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:48:38,353 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:38,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1981375882, now seen corresponding path program 2 times [2024-06-14 15:48:38,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:38,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641009610] [2024-06-14 15:48:38,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:38,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:45,245 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-14 15:48:45,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:45,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641009610] [2024-06-14 15:48:45,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641009610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:45,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:45,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304298459] [2024-06-14 15:48:45,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:45,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:45,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:45,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:45,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:45,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:45,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 203 transitions, 2134 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:45,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:45,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:45,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:45,866 INFO L124 PetriNetUnfolderBase]: 513/895 cut-off events. [2024-06-14 15:48:45,867 INFO L125 PetriNetUnfolderBase]: For 56416/56416 co-relation queries the response was YES. [2024-06-14 15:48:45,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6563 conditions, 895 events. 513/895 cut-off events. For 56416/56416 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4117 event pairs, 45 based on Foata normal form. 2/896 useless extension candidates. Maximal degree in co-relation 6459. Up to 546 conditions per place. [2024-06-14 15:48:45,875 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 156 selfloop transitions, 72 changer transitions 0/230 dead transitions. [2024-06-14 15:48:45,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 230 transitions, 2987 flow [2024-06-14 15:48:45,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:45,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 15:48:45,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-14 15:48:45,877 INFO L175 Difference]: Start difference. First operand has 212 places, 203 transitions, 2134 flow. Second operand 10 states and 133 transitions. [2024-06-14 15:48:45,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 230 transitions, 2987 flow [2024-06-14 15:48:46,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 230 transitions, 2863 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-14 15:48:46,003 INFO L231 Difference]: Finished difference. Result has 213 places, 210 transitions, 2299 flow [2024-06-14 15:48:46,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2010, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2299, PETRI_PLACES=213, PETRI_TRANSITIONS=210} [2024-06-14 15:48:46,004 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 182 predicate places. [2024-06-14 15:48:46,004 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 210 transitions, 2299 flow [2024-06-14 15:48:46,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:46,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:46,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:46,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 15:48:46,005 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:46,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:46,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1981376068, now seen corresponding path program 4 times [2024-06-14 15:48:46,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:46,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849120606] [2024-06-14 15:48:46,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:46,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:52,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:52,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849120606] [2024-06-14 15:48:52,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849120606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:52,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:52,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:52,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718375793] [2024-06-14 15:48:52,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:52,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:52,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:52,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:52,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:52,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:52,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 210 transitions, 2299 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:52,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:52,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:52,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:53,103 INFO L124 PetriNetUnfolderBase]: 516/900 cut-off events. [2024-06-14 15:48:53,103 INFO L125 PetriNetUnfolderBase]: For 57216/57216 co-relation queries the response was YES. [2024-06-14 15:48:53,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6777 conditions, 900 events. 516/900 cut-off events. For 57216/57216 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4135 event pairs, 48 based on Foata normal form. 1/900 useless extension candidates. Maximal degree in co-relation 6671. Up to 656 conditions per place. [2024-06-14 15:48:53,112 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 148 selfloop transitions, 77 changer transitions 0/227 dead transitions. [2024-06-14 15:48:53,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 227 transitions, 2827 flow [2024-06-14 15:48:53,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:53,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 15:48:53,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-14 15:48:53,113 INFO L175 Difference]: Start difference. First operand has 213 places, 210 transitions, 2299 flow. Second operand 10 states and 126 transitions. [2024-06-14 15:48:53,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 227 transitions, 2827 flow [2024-06-14 15:48:53,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 227 transitions, 2755 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-14 15:48:53,252 INFO L231 Difference]: Finished difference. Result has 219 places, 212 transitions, 2428 flow [2024-06-14 15:48:53,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2227, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2428, PETRI_PLACES=219, PETRI_TRANSITIONS=212} [2024-06-14 15:48:53,253 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 188 predicate places. [2024-06-14 15:48:53,253 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 212 transitions, 2428 flow [2024-06-14 15:48:53,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:53,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:53,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:53,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 15:48:53,254 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:53,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:53,254 INFO L85 PathProgramCache]: Analyzing trace with hash -649674174, now seen corresponding path program 5 times [2024-06-14 15:48:53,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:53,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801606573] [2024-06-14 15:48:53,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:53,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:59,885 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-14 15:48:59,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:59,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801606573] [2024-06-14 15:48:59,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801606573] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:59,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:59,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:59,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274940938] [2024-06-14 15:48:59,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:59,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:59,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:59,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:59,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:00,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:49:00,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 212 transitions, 2428 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:00,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:00,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:49:00,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:00,706 INFO L124 PetriNetUnfolderBase]: 524/913 cut-off events. [2024-06-14 15:49:00,706 INFO L125 PetriNetUnfolderBase]: For 61071/61071 co-relation queries the response was YES. [2024-06-14 15:49:00,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7131 conditions, 913 events. 524/913 cut-off events. For 61071/61071 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4205 event pairs, 51 based on Foata normal form. 1/913 useless extension candidates. Maximal degree in co-relation 7023. Up to 546 conditions per place. [2024-06-14 15:49:00,715 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 133 selfloop transitions, 100 changer transitions 0/235 dead transitions. [2024-06-14 15:49:00,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 235 transitions, 3300 flow [2024-06-14 15:49:00,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:00,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-14 15:49:00,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-14 15:49:00,717 INFO L175 Difference]: Start difference. First operand has 219 places, 212 transitions, 2428 flow. Second operand 10 states and 131 transitions. [2024-06-14 15:49:00,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 235 transitions, 3300 flow [2024-06-14 15:49:00,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 235 transitions, 3115 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-14 15:49:00,861 INFO L231 Difference]: Finished difference. Result has 221 places, 218 transitions, 2578 flow [2024-06-14 15:49:00,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2243, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2578, PETRI_PLACES=221, PETRI_TRANSITIONS=218} [2024-06-14 15:49:00,862 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 190 predicate places. [2024-06-14 15:49:00,862 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 218 transitions, 2578 flow [2024-06-14 15:49:00,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:00,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:00,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:00,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 15:49:00,863 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:00,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:00,863 INFO L85 PathProgramCache]: Analyzing trace with hash -649489848, now seen corresponding path program 3 times [2024-06-14 15:49:00,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:00,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138916926] [2024-06-14 15:49:00,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:00,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:08,027 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-14 15:49:08,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:08,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138916926] [2024-06-14 15:49:08,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138916926] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:08,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:08,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:08,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438175165] [2024-06-14 15:49:08,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:08,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:08,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:08,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:08,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:08,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:49:08,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 218 transitions, 2578 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:08,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:08,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:49:08,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:08,845 INFO L124 PetriNetUnfolderBase]: 530/923 cut-off events. [2024-06-14 15:49:08,845 INFO L125 PetriNetUnfolderBase]: For 64997/64997 co-relation queries the response was YES. [2024-06-14 15:49:08,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7256 conditions, 923 events. 530/923 cut-off events. For 64997/64997 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4288 event pairs, 45 based on Foata normal form. 2/924 useless extension candidates. Maximal degree in co-relation 7147. Up to 570 conditions per place. [2024-06-14 15:49:08,854 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 154 selfloop transitions, 83 changer transitions 0/239 dead transitions. [2024-06-14 15:49:08,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 239 transitions, 3372 flow [2024-06-14 15:49:08,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-14 15:49:08,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:49:08,856 INFO L175 Difference]: Start difference. First operand has 221 places, 218 transitions, 2578 flow. Second operand 10 states and 130 transitions. [2024-06-14 15:49:08,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 239 transitions, 3372 flow [2024-06-14 15:49:09,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 239 transitions, 3254 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-14 15:49:09,011 INFO L231 Difference]: Finished difference. Result has 226 places, 220 transitions, 2659 flow [2024-06-14 15:49:09,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2460, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2659, PETRI_PLACES=226, PETRI_TRANSITIONS=220} [2024-06-14 15:49:09,011 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 195 predicate places. [2024-06-14 15:49:09,011 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 220 transitions, 2659 flow [2024-06-14 15:49:09,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:09,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:09,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:09,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 15:49:09,012 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:09,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:09,012 INFO L85 PathProgramCache]: Analyzing trace with hash -649674298, now seen corresponding path program 4 times [2024-06-14 15:49:09,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:09,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457809986] [2024-06-14 15:49:09,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:09,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:16,490 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-14 15:49:16,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:16,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457809986] [2024-06-14 15:49:16,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457809986] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:16,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:16,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:16,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122844941] [2024-06-14 15:49:16,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:16,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:16,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:16,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:16,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:16,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:49:16,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 220 transitions, 2659 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:16,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:16,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:49:16,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:17,220 INFO L124 PetriNetUnfolderBase]: 534/931 cut-off events. [2024-06-14 15:49:17,220 INFO L125 PetriNetUnfolderBase]: For 67651/67651 co-relation queries the response was YES. [2024-06-14 15:49:17,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7457 conditions, 931 events. 534/931 cut-off events. For 67651/67651 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4317 event pairs, 66 based on Foata normal form. 2/932 useless extension candidates. Maximal degree in co-relation 7346. Up to 816 conditions per place. [2024-06-14 15:49:17,229 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 187 selfloop transitions, 46 changer transitions 0/235 dead transitions. [2024-06-14 15:49:17,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 235 transitions, 3179 flow [2024-06-14 15:49:17,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:17,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 15:49:17,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-14 15:49:17,231 INFO L175 Difference]: Start difference. First operand has 226 places, 220 transitions, 2659 flow. Second operand 10 states and 117 transitions. [2024-06-14 15:49:17,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 235 transitions, 3179 flow [2024-06-14 15:49:17,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 235 transitions, 3007 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-14 15:49:17,403 INFO L231 Difference]: Finished difference. Result has 229 places, 221 transitions, 2605 flow [2024-06-14 15:49:17,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2605, PETRI_PLACES=229, PETRI_TRANSITIONS=221} [2024-06-14 15:49:17,403 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 198 predicate places. [2024-06-14 15:49:17,403 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 221 transitions, 2605 flow [2024-06-14 15:49:17,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:17,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:17,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:17,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 15:49:17,404 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:17,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash -649496544, now seen corresponding path program 6 times [2024-06-14 15:49:17,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:17,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354785845] [2024-06-14 15:49:17,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:17,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:23,904 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-14 15:49:23,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:23,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354785845] [2024-06-14 15:49:23,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354785845] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:23,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:23,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:23,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039648788] [2024-06-14 15:49:23,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:23,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:23,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:23,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:23,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:24,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:49:24,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 221 transitions, 2605 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:24,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:24,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:49:24,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:24,604 INFO L124 PetriNetUnfolderBase]: 532/928 cut-off events. [2024-06-14 15:49:24,604 INFO L125 PetriNetUnfolderBase]: For 65307/65307 co-relation queries the response was YES. [2024-06-14 15:49:24,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7274 conditions, 928 events. 532/928 cut-off events. For 65307/65307 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4332 event pairs, 49 based on Foata normal form. 1/928 useless extension candidates. Maximal degree in co-relation 7162. Up to 684 conditions per place. [2024-06-14 15:49:24,612 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 153 selfloop transitions, 81 changer transitions 0/236 dead transitions. [2024-06-14 15:49:24,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 236 transitions, 3113 flow [2024-06-14 15:49:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 15:49:24,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:49:24,613 INFO L175 Difference]: Start difference. First operand has 229 places, 221 transitions, 2605 flow. Second operand 10 states and 125 transitions. [2024-06-14 15:49:24,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 236 transitions, 3113 flow [2024-06-14 15:49:24,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 236 transitions, 2987 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-14 15:49:24,778 INFO L231 Difference]: Finished difference. Result has 231 places, 221 transitions, 2646 flow [2024-06-14 15:49:24,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2479, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2646, PETRI_PLACES=231, PETRI_TRANSITIONS=221} [2024-06-14 15:49:24,778 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 200 predicate places. [2024-06-14 15:49:24,779 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 221 transitions, 2646 flow [2024-06-14 15:49:24,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:24,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:24,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:24,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 15:49:24,779 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:24,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash -649496358, now seen corresponding path program 4 times [2024-06-14 15:49:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:24,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726177822] [2024-06-14 15:49:24,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:24,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:31,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:31,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726177822] [2024-06-14 15:49:31,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726177822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:31,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:31,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:31,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258104685] [2024-06-14 15:49:31,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:31,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:31,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:31,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:31,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:31,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:49:31,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 221 transitions, 2646 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:31,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:31,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:49:31,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:32,447 INFO L124 PetriNetUnfolderBase]: 528/922 cut-off events. [2024-06-14 15:49:32,448 INFO L125 PetriNetUnfolderBase]: For 65487/65487 co-relation queries the response was YES. [2024-06-14 15:49:32,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7203 conditions, 922 events. 528/922 cut-off events. For 65487/65487 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4298 event pairs, 44 based on Foata normal form. 2/923 useless extension candidates. Maximal degree in co-relation 7090. Up to 572 conditions per place. [2024-06-14 15:49:32,457 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 160 selfloop transitions, 78 changer transitions 0/240 dead transitions. [2024-06-14 15:49:32,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 240 transitions, 3302 flow [2024-06-14 15:49:32,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-14 15:49:32,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-14 15:49:32,459 INFO L175 Difference]: Start difference. First operand has 231 places, 221 transitions, 2646 flow. Second operand 10 states and 131 transitions. [2024-06-14 15:49:32,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 240 transitions, 3302 flow [2024-06-14 15:49:32,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 240 transitions, 3112 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-14 15:49:32,621 INFO L231 Difference]: Finished difference. Result has 232 places, 221 transitions, 2617 flow [2024-06-14 15:49:32,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2456, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2617, PETRI_PLACES=232, PETRI_TRANSITIONS=221} [2024-06-14 15:49:32,622 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 201 predicate places. [2024-06-14 15:49:32,622 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 221 transitions, 2617 flow [2024-06-14 15:49:32,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:32,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:32,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:32,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 15:49:32,623 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:32,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:32,623 INFO L85 PathProgramCache]: Analyzing trace with hash -484035040, now seen corresponding path program 7 times [2024-06-14 15:49:32,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:32,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371222] [2024-06-14 15:49:32,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:32,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:38,751 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-14 15:49:38,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:38,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371222] [2024-06-14 15:49:38,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371222] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:38,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:38,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:38,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160362822] [2024-06-14 15:49:38,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:38,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:38,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:38,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:38,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:38,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:49:38,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 221 transitions, 2617 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:38,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:38,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:49:38,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:39,318 INFO L124 PetriNetUnfolderBase]: 531/927 cut-off events. [2024-06-14 15:49:39,319 INFO L125 PetriNetUnfolderBase]: For 65497/65497 co-relation queries the response was YES. [2024-06-14 15:49:39,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7268 conditions, 927 events. 531/927 cut-off events. For 65497/65497 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4348 event pairs, 55 based on Foata normal form. 1/927 useless extension candidates. Maximal degree in co-relation 7154. Up to 802 conditions per place. [2024-06-14 15:49:39,328 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 197 selfloop transitions, 40 changer transitions 0/239 dead transitions. [2024-06-14 15:49:39,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 239 transitions, 3311 flow [2024-06-14 15:49:39,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:49:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:49:39,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 15:49:39,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-14 15:49:39,329 INFO L175 Difference]: Start difference. First operand has 232 places, 221 transitions, 2617 flow. Second operand 9 states and 118 transitions. [2024-06-14 15:49:39,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 239 transitions, 3311 flow [2024-06-14 15:49:39,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 239 transitions, 3166 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-14 15:49:39,506 INFO L231 Difference]: Finished difference. Result has 233 places, 223 transitions, 2605 flow [2024-06-14 15:49:39,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2472, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2605, PETRI_PLACES=233, PETRI_TRANSITIONS=223} [2024-06-14 15:49:39,506 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 202 predicate places. [2024-06-14 15:49:39,507 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 223 transitions, 2605 flow [2024-06-14 15:49:39,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:39,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:39,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:39,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 15:49:39,507 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:39,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:39,507 INFO L85 PathProgramCache]: Analyzing trace with hash -477601114, now seen corresponding path program 5 times [2024-06-14 15:49:39,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:39,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522934986] [2024-06-14 15:49:39,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:39,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:46,709 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-14 15:49:46,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:46,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522934986] [2024-06-14 15:49:46,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522934986] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:46,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:46,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:46,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448449840] [2024-06-14 15:49:46,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:46,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:46,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:46,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:46,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:46,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:49:46,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 223 transitions, 2605 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:46,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:46,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:49:46,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:47,377 INFO L124 PetriNetUnfolderBase]: 547/953 cut-off events. [2024-06-14 15:49:47,377 INFO L125 PetriNetUnfolderBase]: For 73810/73810 co-relation queries the response was YES. [2024-06-14 15:49:47,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7509 conditions, 953 events. 547/953 cut-off events. For 73810/73810 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4468 event pairs, 55 based on Foata normal form. 2/954 useless extension candidates. Maximal degree in co-relation 7394. Up to 843 conditions per place. [2024-06-14 15:49:47,386 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 211 selfloop transitions, 32 changer transitions 0/245 dead transitions. [2024-06-14 15:49:47,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 245 transitions, 3349 flow [2024-06-14 15:49:47,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 15:49:47,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 15:49:47,387 INFO L175 Difference]: Start difference. First operand has 233 places, 223 transitions, 2605 flow. Second operand 10 states and 123 transitions. [2024-06-14 15:49:47,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 245 transitions, 3349 flow [2024-06-14 15:49:47,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 245 transitions, 3149 flow, removed 26 selfloop flow, removed 9 redundant places. [2024-06-14 15:49:47,558 INFO L231 Difference]: Finished difference. Result has 234 places, 227 transitions, 2556 flow [2024-06-14 15:49:47,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2407, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2556, PETRI_PLACES=234, PETRI_TRANSITIONS=227} [2024-06-14 15:49:47,559 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2024-06-14 15:49:47,559 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 227 transitions, 2556 flow [2024-06-14 15:49:47,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:47,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:47,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:47,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 15:49:47,559 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:47,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:47,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1287731318, now seen corresponding path program 6 times [2024-06-14 15:49:47,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:47,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106392057] [2024-06-14 15:49:47,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:47,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:54,378 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-14 15:49:54,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:54,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106392057] [2024-06-14 15:49:54,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106392057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:54,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:54,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:54,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814641755] [2024-06-14 15:49:54,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:54,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:54,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:54,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:54,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:54,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:49:54,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 227 transitions, 2556 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:54,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:54,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:49:54,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:55,225 INFO L124 PetriNetUnfolderBase]: 563/979 cut-off events. [2024-06-14 15:49:55,225 INFO L125 PetriNetUnfolderBase]: For 78099/78099 co-relation queries the response was YES. [2024-06-14 15:49:55,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7730 conditions, 979 events. 563/979 cut-off events. For 78099/78099 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4634 event pairs, 65 based on Foata normal form. 2/980 useless extension candidates. Maximal degree in co-relation 7616. Up to 837 conditions per place. [2024-06-14 15:49:55,234 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 210 selfloop transitions, 38 changer transitions 0/250 dead transitions. [2024-06-14 15:49:55,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 250 transitions, 3462 flow [2024-06-14 15:49:55,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:49:55,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-14 15:49:55,238 INFO L175 Difference]: Start difference. First operand has 234 places, 227 transitions, 2556 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:49:55,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 250 transitions, 3462 flow [2024-06-14 15:49:55,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 250 transitions, 3372 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-14 15:49:55,415 INFO L231 Difference]: Finished difference. Result has 238 places, 231 transitions, 2647 flow [2024-06-14 15:49:55,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2466, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2647, PETRI_PLACES=238, PETRI_TRANSITIONS=231} [2024-06-14 15:49:55,415 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 207 predicate places. [2024-06-14 15:49:55,416 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 231 transitions, 2647 flow [2024-06-14 15:49:55,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:55,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:55,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:55,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 15:49:55,416 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:55,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:55,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1815736748, now seen corresponding path program 7 times [2024-06-14 15:49:55,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:55,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933913275] [2024-06-14 15:49:55,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:55,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:03,636 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-14 15:50:03,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:03,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933913275] [2024-06-14 15:50:03,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933913275] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:03,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:03,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:03,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632695078] [2024-06-14 15:50:03,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:03,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:03,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:03,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:03,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:03,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:50:03,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 231 transitions, 2647 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:03,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:03,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:50:03,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:04,409 INFO L124 PetriNetUnfolderBase]: 579/1005 cut-off events. [2024-06-14 15:50:04,410 INFO L125 PetriNetUnfolderBase]: For 85325/85325 co-relation queries the response was YES. [2024-06-14 15:50:04,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8122 conditions, 1005 events. 579/1005 cut-off events. For 85325/85325 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4798 event pairs, 57 based on Foata normal form. 2/1006 useless extension candidates. Maximal degree in co-relation 8006. Up to 858 conditions per place. [2024-06-14 15:50:04,419 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 208 selfloop transitions, 43 changer transitions 0/253 dead transitions. [2024-06-14 15:50:04,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 253 transitions, 3417 flow [2024-06-14 15:50:04,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 15:50:04,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-14 15:50:04,420 INFO L175 Difference]: Start difference. First operand has 238 places, 231 transitions, 2647 flow. Second operand 10 states and 126 transitions. [2024-06-14 15:50:04,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 253 transitions, 3417 flow [2024-06-14 15:50:04,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 253 transitions, 3356 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-14 15:50:04,612 INFO L231 Difference]: Finished difference. Result has 243 places, 235 transitions, 2765 flow [2024-06-14 15:50:04,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2586, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2765, PETRI_PLACES=243, PETRI_TRANSITIONS=235} [2024-06-14 15:50:04,613 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 212 predicate places. [2024-06-14 15:50:04,613 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 235 transitions, 2765 flow [2024-06-14 15:50:04,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:04,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:04,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:04,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 15:50:04,613 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:04,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:04,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1809061580, now seen corresponding path program 1 times [2024-06-14 15:50:04,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:04,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484480340] [2024-06-14 15:50:04,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:04,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:09,913 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-14 15:50:09,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:09,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484480340] [2024-06-14 15:50:09,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484480340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:09,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:09,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:09,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804322284] [2024-06-14 15:50:09,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:09,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:09,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:09,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:10,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:50:10,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 235 transitions, 2765 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-14 15:50:10,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:10,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:50:10,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:10,503 INFO L124 PetriNetUnfolderBase]: 583/1013 cut-off events. [2024-06-14 15:50:10,503 INFO L125 PetriNetUnfolderBase]: For 87459/87459 co-relation queries the response was YES. [2024-06-14 15:50:10,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8249 conditions, 1013 events. 583/1013 cut-off events. For 87459/87459 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4833 event pairs, 60 based on Foata normal form. 2/1014 useless extension candidates. Maximal degree in co-relation 8131. Up to 933 conditions per place. [2024-06-14 15:50:10,513 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 222 selfloop transitions, 27 changer transitions 0/251 dead transitions. [2024-06-14 15:50:10,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 251 transitions, 3330 flow [2024-06-14 15:50:10,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 15:50:10,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:50:10,514 INFO L175 Difference]: Start difference. First operand has 243 places, 235 transitions, 2765 flow. Second operand 9 states and 117 transitions. [2024-06-14 15:50:10,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 251 transitions, 3330 flow [2024-06-14 15:50:10,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 251 transitions, 3242 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-14 15:50:10,766 INFO L231 Difference]: Finished difference. Result has 247 places, 238 transitions, 2775 flow [2024-06-14 15:50:10,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2679, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2775, PETRI_PLACES=247, PETRI_TRANSITIONS=238} [2024-06-14 15:50:10,766 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 216 predicate places. [2024-06-14 15:50:10,767 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 238 transitions, 2775 flow [2024-06-14 15:50:10,767 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-14 15:50:10,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:10,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:10,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 15:50:10,767 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:10,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash -483850714, now seen corresponding path program 8 times [2024-06-14 15:50:10,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:10,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975814747] [2024-06-14 15:50:10,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:10,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:17,456 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-14 15:50:17,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:17,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975814747] [2024-06-14 15:50:17,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975814747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:17,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:17,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:17,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143480717] [2024-06-14 15:50:17,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:17,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:17,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:17,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:17,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:17,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:50:17,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 238 transitions, 2775 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:17,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:17,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:50:17,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:18,164 INFO L124 PetriNetUnfolderBase]: 609/1055 cut-off events. [2024-06-14 15:50:18,164 INFO L125 PetriNetUnfolderBase]: For 99779/99779 co-relation queries the response was YES. [2024-06-14 15:50:18,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8906 conditions, 1055 events. 609/1055 cut-off events. For 99779/99779 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5081 event pairs, 63 based on Foata normal form. 2/1056 useless extension candidates. Maximal degree in co-relation 8785. Up to 824 conditions per place. [2024-06-14 15:50:18,172 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 207 selfloop transitions, 55 changer transitions 0/264 dead transitions. [2024-06-14 15:50:18,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 264 transitions, 3905 flow [2024-06-14 15:50:18,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-14 15:50:18,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-14 15:50:18,173 INFO L175 Difference]: Start difference. First operand has 247 places, 238 transitions, 2775 flow. Second operand 10 states and 134 transitions. [2024-06-14 15:50:18,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 264 transitions, 3905 flow [2024-06-14 15:50:18,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 264 transitions, 3843 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 15:50:18,402 INFO L231 Difference]: Finished difference. Result has 251 places, 244 transitions, 2974 flow [2024-06-14 15:50:18,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2713, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2974, PETRI_PLACES=251, PETRI_TRANSITIONS=244} [2024-06-14 15:50:18,403 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 220 predicate places. [2024-06-14 15:50:18,403 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 244 transitions, 2974 flow [2024-06-14 15:50:18,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:18,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:18,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:18,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 15:50:18,404 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:18,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:18,404 INFO L85 PathProgramCache]: Analyzing trace with hash -484035164, now seen corresponding path program 5 times [2024-06-14 15:50:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:18,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424618337] [2024-06-14 15:50:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:18,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:24,437 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-14 15:50:24,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:24,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424618337] [2024-06-14 15:50:24,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424618337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:24,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:24,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:24,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140461725] [2024-06-14 15:50:24,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:24,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:24,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:24,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:24,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:24,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:50:24,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 244 transitions, 2974 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:24,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:24,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:50:24,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:25,096 INFO L124 PetriNetUnfolderBase]: 613/1063 cut-off events. [2024-06-14 15:50:25,096 INFO L125 PetriNetUnfolderBase]: For 102900/102900 co-relation queries the response was YES. [2024-06-14 15:50:25,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9107 conditions, 1063 events. 613/1063 cut-off events. For 102900/102900 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5136 event pairs, 86 based on Foata normal form. 2/1064 useless extension candidates. Maximal degree in co-relation 8985. Up to 1013 conditions per place. [2024-06-14 15:50:25,106 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 233 selfloop transitions, 22 changer transitions 0/257 dead transitions. [2024-06-14 15:50:25,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 257 transitions, 3534 flow [2024-06-14 15:50:25,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-14 15:50:25,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-14 15:50:25,107 INFO L175 Difference]: Start difference. First operand has 251 places, 244 transitions, 2974 flow. Second operand 10 states and 111 transitions. [2024-06-14 15:50:25,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 257 transitions, 3534 flow [2024-06-14 15:50:25,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 257 transitions, 3371 flow, removed 37 selfloop flow, removed 7 redundant places. [2024-06-14 15:50:25,324 INFO L231 Difference]: Finished difference. Result has 254 places, 245 transitions, 2883 flow [2024-06-14 15:50:25,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2811, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2883, PETRI_PLACES=254, PETRI_TRANSITIONS=245} [2024-06-14 15:50:25,325 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 223 predicate places. [2024-06-14 15:50:25,325 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 245 transitions, 2883 flow [2024-06-14 15:50:25,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:25,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:25,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:25,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 15:50:25,326 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:25,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:25,326 INFO L85 PathProgramCache]: Analyzing trace with hash -483857224, now seen corresponding path program 9 times [2024-06-14 15:50:25,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:25,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950239277] [2024-06-14 15:50:25,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:25,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:31,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-14 15:50:31,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:31,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950239277] [2024-06-14 15:50:31,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950239277] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:31,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:31,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:31,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625282086] [2024-06-14 15:50:31,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:31,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:31,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:31,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:31,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:31,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:50:31,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 245 transitions, 2883 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:31,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:31,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:50:31,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:32,366 INFO L124 PetriNetUnfolderBase]: 627/1087 cut-off events. [2024-06-14 15:50:32,366 INFO L125 PetriNetUnfolderBase]: For 109703/109703 co-relation queries the response was YES. [2024-06-14 15:50:32,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9087 conditions, 1087 events. 627/1087 cut-off events. For 109703/109703 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5283 event pairs, 67 based on Foata normal form. 4/1090 useless extension candidates. Maximal degree in co-relation 8965. Up to 849 conditions per place. [2024-06-14 15:50:32,376 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 212 selfloop transitions, 55 changer transitions 0/269 dead transitions. [2024-06-14 15:50:32,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 269 transitions, 3971 flow [2024-06-14 15:50:32,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-14 15:50:32,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-14 15:50:32,378 INFO L175 Difference]: Start difference. First operand has 254 places, 245 transitions, 2883 flow. Second operand 10 states and 135 transitions. [2024-06-14 15:50:32,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 269 transitions, 3971 flow [2024-06-14 15:50:32,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 269 transitions, 3895 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-14 15:50:32,646 INFO L231 Difference]: Finished difference. Result has 256 places, 249 transitions, 3003 flow [2024-06-14 15:50:32,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2807, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3003, PETRI_PLACES=256, PETRI_TRANSITIONS=249} [2024-06-14 15:50:32,647 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 225 predicate places. [2024-06-14 15:50:32,647 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 249 transitions, 3003 flow [2024-06-14 15:50:32,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:32,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:32,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:32,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 15:50:32,648 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:32,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:32,648 INFO L85 PathProgramCache]: Analyzing trace with hash -483857410, now seen corresponding path program 8 times [2024-06-14 15:50:32,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:32,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326204322] [2024-06-14 15:50:32,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:32,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:39,431 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-14 15:50:39,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:39,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326204322] [2024-06-14 15:50:39,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326204322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:39,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:39,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:39,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099386289] [2024-06-14 15:50:39,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:39,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:39,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:39,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:39,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:39,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:50:39,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 249 transitions, 3003 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:39,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:39,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:50:39,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:40,216 INFO L124 PetriNetUnfolderBase]: 623/1080 cut-off events. [2024-06-14 15:50:40,216 INFO L125 PetriNetUnfolderBase]: For 103100/103100 co-relation queries the response was YES. [2024-06-14 15:50:40,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9063 conditions, 1080 events. 623/1080 cut-off events. For 103100/103100 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5222 event pairs, 72 based on Foata normal form. 1/1080 useless extension candidates. Maximal degree in co-relation 8940. Up to 975 conditions per place. [2024-06-14 15:50:40,231 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 224 selfloop transitions, 37 changer transitions 0/263 dead transitions. [2024-06-14 15:50:40,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 263 transitions, 3563 flow [2024-06-14 15:50:40,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 15:50:40,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 15:50:40,233 INFO L175 Difference]: Start difference. First operand has 256 places, 249 transitions, 3003 flow. Second operand 10 states and 123 transitions. [2024-06-14 15:50:40,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 263 transitions, 3563 flow [2024-06-14 15:50:40,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 263 transitions, 3430 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-14 15:50:40,496 INFO L231 Difference]: Finished difference. Result has 260 places, 249 transitions, 2949 flow [2024-06-14 15:50:40,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2870, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2949, PETRI_PLACES=260, PETRI_TRANSITIONS=249} [2024-06-14 15:50:40,497 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 229 predicate places. [2024-06-14 15:50:40,497 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 249 transitions, 2949 flow [2024-06-14 15:50:40,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:40,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:40,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:40,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 15:50:40,497 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:40,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:40,498 INFO L85 PathProgramCache]: Analyzing trace with hash 63022598, now seen corresponding path program 2 times [2024-06-14 15:50:40,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:40,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429582329] [2024-06-14 15:50:40,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:40,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:45,693 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-14 15:50:45,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:45,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429582329] [2024-06-14 15:50:45,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429582329] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:45,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:45,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:45,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362603061] [2024-06-14 15:50:45,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:45,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:45,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:45,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:45,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:45,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:50:45,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 249 transitions, 2949 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-14 15:50:45,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:45,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:50:45,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:46,402 INFO L124 PetriNetUnfolderBase]: 627/1088 cut-off events. [2024-06-14 15:50:46,402 INFO L125 PetriNetUnfolderBase]: For 108148/108148 co-relation queries the response was YES. [2024-06-14 15:50:46,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9029 conditions, 1088 events. 627/1088 cut-off events. For 108148/108148 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5289 event pairs, 88 based on Foata normal form. 2/1089 useless extension candidates. Maximal degree in co-relation 8905. Up to 1042 conditions per place. [2024-06-14 15:50:46,411 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 244 selfloop transitions, 17 changer transitions 0/263 dead transitions. [2024-06-14 15:50:46,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 263 transitions, 3537 flow [2024-06-14 15:50:46,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 15:50:46,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-14 15:50:46,413 INFO L175 Difference]: Start difference. First operand has 260 places, 249 transitions, 2949 flow. Second operand 9 states and 111 transitions. [2024-06-14 15:50:46,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 263 transitions, 3537 flow [2024-06-14 15:50:46,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 263 transitions, 3442 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 15:50:46,686 INFO L231 Difference]: Finished difference. Result has 261 places, 252 transitions, 2937 flow [2024-06-14 15:50:46,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2856, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2937, PETRI_PLACES=261, PETRI_TRANSITIONS=252} [2024-06-14 15:50:46,687 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 230 predicate places. [2024-06-14 15:50:46,687 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 252 transitions, 2937 flow [2024-06-14 15:50:46,687 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-14 15:50:46,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:46,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:46,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 15:50:46,688 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:46,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:46,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1251141752, now seen corresponding path program 10 times [2024-06-14 15:50:46,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:46,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444449202] [2024-06-14 15:50:46,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:46,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:53,031 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-14 15:50:53,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:53,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444449202] [2024-06-14 15:50:53,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444449202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:53,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:53,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:53,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669263750] [2024-06-14 15:50:53,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:53,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:53,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:53,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:53,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:53,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:50:53,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 252 transitions, 2937 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:53,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:53,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:50:53,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:53,768 INFO L124 PetriNetUnfolderBase]: 689/1188 cut-off events. [2024-06-14 15:50:53,769 INFO L125 PetriNetUnfolderBase]: For 144455/144455 co-relation queries the response was YES. [2024-06-14 15:50:53,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10563 conditions, 1188 events. 689/1188 cut-off events. For 144455/144455 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5860 event pairs, 89 based on Foata normal form. 4/1191 useless extension candidates. Maximal degree in co-relation 10437. Up to 938 conditions per place. [2024-06-14 15:50:53,781 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 235 selfloop transitions, 48 changer transitions 0/285 dead transitions. [2024-06-14 15:50:53,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 285 transitions, 4347 flow [2024-06-14 15:50:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:53,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:50:53,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-14 15:50:53,782 INFO L175 Difference]: Start difference. First operand has 261 places, 252 transitions, 2937 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:50:53,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 285 transitions, 4347 flow [2024-06-14 15:50:54,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 285 transitions, 4303 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 15:50:54,185 INFO L231 Difference]: Finished difference. Result has 265 places, 264 transitions, 3305 flow [2024-06-14 15:50:54,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2893, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3305, PETRI_PLACES=265, PETRI_TRANSITIONS=264} [2024-06-14 15:50:54,186 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 234 predicate places. [2024-06-14 15:50:54,186 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 264 transitions, 3305 flow [2024-06-14 15:50:54,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:54,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:54,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:54,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 15:50:54,186 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:54,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:54,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1200854056, now seen corresponding path program 11 times [2024-06-14 15:50:54,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:54,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589877504] [2024-06-14 15:50:54,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:54,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:01,817 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-14 15:51:01,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:01,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589877504] [2024-06-14 15:51:01,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589877504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:01,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:01,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:01,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445982502] [2024-06-14 15:51:01,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:01,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:01,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:01,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:01,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:02,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:51:02,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 264 transitions, 3305 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:02,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:02,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:51:02,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:02,714 INFO L124 PetriNetUnfolderBase]: 685/1182 cut-off events. [2024-06-14 15:51:02,714 INFO L125 PetriNetUnfolderBase]: For 138661/138661 co-relation queries the response was YES. [2024-06-14 15:51:02,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10548 conditions, 1182 events. 685/1182 cut-off events. For 138661/138661 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5852 event pairs, 84 based on Foata normal form. 2/1183 useless extension candidates. Maximal degree in co-relation 10421. Up to 1023 conditions per place. [2024-06-14 15:51:02,727 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 242 selfloop transitions, 38 changer transitions 0/282 dead transitions. [2024-06-14 15:51:02,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 282 transitions, 4250 flow [2024-06-14 15:51:02,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 15:51:02,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:51:02,728 INFO L175 Difference]: Start difference. First operand has 265 places, 264 transitions, 3305 flow. Second operand 10 states and 120 transitions. [2024-06-14 15:51:02,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 282 transitions, 4250 flow [2024-06-14 15:51:03,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 282 transitions, 4098 flow, removed 67 selfloop flow, removed 4 redundant places. [2024-06-14 15:51:03,101 INFO L231 Difference]: Finished difference. Result has 271 places, 267 transitions, 3283 flow [2024-06-14 15:51:03,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3153, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3283, PETRI_PLACES=271, PETRI_TRANSITIONS=267} [2024-06-14 15:51:03,102 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 240 predicate places. [2024-06-14 15:51:03,102 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 267 transitions, 3283 flow [2024-06-14 15:51:03,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:03,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:03,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:03,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 15:51:03,103 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:03,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:03,103 INFO L85 PathProgramCache]: Analyzing trace with hash -964669768, now seen corresponding path program 3 times [2024-06-14 15:51:03,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:03,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033472681] [2024-06-14 15:51:03,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:03,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:08,229 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-14 15:51:08,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:08,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033472681] [2024-06-14 15:51:08,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033472681] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:08,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:08,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:08,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531063288] [2024-06-14 15:51:08,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:08,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:08,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:08,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:08,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:08,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:51:08,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 267 transitions, 3283 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:08,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:08,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:51:08,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:08,915 INFO L124 PetriNetUnfolderBase]: 689/1190 cut-off events. [2024-06-14 15:51:08,915 INFO L125 PetriNetUnfolderBase]: For 140553/140553 co-relation queries the response was YES. [2024-06-14 15:51:08,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10524 conditions, 1190 events. 689/1190 cut-off events. For 140553/140553 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5900 event pairs, 104 based on Foata normal form. 2/1191 useless extension candidates. Maximal degree in co-relation 10395. Up to 1148 conditions per place. [2024-06-14 15:51:08,929 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 259 selfloop transitions, 17 changer transitions 0/278 dead transitions. [2024-06-14 15:51:08,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 278 transitions, 3873 flow [2024-06-14 15:51:08,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:51:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:51:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-14 15:51:08,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:51:08,931 INFO L175 Difference]: Start difference. First operand has 271 places, 267 transitions, 3283 flow. Second operand 9 states and 99 transitions. [2024-06-14 15:51:08,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 278 transitions, 3873 flow [2024-06-14 15:51:09,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 278 transitions, 3687 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-14 15:51:09,327 INFO L231 Difference]: Finished difference. Result has 273 places, 268 transitions, 3152 flow [2024-06-14 15:51:09,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3097, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3152, PETRI_PLACES=273, PETRI_TRANSITIONS=268} [2024-06-14 15:51:09,328 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 242 predicate places. [2024-06-14 15:51:09,328 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 268 transitions, 3152 flow [2024-06-14 15:51:09,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:09,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:09,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:09,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 15:51:09,328 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:09,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:09,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1250968772, now seen corresponding path program 12 times [2024-06-14 15:51:09,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:09,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650971350] [2024-06-14 15:51:09,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:15,502 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-14 15:51:15,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:15,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650971350] [2024-06-14 15:51:15,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650971350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:15,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:15,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:15,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109999753] [2024-06-14 15:51:15,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:15,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:15,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:15,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:15,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:15,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:51:15,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 268 transitions, 3152 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:15,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:15,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:51:15,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:16,210 INFO L124 PetriNetUnfolderBase]: 691/1194 cut-off events. [2024-06-14 15:51:16,211 INFO L125 PetriNetUnfolderBase]: For 143432/143432 co-relation queries the response was YES. [2024-06-14 15:51:16,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10225 conditions, 1194 events. 691/1194 cut-off events. For 143432/143432 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5924 event pairs, 84 based on Foata normal form. 4/1197 useless extension candidates. Maximal degree in co-relation 10096. Up to 950 conditions per place. [2024-06-14 15:51:16,223 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 231 selfloop transitions, 54 changer transitions 0/287 dead transitions. [2024-06-14 15:51:16,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 287 transitions, 4119 flow [2024-06-14 15:51:16,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:51:16,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:51:16,224 INFO L175 Difference]: Start difference. First operand has 273 places, 268 transitions, 3152 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:51:16,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 287 transitions, 4119 flow [2024-06-14 15:51:16,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 287 transitions, 4060 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 15:51:16,591 INFO L231 Difference]: Finished difference. Result has 276 places, 270 transitions, 3251 flow [2024-06-14 15:51:16,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3093, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3251, PETRI_PLACES=276, PETRI_TRANSITIONS=270} [2024-06-14 15:51:16,591 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 245 predicate places. [2024-06-14 15:51:16,592 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 270 transitions, 3251 flow [2024-06-14 15:51:16,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:16,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:16,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:16,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 15:51:16,592 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:16,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash 618979080, now seen corresponding path program 13 times [2024-06-14 15:51:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:16,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497587886] [2024-06-14 15:51:16,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:16,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:23,653 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-14 15:51:23,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:23,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497587886] [2024-06-14 15:51:23,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497587886] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:23,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:23,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:23,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810273899] [2024-06-14 15:51:23,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:23,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:23,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:23,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:23,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:23,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:51:23,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 270 transitions, 3251 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 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-14 15:51:23,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:23,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:51:23,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:24,310 INFO L124 PetriNetUnfolderBase]: 707/1220 cut-off events. [2024-06-14 15:51:24,310 INFO L125 PetriNetUnfolderBase]: For 147373/147373 co-relation queries the response was YES. [2024-06-14 15:51:24,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10701 conditions, 1220 events. 707/1220 cut-off events. For 147373/147373 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6079 event pairs, 101 based on Foata normal form. 2/1221 useless extension candidates. Maximal degree in co-relation 10571. Up to 1147 conditions per place. [2024-06-14 15:51:24,324 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 265 selfloop transitions, 22 changer transitions 0/289 dead transitions. [2024-06-14 15:51:24,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 289 transitions, 4114 flow [2024-06-14 15:51:24,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2024-06-14 15:51:24,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325 [2024-06-14 15:51:24,325 INFO L175 Difference]: Start difference. First operand has 276 places, 270 transitions, 3251 flow. Second operand 10 states and 104 transitions. [2024-06-14 15:51:24,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 289 transitions, 4114 flow [2024-06-14 15:51:24,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 289 transitions, 3976 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-14 15:51:24,744 INFO L231 Difference]: Finished difference. Result has 280 places, 275 transitions, 3272 flow [2024-06-14 15:51:24,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3123, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3272, PETRI_PLACES=280, PETRI_TRANSITIONS=275} [2024-06-14 15:51:24,745 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 249 predicate places. [2024-06-14 15:51:24,745 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 275 transitions, 3272 flow [2024-06-14 15:51:24,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 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-14 15:51:24,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:24,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:24,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 15:51:24,745 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:24,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:24,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1250963812, now seen corresponding path program 6 times [2024-06-14 15:51:24,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:24,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690537730] [2024-06-14 15:51:24,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:24,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:30,863 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-14 15:51:30,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:30,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690537730] [2024-06-14 15:51:30,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690537730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:30,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:30,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:30,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37899882] [2024-06-14 15:51:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:30,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:30,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:30,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:30,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:31,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:51:31,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 275 transitions, 3272 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:31,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:31,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:51:31,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:31,530 INFO L124 PetriNetUnfolderBase]: 704/1215 cut-off events. [2024-06-14 15:51:31,531 INFO L125 PetriNetUnfolderBase]: For 144632/144632 co-relation queries the response was YES. [2024-06-14 15:51:31,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10455 conditions, 1215 events. 704/1215 cut-off events. For 144632/144632 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6045 event pairs, 111 based on Foata normal form. 2/1216 useless extension candidates. Maximal degree in co-relation 10323. Up to 1181 conditions per place. [2024-06-14 15:51:31,543 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 267 selfloop transitions, 16 changer transitions 0/285 dead transitions. [2024-06-14 15:51:31,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 285 transitions, 3860 flow [2024-06-14 15:51:31,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:31,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 15:51:31,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33125 [2024-06-14 15:51:31,544 INFO L175 Difference]: Start difference. First operand has 280 places, 275 transitions, 3272 flow. Second operand 10 states and 106 transitions. [2024-06-14 15:51:31,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 285 transitions, 3860 flow [2024-06-14 15:51:31,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 285 transitions, 3806 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-14 15:51:31,964 INFO L231 Difference]: Finished difference. Result has 284 places, 275 transitions, 3254 flow [2024-06-14 15:51:31,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3218, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3254, PETRI_PLACES=284, PETRI_TRANSITIONS=275} [2024-06-14 15:51:31,965 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 253 predicate places. [2024-06-14 15:51:31,965 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 275 transitions, 3254 flow [2024-06-14 15:51:31,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:31,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:31,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:31,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 15:51:31,966 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:31,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:31,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1246901268, now seen corresponding path program 14 times [2024-06-14 15:51:31,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:31,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175820693] [2024-06-14 15:51:31,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:31,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:38,064 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-14 15:51:38,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:38,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175820693] [2024-06-14 15:51:38,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175820693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:38,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:38,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:38,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214005051] [2024-06-14 15:51:38,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:38,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:38,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:38,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:38,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:38,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:51:38,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 275 transitions, 3254 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:38,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:38,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:51:38,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:38,815 INFO L124 PetriNetUnfolderBase]: 710/1225 cut-off events. [2024-06-14 15:51:38,815 INFO L125 PetriNetUnfolderBase]: For 148596/148596 co-relation queries the response was YES. [2024-06-14 15:51:38,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10540 conditions, 1225 events. 710/1225 cut-off events. For 148596/148596 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6122 event pairs, 99 based on Foata normal form. 2/1226 useless extension candidates. Maximal degree in co-relation 10406. Up to 1140 conditions per place. [2024-06-14 15:51:38,829 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 264 selfloop transitions, 26 changer transitions 0/292 dead transitions. [2024-06-14 15:51:38,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 292 transitions, 4075 flow [2024-06-14 15:51:38,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-14 15:51:38,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371875 [2024-06-14 15:51:38,830 INFO L175 Difference]: Start difference. First operand has 284 places, 275 transitions, 3254 flow. Second operand 10 states and 119 transitions. [2024-06-14 15:51:38,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 292 transitions, 4075 flow [2024-06-14 15:51:39,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 292 transitions, 3966 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-06-14 15:51:39,268 INFO L231 Difference]: Finished difference. Result has 284 places, 277 transitions, 3243 flow [2024-06-14 15:51:39,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3145, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3243, PETRI_PLACES=284, PETRI_TRANSITIONS=277} [2024-06-14 15:51:39,268 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 253 predicate places. [2024-06-14 15:51:39,268 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 277 transitions, 3243 flow [2024-06-14 15:51:39,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:39,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:39,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:39,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 15:51:39,269 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:39,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:39,269 INFO L85 PathProgramCache]: Analyzing trace with hash 893812996, now seen corresponding path program 15 times [2024-06-14 15:51:39,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:39,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7157656] [2024-06-14 15:51:39,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:39,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:45,588 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-14 15:51:45,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:45,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7157656] [2024-06-14 15:51:45,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7157656] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:45,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:45,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:45,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795909009] [2024-06-14 15:51:45,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:45,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:45,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:45,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:45,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:45,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:51:45,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 277 transitions, 3243 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:45,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:45,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:51:45,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:46,361 INFO L124 PetriNetUnfolderBase]: 712/1229 cut-off events. [2024-06-14 15:51:46,361 INFO L125 PetriNetUnfolderBase]: For 152189/152189 co-relation queries the response was YES. [2024-06-14 15:51:46,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10416 conditions, 1229 events. 712/1229 cut-off events. For 152189/152189 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6137 event pairs, 102 based on Foata normal form. 4/1232 useless extension candidates. Maximal degree in co-relation 10282. Up to 1166 conditions per place. [2024-06-14 15:51:46,372 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 268 selfloop transitions, 22 changer transitions 0/292 dead transitions. [2024-06-14 15:51:46,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 292 transitions, 3925 flow [2024-06-14 15:51:46,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-14 15:51:46,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-14 15:51:46,373 INFO L175 Difference]: Start difference. First operand has 284 places, 277 transitions, 3243 flow. Second operand 10 states and 111 transitions. [2024-06-14 15:51:46,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 292 transitions, 3925 flow [2024-06-14 15:51:46,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 292 transitions, 3709 flow, removed 32 selfloop flow, removed 13 redundant places. [2024-06-14 15:51:46,815 INFO L231 Difference]: Finished difference. Result has 281 places, 279 transitions, 3139 flow [2024-06-14 15:51:46,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3031, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3139, PETRI_PLACES=281, PETRI_TRANSITIONS=279} [2024-06-14 15:51:46,815 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 250 predicate places. [2024-06-14 15:51:46,815 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 279 transitions, 3139 flow [2024-06-14 15:51:46,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:46,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:46,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:46,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 15:51:46,816 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:46,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:46,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1468546308, now seen corresponding path program 16 times [2024-06-14 15:51:46,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:46,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809535487] [2024-06-14 15:51:46,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:46,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:54,613 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-14 15:51:54,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:54,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809535487] [2024-06-14 15:51:54,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809535487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:54,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:54,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:54,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020656833] [2024-06-14 15:51:54,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:54,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:54,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:54,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:54,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:54,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:51:54,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 279 transitions, 3139 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:54,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:54,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:51:54,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:55,343 INFO L124 PetriNetUnfolderBase]: 708/1223 cut-off events. [2024-06-14 15:51:55,343 INFO L125 PetriNetUnfolderBase]: For 142266/142266 co-relation queries the response was YES. [2024-06-14 15:51:55,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9921 conditions, 1223 events. 708/1223 cut-off events. For 142266/142266 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6134 event pairs, 97 based on Foata normal form. 2/1224 useless extension candidates. Maximal degree in co-relation 9792. Up to 1153 conditions per place. [2024-06-14 15:51:55,355 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 268 selfloop transitions, 22 changer transitions 0/292 dead transitions. [2024-06-14 15:51:55,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 292 transitions, 3755 flow [2024-06-14 15:51:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-14 15:51:55,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-14 15:51:55,356 INFO L175 Difference]: Start difference. First operand has 281 places, 279 transitions, 3139 flow. Second operand 10 states and 114 transitions. [2024-06-14 15:51:55,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 292 transitions, 3755 flow [2024-06-14 15:51:55,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 292 transitions, 3649 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-06-14 15:51:55,715 INFO L231 Difference]: Finished difference. Result has 283 places, 279 transitions, 3082 flow [2024-06-14 15:51:55,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3033, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3082, PETRI_PLACES=283, PETRI_TRANSITIONS=279} [2024-06-14 15:51:55,716 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 252 predicate places. [2024-06-14 15:51:55,716 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 279 transitions, 3082 flow [2024-06-14 15:51:55,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:55,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:55,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:55,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 15:51:55,716 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:55,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:55,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1257397862, now seen corresponding path program 17 times [2024-06-14 15:51:55,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:55,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871903547] [2024-06-14 15:51:55,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:55,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:02,012 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-14 15:52:02,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:02,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871903547] [2024-06-14 15:52:02,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871903547] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:02,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:02,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:02,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58670344] [2024-06-14 15:52:02,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:02,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:02,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:02,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:02,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:02,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:52:02,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 279 transitions, 3082 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:02,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:02,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:52:02,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:02,769 INFO L124 PetriNetUnfolderBase]: 704/1217 cut-off events. [2024-06-14 15:52:02,769 INFO L125 PetriNetUnfolderBase]: For 138491/138491 co-relation queries the response was YES. [2024-06-14 15:52:02,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9660 conditions, 1217 events. 704/1217 cut-off events. For 138491/138491 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6080 event pairs, 94 based on Foata normal form. 2/1218 useless extension candidates. Maximal degree in co-relation 9530. Up to 1135 conditions per place. [2024-06-14 15:52:02,783 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 265 selfloop transitions, 26 changer transitions 0/293 dead transitions. [2024-06-14 15:52:02,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 293 transitions, 3704 flow [2024-06-14 15:52:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:52:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:52:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 15:52:02,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-14 15:52:02,784 INFO L175 Difference]: Start difference. First operand has 283 places, 279 transitions, 3082 flow. Second operand 10 states and 117 transitions. [2024-06-14 15:52:02,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 293 transitions, 3704 flow [2024-06-14 15:52:03,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 293 transitions, 3595 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 15:52:03,181 INFO L231 Difference]: Finished difference. Result has 285 places, 279 transitions, 3030 flow [2024-06-14 15:52:03,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2973, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3030, PETRI_PLACES=285, PETRI_TRANSITIONS=279} [2024-06-14 15:52:03,182 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 254 predicate places. [2024-06-14 15:52:03,182 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 279 transitions, 3030 flow [2024-06-14 15:52:03,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:03,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:03,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:03,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 15:52:03,182 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:03,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:03,183 INFO L85 PathProgramCache]: Analyzing trace with hash 619225158, now seen corresponding path program 4 times [2024-06-14 15:52:03,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:03,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269173440] [2024-06-14 15:52:03,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:03,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:08,913 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-14 15:52:08,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:08,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269173440] [2024-06-14 15:52:08,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269173440] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:08,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:08,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:52:08,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808974033] [2024-06-14 15:52:08,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:08,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:52:08,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:08,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:52:08,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:52:09,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:52:09,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 279 transitions, 3030 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-14 15:52:09,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:09,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:52:09,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:09,563 INFO L124 PetriNetUnfolderBase]: 708/1225 cut-off events. [2024-06-14 15:52:09,563 INFO L125 PetriNetUnfolderBase]: For 141520/141520 co-relation queries the response was YES. [2024-06-14 15:52:09,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9703 conditions, 1225 events. 708/1225 cut-off events. For 141520/141520 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6132 event pairs, 106 based on Foata normal form. 2/1226 useless extension candidates. Maximal degree in co-relation 9572. Up to 1191 conditions per place. [2024-06-14 15:52:09,576 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 275 selfloop transitions, 14 changer transitions 0/291 dead transitions. [2024-06-14 15:52:09,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 291 transitions, 3664 flow [2024-06-14 15:52:09,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:52:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:52:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-14 15:52:09,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3715277777777778 [2024-06-14 15:52:09,578 INFO L175 Difference]: Start difference. First operand has 285 places, 279 transitions, 3030 flow. Second operand 9 states and 107 transitions. [2024-06-14 15:52:09,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 291 transitions, 3664 flow [2024-06-14 15:52:09,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 291 transitions, 3614 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-14 15:52:09,957 INFO L231 Difference]: Finished difference. Result has 286 places, 281 transitions, 3046 flow [2024-06-14 15:52:09,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2982, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3046, PETRI_PLACES=286, PETRI_TRANSITIONS=281} [2024-06-14 15:52:09,958 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 255 predicate places. [2024-06-14 15:52:09,958 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 281 transitions, 3046 flow [2024-06-14 15:52:09,958 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-14 15:52:09,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:09,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:09,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 15:52:09,959 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:09,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:09,959 INFO L85 PathProgramCache]: Analyzing trace with hash -964371238, now seen corresponding path program 5 times [2024-06-14 15:52:09,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:09,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700953241] [2024-06-14 15:52:09,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:09,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:15,134 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-14 15:52:15,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:15,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700953241] [2024-06-14 15:52:15,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700953241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:15,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:15,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:15,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912264305] [2024-06-14 15:52:15,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:15,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:15,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:15,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:15,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:15,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:52:15,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 281 transitions, 3046 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:15,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:15,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:52:15,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:15,856 INFO L124 PetriNetUnfolderBase]: 705/1220 cut-off events. [2024-06-14 15:52:15,857 INFO L125 PetriNetUnfolderBase]: For 137594/137594 co-relation queries the response was YES. [2024-06-14 15:52:15,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9528 conditions, 1220 events. 705/1220 cut-off events. For 137594/137594 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6106 event pairs, 105 based on Foata normal form. 2/1221 useless extension candidates. Maximal degree in co-relation 9396. Up to 1181 conditions per place. [2024-06-14 15:52:15,867 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 275 selfloop transitions, 14 changer transitions 0/291 dead transitions. [2024-06-14 15:52:15,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 291 transitions, 3646 flow [2024-06-14 15:52:15,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:52:15,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:52:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 15:52:15,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-14 15:52:15,869 INFO L175 Difference]: Start difference. First operand has 286 places, 281 transitions, 3046 flow. Second operand 9 states and 97 transitions. [2024-06-14 15:52:15,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 291 transitions, 3646 flow [2024-06-14 15:52:16,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 291 transitions, 3580 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 15:52:16,284 INFO L231 Difference]: Finished difference. Result has 286 places, 281 transitions, 3012 flow [2024-06-14 15:52:16,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2980, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3012, PETRI_PLACES=286, PETRI_TRANSITIONS=281} [2024-06-14 15:52:16,285 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 255 predicate places. [2024-06-14 15:52:16,285 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 281 transitions, 3012 flow [2024-06-14 15:52:16,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:16,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:16,285 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-14 15:52:16,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 15:52:16,285 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:16,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:16,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1435452579, now seen corresponding path program 1 times [2024-06-14 15:52:16,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:16,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810704911] [2024-06-14 15:52:16,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:16,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:23,898 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-14 15:52:23,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:23,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810704911] [2024-06-14 15:52:23,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810704911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:23,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:23,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:23,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743593275] [2024-06-14 15:52:23,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:23,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:23,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:23,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:23,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:24,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:52:24,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 281 transitions, 3012 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:52:24,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:24,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:52:24,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:24,827 INFO L124 PetriNetUnfolderBase]: 716/1241 cut-off events. [2024-06-14 15:52:24,827 INFO L125 PetriNetUnfolderBase]: For 148053/148053 co-relation queries the response was YES. [2024-06-14 15:52:24,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9826 conditions, 1241 events. 716/1241 cut-off events. For 148053/148053 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6257 event pairs, 79 based on Foata normal form. 2/1242 useless extension candidates. Maximal degree in co-relation 9695. Up to 1018 conditions per place. [2024-06-14 15:52:24,841 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 244 selfloop transitions, 60 changer transitions 0/306 dead transitions. [2024-06-14 15:52:24,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 306 transitions, 3886 flow [2024-06-14 15:52:24,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:52:24,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:52:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-14 15:52:24,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-14 15:52:24,842 INFO L175 Difference]: Start difference. First operand has 286 places, 281 transitions, 3012 flow. Second operand 12 states and 141 transitions. [2024-06-14 15:52:24,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 306 transitions, 3886 flow [2024-06-14 15:52:25,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 306 transitions, 3821 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 15:52:25,265 INFO L231 Difference]: Finished difference. Result has 290 places, 283 transitions, 3113 flow [2024-06-14 15:52:25,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2947, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3113, PETRI_PLACES=290, PETRI_TRANSITIONS=283} [2024-06-14 15:52:25,265 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 259 predicate places. [2024-06-14 15:52:25,266 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 283 transitions, 3113 flow [2024-06-14 15:52:25,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:52:25,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:25,266 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-14 15:52:25,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 15:52:25,266 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:25,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:25,266 INFO L85 PathProgramCache]: Analyzing trace with hash -659013803, now seen corresponding path program 2 times [2024-06-14 15:52:25,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:25,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339382034] [2024-06-14 15:52:25,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:25,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:31,654 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-14 15:52:31,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:31,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339382034] [2024-06-14 15:52:31,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339382034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:31,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:31,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:31,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111700401] [2024-06-14 15:52:31,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:31,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:31,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:31,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:31,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:31,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:52:31,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 283 transitions, 3113 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:52:31,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:31,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:52:31,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:32,579 INFO L124 PetriNetUnfolderBase]: 727/1262 cut-off events. [2024-06-14 15:52:32,579 INFO L125 PetriNetUnfolderBase]: For 159152/159152 co-relation queries the response was YES. [2024-06-14 15:52:32,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10259 conditions, 1262 events. 727/1262 cut-off events. For 159152/159152 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6409 event pairs, 92 based on Foata normal form. 2/1263 useless extension candidates. Maximal degree in co-relation 10127. Up to 1092 conditions per place. [2024-06-14 15:52:32,592 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 244 selfloop transitions, 61 changer transitions 0/307 dead transitions. [2024-06-14 15:52:32,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 307 transitions, 3993 flow [2024-06-14 15:52:32,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:52:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:52:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions. [2024-06-14 15:52:32,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3697916666666667 [2024-06-14 15:52:32,594 INFO L175 Difference]: Start difference. First operand has 290 places, 283 transitions, 3113 flow. Second operand 12 states and 142 transitions. [2024-06-14 15:52:32,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 307 transitions, 3993 flow [2024-06-14 15:52:33,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 307 transitions, 3848 flow, removed 22 selfloop flow, removed 9 redundant places. [2024-06-14 15:52:33,064 INFO L231 Difference]: Finished difference. Result has 293 places, 285 transitions, 3140 flow [2024-06-14 15:52:33,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2984, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3140, PETRI_PLACES=293, PETRI_TRANSITIONS=285} [2024-06-14 15:52:33,065 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 262 predicate places. [2024-06-14 15:52:33,065 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 285 transitions, 3140 flow [2024-06-14 15:52:33,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:52:33,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:33,065 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-14 15:52:33,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 15:52:33,065 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:33,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:33,065 INFO L85 PathProgramCache]: Analyzing trace with hash -659010083, now seen corresponding path program 3 times [2024-06-14 15:52:33,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:33,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510405167] [2024-06-14 15:52:33,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:39,394 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-14 15:52:39,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:39,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510405167] [2024-06-14 15:52:39,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510405167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:39,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:39,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:39,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668234882] [2024-06-14 15:52:39,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:39,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:39,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:39,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:39,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:39,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:52:39,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 285 transitions, 3140 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:52:39,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:39,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:52:39,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:40,260 INFO L124 PetriNetUnfolderBase]: 724/1257 cut-off events. [2024-06-14 15:52:40,260 INFO L125 PetriNetUnfolderBase]: For 155542/155542 co-relation queries the response was YES. [2024-06-14 15:52:40,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10039 conditions, 1257 events. 724/1257 cut-off events. For 155542/155542 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6373 event pairs, 93 based on Foata normal form. 2/1258 useless extension candidates. Maximal degree in co-relation 9906. Up to 1106 conditions per place. [2024-06-14 15:52:40,274 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 242 selfloop transitions, 61 changer transitions 0/305 dead transitions. [2024-06-14 15:52:40,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 305 transitions, 3796 flow [2024-06-14 15:52:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:52:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:52:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 139 transitions. [2024-06-14 15:52:40,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3619791666666667 [2024-06-14 15:52:40,275 INFO L175 Difference]: Start difference. First operand has 293 places, 285 transitions, 3140 flow. Second operand 12 states and 139 transitions. [2024-06-14 15:52:40,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 305 transitions, 3796 flow [2024-06-14 15:52:40,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 305 transitions, 3689 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 15:52:40,841 INFO L231 Difference]: Finished difference. Result has 297 places, 285 transitions, 3160 flow [2024-06-14 15:52:40,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3033, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3160, PETRI_PLACES=297, PETRI_TRANSITIONS=285} [2024-06-14 15:52:40,842 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 266 predicate places. [2024-06-14 15:52:40,842 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 285 transitions, 3160 flow [2024-06-14 15:52:40,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:52:40,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:40,842 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-14 15:52:40,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 15:52:40,842 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:40,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:40,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2056028812, now seen corresponding path program 1 times [2024-06-14 15:52:40,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:40,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991435387] [2024-06-14 15:52:40,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:40,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:49,041 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-14 15:52:49,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:49,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991435387] [2024-06-14 15:52:49,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991435387] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:49,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:49,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:49,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214016929] [2024-06-14 15:52:49,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:49,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:49,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:49,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:49,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:49,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:52:49,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 285 transitions, 3160 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:52:49,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:49,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:52:49,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:50,009 INFO L124 PetriNetUnfolderBase]: 720/1251 cut-off events. [2024-06-14 15:52:50,010 INFO L125 PetriNetUnfolderBase]: For 151180/151180 co-relation queries the response was YES. [2024-06-14 15:52:50,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9900 conditions, 1251 events. 720/1251 cut-off events. For 151180/151180 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6342 event pairs, 93 based on Foata normal form. 2/1252 useless extension candidates. Maximal degree in co-relation 9765. Up to 1146 conditions per place. [2024-06-14 15:52:50,025 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 255 selfloop transitions, 46 changer transitions 0/303 dead transitions. [2024-06-14 15:52:50,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 303 transitions, 3810 flow [2024-06-14 15:52:50,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:52:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:52:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-14 15:52:50,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-14 15:52:50,026 INFO L175 Difference]: Start difference. First operand has 297 places, 285 transitions, 3160 flow. Second operand 11 states and 126 transitions. [2024-06-14 15:52:50,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 303 transitions, 3810 flow [2024-06-14 15:52:50,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 303 transitions, 3663 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-06-14 15:52:50,485 INFO L231 Difference]: Finished difference. Result has 297 places, 285 transitions, 3110 flow [2024-06-14 15:52:50,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3013, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3110, PETRI_PLACES=297, PETRI_TRANSITIONS=285} [2024-06-14 15:52:50,486 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 266 predicate places. [2024-06-14 15:52:50,486 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 285 transitions, 3110 flow [2024-06-14 15:52:50,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:52:50,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:50,486 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-14 15:52:50,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 15:52:50,486 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:50,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:50,487 INFO L85 PathProgramCache]: Analyzing trace with hash 2056023077, now seen corresponding path program 4 times [2024-06-14 15:52:50,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:50,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653697581] [2024-06-14 15:52:50,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:50,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:56,960 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-14 15:52:56,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:56,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653697581] [2024-06-14 15:52:56,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653697581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:56,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:56,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:56,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340136756] [2024-06-14 15:52:56,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:56,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:56,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:56,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:56,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:57,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:52:57,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 285 transitions, 3110 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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-14 15:52:57,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:57,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:52:57,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:57,819 INFO L124 PetriNetUnfolderBase]: 724/1259 cut-off events. [2024-06-14 15:52:57,819 INFO L125 PetriNetUnfolderBase]: For 154390/154390 co-relation queries the response was YES. [2024-06-14 15:52:57,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9917 conditions, 1259 events. 724/1259 cut-off events. For 154390/154390 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6402 event pairs, 94 based on Foata normal form. 2/1260 useless extension candidates. Maximal degree in co-relation 9781. Up to 1096 conditions per place. [2024-06-14 15:52:57,830 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 245 selfloop transitions, 55 changer transitions 0/302 dead transitions. [2024-06-14 15:52:57,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 302 transitions, 3766 flow [2024-06-14 15:52:57,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:52:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:52:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 15:52:57,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 15:52:57,832 INFO L175 Difference]: Start difference. First operand has 297 places, 285 transitions, 3110 flow. Second operand 10 states and 118 transitions. [2024-06-14 15:52:57,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 302 transitions, 3766 flow [2024-06-14 15:52:58,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 302 transitions, 3600 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-14 15:52:58,288 INFO L231 Difference]: Finished difference. Result has 295 places, 286 transitions, 3082 flow [2024-06-14 15:52:58,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2944, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3082, PETRI_PLACES=295, PETRI_TRANSITIONS=286} [2024-06-14 15:52:58,289 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 264 predicate places. [2024-06-14 15:52:58,289 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 286 transitions, 3082 flow [2024-06-14 15:52:58,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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-14 15:52:58,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:58,289 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-14 15:52:58,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 15:52:58,290 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:58,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2055875207, now seen corresponding path program 5 times [2024-06-14 15:52:58,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:58,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180757384] [2024-06-14 15:52:58,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:58,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:04,794 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-14 15:53:04,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:04,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180757384] [2024-06-14 15:53:04,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180757384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:04,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:04,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:04,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225945551] [2024-06-14 15:53:04,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:04,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:04,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:04,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:04,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:05,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:53:05,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 286 transitions, 3082 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:53:05,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:05,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:53:05,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:05,693 INFO L124 PetriNetUnfolderBase]: 721/1254 cut-off events. [2024-06-14 15:53:05,694 INFO L125 PetriNetUnfolderBase]: For 149645/149645 co-relation queries the response was YES. [2024-06-14 15:53:05,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9728 conditions, 1254 events. 721/1254 cut-off events. For 149645/149645 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6362 event pairs, 93 based on Foata normal form. 2/1255 useless extension candidates. Maximal degree in co-relation 9591. Up to 1115 conditions per place. [2024-06-14 15:53:05,707 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 251 selfloop transitions, 51 changer transitions 0/304 dead transitions. [2024-06-14 15:53:05,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 304 transitions, 3730 flow [2024-06-14 15:53:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:05,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-14 15:53:05,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36079545454545453 [2024-06-14 15:53:05,708 INFO L175 Difference]: Start difference. First operand has 295 places, 286 transitions, 3082 flow. Second operand 11 states and 127 transitions. [2024-06-14 15:53:05,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 304 transitions, 3730 flow [2024-06-14 15:53:06,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 304 transitions, 3570 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-14 15:53:06,147 INFO L231 Difference]: Finished difference. Result has 296 places, 286 transitions, 3028 flow [2024-06-14 15:53:06,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2922, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3028, PETRI_PLACES=296, PETRI_TRANSITIONS=286} [2024-06-14 15:53:06,147 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 265 predicate places. [2024-06-14 15:53:06,147 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 286 transitions, 3028 flow [2024-06-14 15:53:06,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:53:06,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:06,147 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-14 15:53:06,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 15:53:06,148 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:06,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:06,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1340450166, now seen corresponding path program 2 times [2024-06-14 15:53:06,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:06,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748284163] [2024-06-14 15:53:06,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:06,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:14,498 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-14 15:53:14,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:14,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748284163] [2024-06-14 15:53:14,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748284163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:14,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:14,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:14,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54266654] [2024-06-14 15:53:14,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:14,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:14,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:14,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:14,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:14,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:53:14,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 286 transitions, 3028 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:53:14,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:14,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:53:14,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:15,282 INFO L124 PetriNetUnfolderBase]: 743/1290 cut-off events. [2024-06-14 15:53:15,282 INFO L125 PetriNetUnfolderBase]: For 166797/166797 co-relation queries the response was YES. [2024-06-14 15:53:15,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10133 conditions, 1290 events. 743/1290 cut-off events. For 166797/166797 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6601 event pairs, 75 based on Foata normal form. 4/1293 useless extension candidates. Maximal degree in co-relation 9997. Up to 580 conditions per place. [2024-06-14 15:53:15,296 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 179 selfloop transitions, 136 changer transitions 0/317 dead transitions. [2024-06-14 15:53:15,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 317 transitions, 4478 flow [2024-06-14 15:53:15,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-14 15:53:15,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42329545454545453 [2024-06-14 15:53:15,297 INFO L175 Difference]: Start difference. First operand has 296 places, 286 transitions, 3028 flow. Second operand 11 states and 149 transitions. [2024-06-14 15:53:15,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 317 transitions, 4478 flow [2024-06-14 15:53:15,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 317 transitions, 4336 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:53:15,965 INFO L231 Difference]: Finished difference. Result has 298 places, 294 transitions, 3391 flow [2024-06-14 15:53:15,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2886, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3391, PETRI_PLACES=298, PETRI_TRANSITIONS=294} [2024-06-14 15:53:15,966 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 267 predicate places. [2024-06-14 15:53:15,966 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 294 transitions, 3391 flow [2024-06-14 15:53:15,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:53:15,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:15,966 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-14 15:53:15,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 15:53:15,966 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:15,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:15,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1340444431, now seen corresponding path program 6 times [2024-06-14 15:53:15,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:15,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659959079] [2024-06-14 15:53:15,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:15,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:22,906 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-14 15:53:22,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:22,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659959079] [2024-06-14 15:53:22,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659959079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:22,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:22,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:22,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396559945] [2024-06-14 15:53:22,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:22,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:22,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:22,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:22,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:23,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:53:23,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 294 transitions, 3391 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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-14 15:53:23,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:23,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:53:23,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:23,710 INFO L124 PetriNetUnfolderBase]: 747/1298 cut-off events. [2024-06-14 15:53:23,710 INFO L125 PetriNetUnfolderBase]: For 167006/167006 co-relation queries the response was YES. [2024-06-14 15:53:23,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10451 conditions, 1298 events. 747/1298 cut-off events. For 167006/167006 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6654 event pairs, 82 based on Foata normal form. 2/1299 useless extension candidates. Maximal degree in co-relation 10314. Up to 926 conditions per place. [2024-06-14 15:53:23,721 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 197 selfloop transitions, 112 changer transitions 0/311 dead transitions. [2024-06-14 15:53:23,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 311 transitions, 4071 flow [2024-06-14 15:53:23,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:53:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:53:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-14 15:53:23,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434375 [2024-06-14 15:53:23,722 INFO L175 Difference]: Start difference. First operand has 298 places, 294 transitions, 3391 flow. Second operand 10 states and 139 transitions. [2024-06-14 15:53:23,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 311 transitions, 4071 flow [2024-06-14 15:53:24,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 311 transitions, 3718 flow, removed 72 selfloop flow, removed 8 redundant places. [2024-06-14 15:53:24,225 INFO L231 Difference]: Finished difference. Result has 300 places, 295 transitions, 3288 flow [2024-06-14 15:53:24,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3038, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3288, PETRI_PLACES=300, PETRI_TRANSITIONS=295} [2024-06-14 15:53:24,226 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 269 predicate places. [2024-06-14 15:53:24,226 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 295 transitions, 3288 flow [2024-06-14 15:53:24,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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-14 15:53:24,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:24,226 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-14 15:53:24,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 15:53:24,227 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:24,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:24,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1335082206, now seen corresponding path program 3 times [2024-06-14 15:53:24,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:24,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359546233] [2024-06-14 15:53:24,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:30,588 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-14 15:53:30,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:30,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359546233] [2024-06-14 15:53:30,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359546233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:30,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:30,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:30,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340438303] [2024-06-14 15:53:30,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:30,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:30,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:30,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:30,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:30,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:53:30,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 295 transitions, 3288 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:53:30,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:30,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:53:30,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:31,490 INFO L124 PetriNetUnfolderBase]: 763/1324 cut-off events. [2024-06-14 15:53:31,490 INFO L125 PetriNetUnfolderBase]: For 174637/174637 co-relation queries the response was YES. [2024-06-14 15:53:31,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10584 conditions, 1324 events. 763/1324 cut-off events. For 174637/174637 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 6830 event pairs, 64 based on Foata normal form. 2/1325 useless extension candidates. Maximal degree in co-relation 10448. Up to 913 conditions per place. [2024-06-14 15:53:31,504 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 213 selfloop transitions, 106 changer transitions 0/321 dead transitions. [2024-06-14 15:53:31,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 321 transitions, 4266 flow [2024-06-14 15:53:31,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-14 15:53:31,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119318181818182 [2024-06-14 15:53:31,505 INFO L175 Difference]: Start difference. First operand has 300 places, 295 transitions, 3288 flow. Second operand 11 states and 145 transitions. [2024-06-14 15:53:31,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 321 transitions, 4266 flow [2024-06-14 15:53:32,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 321 transitions, 4026 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:53:32,004 INFO L231 Difference]: Finished difference. Result has 303 places, 299 transitions, 3361 flow [2024-06-14 15:53:32,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3048, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3361, PETRI_PLACES=303, PETRI_TRANSITIONS=299} [2024-06-14 15:53:32,004 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 272 predicate places. [2024-06-14 15:53:32,004 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 299 transitions, 3361 flow [2024-06-14 15:53:32,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:53:32,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:32,004 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-14 15:53:32,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 15:53:32,005 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:32,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:32,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1287545224, now seen corresponding path program 4 times [2024-06-14 15:53:32,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:32,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405316562] [2024-06-14 15:53:32,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:32,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:38,152 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-14 15:53:38,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:38,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405316562] [2024-06-14 15:53:38,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405316562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:38,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:38,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:38,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655441796] [2024-06-14 15:53:38,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:38,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:38,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:38,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:38,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:38,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:53:38,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 299 transitions, 3361 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:53:38,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:38,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:53:38,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:39,200 INFO L124 PetriNetUnfolderBase]: 1056/1808 cut-off events. [2024-06-14 15:53:39,200 INFO L125 PetriNetUnfolderBase]: For 240760/240760 co-relation queries the response was YES. [2024-06-14 15:53:39,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14758 conditions, 1808 events. 1056/1808 cut-off events. For 240760/240760 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 9882 event pairs, 209 based on Foata normal form. 2/1809 useless extension candidates. Maximal degree in co-relation 14621. Up to 1197 conditions per place. [2024-06-14 15:53:39,217 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 299 selfloop transitions, 132 changer transitions 0/433 dead transitions. [2024-06-14 15:53:39,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 433 transitions, 6145 flow [2024-06-14 15:53:39,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:53:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:53:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 150 transitions. [2024-06-14 15:53:39,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:53:39,219 INFO L175 Difference]: Start difference. First operand has 303 places, 299 transitions, 3361 flow. Second operand 12 states and 150 transitions. [2024-06-14 15:53:39,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 433 transitions, 6145 flow [2024-06-14 15:53:39,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 433 transitions, 5881 flow, removed 46 selfloop flow, removed 7 redundant places. [2024-06-14 15:53:39,943 INFO L231 Difference]: Finished difference. Result has 314 places, 380 transitions, 4672 flow [2024-06-14 15:53:39,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3188, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4672, PETRI_PLACES=314, PETRI_TRANSITIONS=380} [2024-06-14 15:53:39,944 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 283 predicate places. [2024-06-14 15:53:39,944 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 380 transitions, 4672 flow [2024-06-14 15:53:39,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:53:39,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:39,945 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-14 15:53:39,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 15:53:39,945 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:39,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:39,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1340659912, now seen corresponding path program 1 times [2024-06-14 15:53:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:39,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850400303] [2024-06-14 15:53:39,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:39,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:47,637 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-14 15:53:47,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:47,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850400303] [2024-06-14 15:53:47,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850400303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:47,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:47,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:47,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987412194] [2024-06-14 15:53:47,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:47,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:47,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:47,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:47,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:47,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:53:47,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 380 transitions, 4672 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:53:47,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:47,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:53:47,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:48,514 INFO L124 PetriNetUnfolderBase]: 1060/1816 cut-off events. [2024-06-14 15:53:48,514 INFO L125 PetriNetUnfolderBase]: For 246637/246637 co-relation queries the response was YES. [2024-06-14 15:53:48,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15552 conditions, 1816 events. 1060/1816 cut-off events. For 246637/246637 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 9979 event pairs, 107 based on Foata normal form. 2/1817 useless extension candidates. Maximal degree in co-relation 15407. Up to 1587 conditions per place. [2024-06-14 15:53:48,536 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 330 selfloop transitions, 66 changer transitions 0/398 dead transitions. [2024-06-14 15:53:48,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 398 transitions, 5516 flow [2024-06-14 15:53:48,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:53:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:53:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 15:53:48,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 15:53:48,538 INFO L175 Difference]: Start difference. First operand has 314 places, 380 transitions, 4672 flow. Second operand 10 states and 123 transitions. [2024-06-14 15:53:48,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 398 transitions, 5516 flow [2024-06-14 15:53:49,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 398 transitions, 5374 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-14 15:53:49,439 INFO L231 Difference]: Finished difference. Result has 320 places, 381 transitions, 4675 flow [2024-06-14 15:53:49,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4530, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4675, PETRI_PLACES=320, PETRI_TRANSITIONS=381} [2024-06-14 15:53:49,440 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 289 predicate places. [2024-06-14 15:53:49,440 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 381 transitions, 4675 flow [2024-06-14 15:53:49,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:53:49,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:49,440 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-14 15:53:49,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 15:53:49,441 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:49,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:49,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1335087786, now seen corresponding path program 5 times [2024-06-14 15:53:49,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:49,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777106063] [2024-06-14 15:53:49,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:49,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:58,147 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-14 15:53:58,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:58,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777106063] [2024-06-14 15:53:58,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777106063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:58,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:58,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:58,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457707900] [2024-06-14 15:53:58,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:58,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:58,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:58,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:58,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:58,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:53:58,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 381 transitions, 4675 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:53:58,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:58,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:53:58,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:59,082 INFO L124 PetriNetUnfolderBase]: 1052/1804 cut-off events. [2024-06-14 15:53:59,083 INFO L125 PetriNetUnfolderBase]: For 244055/244055 co-relation queries the response was YES. [2024-06-14 15:53:59,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15007 conditions, 1804 events. 1052/1804 cut-off events. For 244055/244055 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 9968 event pairs, 80 based on Foata normal form. 4/1807 useless extension candidates. Maximal degree in co-relation 14861. Up to 1261 conditions per place. [2024-06-14 15:53:59,104 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 269 selfloop transitions, 130 changer transitions 0/401 dead transitions. [2024-06-14 15:53:59,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 401 transitions, 5531 flow [2024-06-14 15:53:59,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:59,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-14 15:53:59,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4005681818181818 [2024-06-14 15:53:59,105 INFO L175 Difference]: Start difference. First operand has 320 places, 381 transitions, 4675 flow. Second operand 11 states and 141 transitions. [2024-06-14 15:53:59,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 401 transitions, 5531 flow [2024-06-14 15:53:59,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 401 transitions, 5346 flow, removed 28 selfloop flow, removed 8 redundant places. [2024-06-14 15:53:59,978 INFO L231 Difference]: Finished difference. Result has 323 places, 381 transitions, 4758 flow [2024-06-14 15:53:59,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4490, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4758, PETRI_PLACES=323, PETRI_TRANSITIONS=381} [2024-06-14 15:53:59,979 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 292 predicate places. [2024-06-14 15:53:59,979 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 381 transitions, 4758 flow [2024-06-14 15:53:59,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:53:59,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:59,980 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-14 15:53:59,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-14 15:53:59,980 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:59,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:59,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1293115149, now seen corresponding path program 7 times [2024-06-14 15:53:59,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:59,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644562698] [2024-06-14 15:53:59,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:59,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:06,720 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-14 15:54:06,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:06,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644562698] [2024-06-14 15:54:06,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644562698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:06,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:06,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:06,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620979528] [2024-06-14 15:54:06,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:06,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:06,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:06,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:06,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:06,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:54:06,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 381 transitions, 4758 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:54:06,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:06,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:54:06,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:07,640 INFO L124 PetriNetUnfolderBase]: 1056/1812 cut-off events. [2024-06-14 15:54:07,640 INFO L125 PetriNetUnfolderBase]: For 238552/238552 co-relation queries the response was YES. [2024-06-14 15:54:07,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15223 conditions, 1812 events. 1056/1812 cut-off events. For 238552/238552 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 9959 event pairs, 118 based on Foata normal form. 2/1813 useless extension candidates. Maximal degree in co-relation 15076. Up to 1327 conditions per place. [2024-06-14 15:54:07,662 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 259 selfloop transitions, 137 changer transitions 0/398 dead transitions. [2024-06-14 15:54:07,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 398 transitions, 5614 flow [2024-06-14 15:54:07,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:54:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:54:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-14 15:54:07,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:54:07,664 INFO L175 Difference]: Start difference. First operand has 323 places, 381 transitions, 4758 flow. Second operand 10 states and 130 transitions. [2024-06-14 15:54:07,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 398 transitions, 5614 flow [2024-06-14 15:54:08,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 398 transitions, 5341 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-14 15:54:08,566 INFO L231 Difference]: Finished difference. Result has 323 places, 382 transitions, 4790 flow [2024-06-14 15:54:08,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4485, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4790, PETRI_PLACES=323, PETRI_TRANSITIONS=382} [2024-06-14 15:54:08,567 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 292 predicate places. [2024-06-14 15:54:08,567 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 382 transitions, 4790 flow [2024-06-14 15:54:08,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:54:08,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:08,568 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-14 15:54:08,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-14 15:54:08,568 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:08,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:08,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1334938056, now seen corresponding path program 6 times [2024-06-14 15:54:08,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:08,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487220022] [2024-06-14 15:54:08,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:08,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:15,169 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-14 15:54:15,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:15,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487220022] [2024-06-14 15:54:15,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487220022] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:15,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:15,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:15,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929769985] [2024-06-14 15:54:15,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:15,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:15,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:15,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:15,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:15,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:54:15,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 382 transitions, 4790 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:54:15,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:15,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:54:15,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:16,246 INFO L124 PetriNetUnfolderBase]: 1048/1800 cut-off events. [2024-06-14 15:54:16,247 INFO L125 PetriNetUnfolderBase]: For 235250/235250 co-relation queries the response was YES. [2024-06-14 15:54:16,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14723 conditions, 1800 events. 1048/1800 cut-off events. For 235250/235250 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 9941 event pairs, 79 based on Foata normal form. 4/1803 useless extension candidates. Maximal degree in co-relation 14575. Up to 1162 conditions per place. [2024-06-14 15:54:16,268 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 243 selfloop transitions, 158 changer transitions 0/403 dead transitions. [2024-06-14 15:54:16,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 403 transitions, 5846 flow [2024-06-14 15:54:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-14 15:54:16,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-14 15:54:16,269 INFO L175 Difference]: Start difference. First operand has 323 places, 382 transitions, 4790 flow. Second operand 11 states and 144 transitions. [2024-06-14 15:54:16,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 403 transitions, 5846 flow [2024-06-14 15:54:17,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 403 transitions, 5503 flow, removed 37 selfloop flow, removed 8 redundant places. [2024-06-14 15:54:17,106 INFO L231 Difference]: Finished difference. Result has 326 places, 382 transitions, 4771 flow [2024-06-14 15:54:17,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4447, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4771, PETRI_PLACES=326, PETRI_TRANSITIONS=382} [2024-06-14 15:54:17,107 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 295 predicate places. [2024-06-14 15:54:17,107 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 382 transitions, 4771 flow [2024-06-14 15:54:17,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:54:17,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:17,107 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-14 15:54:17,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-14 15:54:17,107 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:17,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:17,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1293263019, now seen corresponding path program 8 times [2024-06-14 15:54:17,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:17,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574091887] [2024-06-14 15:54:17,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:17,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:24,123 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-14 15:54:24,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:24,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574091887] [2024-06-14 15:54:24,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574091887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:24,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:24,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:24,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486484679] [2024-06-14 15:54:24,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:24,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:24,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:24,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:24,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:24,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:54:24,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 382 transitions, 4771 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:54:24,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:24,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:54:24,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:25,126 INFO L124 PetriNetUnfolderBase]: 1055/1813 cut-off events. [2024-06-14 15:54:25,126 INFO L125 PetriNetUnfolderBase]: For 228387/228387 co-relation queries the response was YES. [2024-06-14 15:54:25,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14878 conditions, 1813 events. 1055/1813 cut-off events. For 228387/228387 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 10032 event pairs, 111 based on Foata normal form. 2/1814 useless extension candidates. Maximal degree in co-relation 14729. Up to 1427 conditions per place. [2024-06-14 15:54:25,148 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 289 selfloop transitions, 112 changer transitions 0/403 dead transitions. [2024-06-14 15:54:25,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 403 transitions, 5661 flow [2024-06-14 15:54:25,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:25,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 15:54:25,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-14 15:54:25,152 INFO L175 Difference]: Start difference. First operand has 326 places, 382 transitions, 4771 flow. Second operand 11 states and 138 transitions. [2024-06-14 15:54:25,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 403 transitions, 5661 flow [2024-06-14 15:54:26,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 403 transitions, 5162 flow, removed 17 selfloop flow, removed 11 redundant places. [2024-06-14 15:54:26,119 INFO L231 Difference]: Finished difference. Result has 327 places, 385 transitions, 4606 flow [2024-06-14 15:54:26,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4272, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4606, PETRI_PLACES=327, PETRI_TRANSITIONS=385} [2024-06-14 15:54:26,120 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 296 predicate places. [2024-06-14 15:54:26,120 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 385 transitions, 4606 flow [2024-06-14 15:54:26,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:54:26,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:26,121 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-14 15:54:26,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-14 15:54:26,121 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:26,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:26,122 INFO L85 PathProgramCache]: Analyzing trace with hash -2120187257, now seen corresponding path program 9 times [2024-06-14 15:54:26,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:26,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216247328] [2024-06-14 15:54:26,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:26,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:32,876 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-14 15:54:32,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:32,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216247328] [2024-06-14 15:54:32,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216247328] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:32,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:32,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:32,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820772653] [2024-06-14 15:54:32,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:32,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:32,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:32,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:32,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:33,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:54:33,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 385 transitions, 4606 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:54:33,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:33,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:54:33,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:34,041 INFO L124 PetriNetUnfolderBase]: 1095/1893 cut-off events. [2024-06-14 15:54:34,041 INFO L125 PetriNetUnfolderBase]: For 291570/291570 co-relation queries the response was YES. [2024-06-14 15:54:34,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16091 conditions, 1893 events. 1095/1893 cut-off events. For 291570/291570 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 10518 event pairs, 181 based on Foata normal form. 2/1894 useless extension candidates. Maximal degree in co-relation 15942. Up to 1594 conditions per place. [2024-06-14 15:54:34,068 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 350 selfloop transitions, 59 changer transitions 0/411 dead transitions. [2024-06-14 15:54:34,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 411 transitions, 5778 flow [2024-06-14 15:54:34,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-14 15:54:34,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4034090909090909 [2024-06-14 15:54:34,070 INFO L175 Difference]: Start difference. First operand has 327 places, 385 transitions, 4606 flow. Second operand 11 states and 142 transitions. [2024-06-14 15:54:34,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 411 transitions, 5778 flow [2024-06-14 15:54:35,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 411 transitions, 5588 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 15:54:35,199 INFO L231 Difference]: Finished difference. Result has 330 places, 387 transitions, 4592 flow [2024-06-14 15:54:35,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4416, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4592, PETRI_PLACES=330, PETRI_TRANSITIONS=387} [2024-06-14 15:54:35,200 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 299 predicate places. [2024-06-14 15:54:35,200 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 387 transitions, 4592 flow [2024-06-14 15:54:35,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:54:35,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:35,201 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-14 15:54:35,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-14 15:54:35,201 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:35,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2120039232, now seen corresponding path program 7 times [2024-06-14 15:54:35,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:35,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813415404] [2024-06-14 15:54:35,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:35,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:41,601 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-14 15:54:41,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:41,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813415404] [2024-06-14 15:54:41,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813415404] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:41,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:41,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:41,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298412824] [2024-06-14 15:54:41,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:41,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:41,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:41,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:41,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:41,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:54:41,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 387 transitions, 4592 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:54:41,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:41,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:54:41,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:42,693 INFO L124 PetriNetUnfolderBase]: 1113/1923 cut-off events. [2024-06-14 15:54:42,693 INFO L125 PetriNetUnfolderBase]: For 308300/308300 co-relation queries the response was YES. [2024-06-14 15:54:42,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16258 conditions, 1923 events. 1113/1923 cut-off events. For 308300/308300 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 10732 event pairs, 163 based on Foata normal form. 4/1926 useless extension candidates. Maximal degree in co-relation 16108. Up to 1642 conditions per place. [2024-06-14 15:54:42,716 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 341 selfloop transitions, 71 changer transitions 0/414 dead transitions. [2024-06-14 15:54:42,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 414 transitions, 5793 flow [2024-06-14 15:54:42,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:42,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-14 15:54:42,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-06-14 15:54:42,717 INFO L175 Difference]: Start difference. First operand has 330 places, 387 transitions, 4592 flow. Second operand 11 states and 139 transitions. [2024-06-14 15:54:42,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 414 transitions, 5793 flow [2024-06-14 15:54:43,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 414 transitions, 5696 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-14 15:54:43,899 INFO L231 Difference]: Finished difference. Result has 336 places, 394 transitions, 4786 flow [2024-06-14 15:54:43,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4497, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4786, PETRI_PLACES=336, PETRI_TRANSITIONS=394} [2024-06-14 15:54:43,899 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 305 predicate places. [2024-06-14 15:54:43,899 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 394 transitions, 4786 flow [2024-06-14 15:54:43,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:54:43,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:43,899 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-14 15:54:43,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-14 15:54:43,900 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:43,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:43,900 INFO L85 PathProgramCache]: Analyzing trace with hash -453263556, now seen corresponding path program 8 times [2024-06-14 15:54:43,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:43,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651781786] [2024-06-14 15:54:43,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:43,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:53,843 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-14 15:54:53,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:53,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651781786] [2024-06-14 15:54:53,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651781786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:53,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:53,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:53,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102017769] [2024-06-14 15:54:53,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:53,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:53,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:53,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:53,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:54,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:54:54,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 394 transitions, 4786 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:54:54,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:54,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:54:54,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:54,777 INFO L124 PetriNetUnfolderBase]: 1105/1911 cut-off events. [2024-06-14 15:54:54,777 INFO L125 PetriNetUnfolderBase]: For 293854/293854 co-relation queries the response was YES. [2024-06-14 15:54:54,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15991 conditions, 1911 events. 1105/1911 cut-off events. For 293854/293854 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 10697 event pairs, 163 based on Foata normal form. 4/1914 useless extension candidates. Maximal degree in co-relation 15838. Up to 1654 conditions per place. [2024-06-14 15:54:54,801 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 345 selfloop transitions, 65 changer transitions 0/412 dead transitions. [2024-06-14 15:54:54,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 412 transitions, 5658 flow [2024-06-14 15:54:54,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:54,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 15:54:54,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-14 15:54:54,802 INFO L175 Difference]: Start difference. First operand has 336 places, 394 transitions, 4786 flow. Second operand 11 states and 135 transitions. [2024-06-14 15:54:54,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 412 transitions, 5658 flow [2024-06-14 15:54:56,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 412 transitions, 5410 flow, removed 60 selfloop flow, removed 8 redundant places. [2024-06-14 15:54:56,131 INFO L231 Difference]: Finished difference. Result has 339 places, 394 transitions, 4675 flow [2024-06-14 15:54:56,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4538, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4675, PETRI_PLACES=339, PETRI_TRANSITIONS=394} [2024-06-14 15:54:56,131 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 308 predicate places. [2024-06-14 15:54:56,131 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 394 transitions, 4675 flow [2024-06-14 15:54:56,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:54:56,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:56,132 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-14 15:54:56,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-14 15:54:56,132 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:56,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2120183537, now seen corresponding path program 10 times [2024-06-14 15:54:56,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:56,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096513927] [2024-06-14 15:54:56,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:03,049 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-14 15:55:03,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:03,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096513927] [2024-06-14 15:55:03,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096513927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:03,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:03,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:55:03,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503507883] [2024-06-14 15:55:03,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:03,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:55:03,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:03,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:55:03,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:55:03,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:55:03,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 394 transitions, 4675 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:55:03,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:03,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:55:03,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:04,169 INFO L124 PetriNetUnfolderBase]: 1109/1919 cut-off events. [2024-06-14 15:55:04,169 INFO L125 PetriNetUnfolderBase]: For 287718/287718 co-relation queries the response was YES. [2024-06-14 15:55:04,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15940 conditions, 1919 events. 1109/1919 cut-off events. For 287718/287718 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 10728 event pairs, 175 based on Foata normal form. 2/1920 useless extension candidates. Maximal degree in co-relation 15786. Up to 1712 conditions per place. [2024-06-14 15:55:04,189 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 350 selfloop transitions, 62 changer transitions 0/414 dead transitions. [2024-06-14 15:55:04,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 414 transitions, 5575 flow [2024-06-14 15:55:04,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:55:04,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:55:04,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2024-06-14 15:55:04,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3776041666666667 [2024-06-14 15:55:04,190 INFO L175 Difference]: Start difference. First operand has 339 places, 394 transitions, 4675 flow. Second operand 12 states and 145 transitions. [2024-06-14 15:55:04,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 414 transitions, 5575 flow [2024-06-14 15:55:05,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 414 transitions, 5446 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 15:55:05,474 INFO L231 Difference]: Finished difference. Result has 342 places, 395 transitions, 4703 flow [2024-06-14 15:55:05,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4546, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4703, PETRI_PLACES=342, PETRI_TRANSITIONS=395} [2024-06-14 15:55:05,475 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 311 predicate places. [2024-06-14 15:55:05,475 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 395 transitions, 4703 flow [2024-06-14 15:55:05,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:55:05,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:05,475 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-14 15:55:05,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-14 15:55:05,476 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:55:05,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:05,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2120183382, now seen corresponding path program 9 times [2024-06-14 15:55:05,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:05,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123138392] [2024-06-14 15:55:05,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:05,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:11,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:11,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123138392] [2024-06-14 15:55:11,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123138392] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:11,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:11,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:55:11,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441920709] [2024-06-14 15:55:11,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:11,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:55:11,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:11,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:55:11,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:55:11,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:55:11,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 395 transitions, 4703 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:55:11,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:11,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:55:11,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:12,702 INFO L124 PetriNetUnfolderBase]: 1101/1907 cut-off events. [2024-06-14 15:55:12,702 INFO L125 PetriNetUnfolderBase]: For 282324/282324 co-relation queries the response was YES. [2024-06-14 15:55:12,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15481 conditions, 1907 events. 1101/1907 cut-off events. For 282324/282324 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 10675 event pairs, 149 based on Foata normal form. 4/1910 useless extension candidates. Maximal degree in co-relation 15326. Up to 1490 conditions per place. [2024-06-14 15:55:12,731 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 311 selfloop transitions, 101 changer transitions 0/414 dead transitions. [2024-06-14 15:55:12,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 414 transitions, 5787 flow [2024-06-14 15:55:12,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:55:12,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:55:12,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 15:55:12,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-14 15:55:12,733 INFO L175 Difference]: Start difference. First operand has 342 places, 395 transitions, 4703 flow. Second operand 11 states and 138 transitions. [2024-06-14 15:55:12,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 414 transitions, 5787 flow [2024-06-14 15:55:13,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 414 transitions, 5593 flow, removed 34 selfloop flow, removed 10 redundant places. [2024-06-14 15:55:13,800 INFO L231 Difference]: Finished difference. Result has 343 places, 395 transitions, 4718 flow [2024-06-14 15:55:13,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4509, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4718, PETRI_PLACES=343, PETRI_TRANSITIONS=395} [2024-06-14 15:55:13,801 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 312 predicate places. [2024-06-14 15:55:13,801 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 395 transitions, 4718 flow [2024-06-14 15:55:13,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:55:13,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:13,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-14 15:55:13,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-14 15:55:13,801 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:55:13,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:13,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2114677007, now seen corresponding path program 11 times [2024-06-14 15:55:13,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:13,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807640847] [2024-06-14 15:55:13,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:13,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:20,506 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-14 15:55:20,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:20,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807640847] [2024-06-14 15:55:20,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807640847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:20,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:20,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:55:20,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573425314] [2024-06-14 15:55:20,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:20,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:55:20,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:20,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:55:20,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:55:20,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:55:20,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 395 transitions, 4718 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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-14 15:55:20,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:20,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:55:20,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:21,451 INFO L124 PetriNetUnfolderBase]: 1105/1915 cut-off events. [2024-06-14 15:55:21,452 INFO L125 PetriNetUnfolderBase]: For 277008/277008 co-relation queries the response was YES. [2024-06-14 15:55:21,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15640 conditions, 1915 events. 1105/1915 cut-off events. For 277008/277008 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 10745 event pairs, 181 based on Foata normal form. 2/1916 useless extension candidates. Maximal degree in co-relation 15484. Up to 1752 conditions per place. [2024-06-14 15:55:21,476 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 363 selfloop transitions, 47 changer transitions 0/412 dead transitions. [2024-06-14 15:55:21,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 412 transitions, 5606 flow [2024-06-14 15:55:21,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:55:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:55:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-14 15:55:21,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:55:21,477 INFO L175 Difference]: Start difference. First operand has 343 places, 395 transitions, 4718 flow. Second operand 11 states and 143 transitions. [2024-06-14 15:55:21,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 412 transitions, 5606 flow [2024-06-14 15:55:22,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 412 transitions, 5338 flow, removed 29 selfloop flow, removed 10 redundant places. [2024-06-14 15:55:22,684 INFO L231 Difference]: Finished difference. Result has 344 places, 396 transitions, 4577 flow [2024-06-14 15:55:22,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4450, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4577, PETRI_PLACES=344, PETRI_TRANSITIONS=396} [2024-06-14 15:55:22,685 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 313 predicate places. [2024-06-14 15:55:22,685 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 396 transitions, 4577 flow [2024-06-14 15:55:22,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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-14 15:55:22,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:22,685 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-14 15:55:22,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-14 15:55:22,686 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:55:22,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:22,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2114461526, now seen corresponding path program 2 times [2024-06-14 15:55:22,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:22,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013449761] [2024-06-14 15:55:22,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:22,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:31,499 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-14 15:55:31,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:31,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013449761] [2024-06-14 15:55:31,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013449761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:31,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:31,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:55:31,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805441716] [2024-06-14 15:55:31,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:31,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:55:31,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:31,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:55:31,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:55:31,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:55:31,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 396 transitions, 4577 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:55:31,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:31,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:55:31,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:32,455 INFO L124 PetriNetUnfolderBase]: 1109/1923 cut-off events. [2024-06-14 15:55:32,455 INFO L125 PetriNetUnfolderBase]: For 281255/281255 co-relation queries the response was YES. [2024-06-14 15:55:32,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15460 conditions, 1923 events. 1109/1923 cut-off events. For 281255/281255 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 10834 event pairs, 165 based on Foata normal form. 2/1924 useless extension candidates. Maximal degree in co-relation 15304. Up to 1782 conditions per place. [2024-06-14 15:55:32,481 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 370 selfloop transitions, 41 changer transitions 0/413 dead transitions. [2024-06-14 15:55:32,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 413 transitions, 5451 flow [2024-06-14 15:55:32,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:55:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:55:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 15:55:32,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-14 15:55:32,482 INFO L175 Difference]: Start difference. First operand has 344 places, 396 transitions, 4577 flow. Second operand 10 states and 122 transitions. [2024-06-14 15:55:32,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 413 transitions, 5451 flow [2024-06-14 15:55:33,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 413 transitions, 5338 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-14 15:55:33,763 INFO L231 Difference]: Finished difference. Result has 345 places, 397 transitions, 4561 flow [2024-06-14 15:55:33,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4464, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4561, PETRI_PLACES=345, PETRI_TRANSITIONS=397} [2024-06-14 15:55:33,764 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 314 predicate places. [2024-06-14 15:55:33,764 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 397 transitions, 4561 flow [2024-06-14 15:55:33,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:55:33,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:33,764 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-14 15:55:33,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-14 15:55:33,764 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:55:33,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:33,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2114671272, now seen corresponding path program 10 times [2024-06-14 15:55:33,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:33,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402780911] [2024-06-14 15:55:33,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:33,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:42,339 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-14 15:55:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402780911] [2024-06-14 15:55:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402780911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:42,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:42,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:55:42,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463500560] [2024-06-14 15:55:42,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:42,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:55:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:55:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:55:42,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:55:42,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 397 transitions, 4561 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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-14 15:55:42,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:42,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:55:42,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:43,399 INFO L124 PetriNetUnfolderBase]: 1121/1943 cut-off events. [2024-06-14 15:55:43,399 INFO L125 PetriNetUnfolderBase]: For 298502/298502 co-relation queries the response was YES. [2024-06-14 15:55:43,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15615 conditions, 1943 events. 1121/1943 cut-off events. For 298502/298502 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 11001 event pairs, 157 based on Foata normal form. 4/1946 useless extension candidates. Maximal degree in co-relation 15458. Up to 1686 conditions per place. [2024-06-14 15:55:43,423 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 355 selfloop transitions, 63 changer transitions 0/420 dead transitions. [2024-06-14 15:55:43,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 420 transitions, 5537 flow [2024-06-14 15:55:43,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:55:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:55:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-14 15:55:43,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42329545454545453 [2024-06-14 15:55:43,424 INFO L175 Difference]: Start difference. First operand has 345 places, 397 transitions, 4561 flow. Second operand 11 states and 149 transitions. [2024-06-14 15:55:43,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 420 transitions, 5537 flow [2024-06-14 15:55:44,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 420 transitions, 5452 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-14 15:55:44,571 INFO L231 Difference]: Finished difference. Result has 348 places, 401 transitions, 4701 flow [2024-06-14 15:55:44,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4476, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4701, PETRI_PLACES=348, PETRI_TRANSITIONS=401} [2024-06-14 15:55:44,571 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 317 predicate places. [2024-06-14 15:55:44,571 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 401 transitions, 4701 flow [2024-06-14 15:55:44,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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-14 15:55:44,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:44,572 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-14 15:55:44,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-14 15:55:44,572 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:55:44,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:44,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2114469462, now seen corresponding path program 11 times [2024-06-14 15:55:44,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:44,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908315895] [2024-06-14 15:55:44,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:44,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:52,917 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-14 15:55:52,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:52,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908315895] [2024-06-14 15:55:52,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908315895] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:52,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:52,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:55:52,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133999335] [2024-06-14 15:55:52,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:52,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:55:52,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:52,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:55:52,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:55:53,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:55:53,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 401 transitions, 4701 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:55:53,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:53,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:55:53,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:54,204 INFO L124 PetriNetUnfolderBase]: 1113/1931 cut-off events. [2024-06-14 15:55:54,204 INFO L125 PetriNetUnfolderBase]: For 281606/281606 co-relation queries the response was YES. [2024-06-14 15:55:54,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15248 conditions, 1931 events. 1113/1931 cut-off events. For 281606/281606 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 10934 event pairs, 163 based on Foata normal form. 4/1934 useless extension candidates. Maximal degree in co-relation 15090. Up to 1674 conditions per place. [2024-06-14 15:55:54,229 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 353 selfloop transitions, 64 changer transitions 0/419 dead transitions. [2024-06-14 15:55:54,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 419 transitions, 5587 flow [2024-06-14 15:55:54,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:55:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:55:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 15:55:54,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-14 15:55:54,231 INFO L175 Difference]: Start difference. First operand has 348 places, 401 transitions, 4701 flow. Second operand 11 states and 136 transitions. [2024-06-14 15:55:54,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 419 transitions, 5587 flow [2024-06-14 15:55:55,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 419 transitions, 5347 flow, removed 50 selfloop flow, removed 9 redundant places. [2024-06-14 15:55:55,325 INFO L231 Difference]: Finished difference. Result has 350 places, 401 transitions, 4596 flow [2024-06-14 15:55:55,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4461, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4596, PETRI_PLACES=350, PETRI_TRANSITIONS=401} [2024-06-14 15:55:55,325 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 319 predicate places. [2024-06-14 15:55:55,326 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 401 transitions, 4596 flow [2024-06-14 15:55:55,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:55:55,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:55,326 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-14 15:55:55,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-14 15:55:55,326 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:55:55,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:55,327 INFO L85 PathProgramCache]: Analyzing trace with hash -253961766, now seen corresponding path program 12 times [2024-06-14 15:55:55,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:55,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575352082] [2024-06-14 15:55:55,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:55,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:02,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:02,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575352082] [2024-06-14 15:56:02,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575352082] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:02,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:02,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:56:02,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716213005] [2024-06-14 15:56:02,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:02,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:56:02,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:02,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:56:02,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:56:02,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:56:02,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 401 transitions, 4596 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-14 15:56:02,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:02,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:56:02,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:03,477 INFO L124 PetriNetUnfolderBase]: 1125/1951 cut-off events. [2024-06-14 15:56:03,477 INFO L125 PetriNetUnfolderBase]: For 285712/285712 co-relation queries the response was YES. [2024-06-14 15:56:03,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15277 conditions, 1951 events. 1125/1951 cut-off events. For 285712/285712 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 11038 event pairs, 175 based on Foata normal form. 4/1954 useless extension candidates. Maximal degree in co-relation 15118. Up to 1776 conditions per place. [2024-06-14 15:56:03,501 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 373 selfloop transitions, 48 changer transitions 0/423 dead transitions. [2024-06-14 15:56:03,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 423 transitions, 5570 flow [2024-06-14 15:56:03,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:56:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:56:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-14 15:56:03,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:56:03,502 INFO L175 Difference]: Start difference. First operand has 350 places, 401 transitions, 4596 flow. Second operand 11 states and 132 transitions. [2024-06-14 15:56:03,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 423 transitions, 5570 flow Killed by 15