./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 00:11:52,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 00:11:52,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 00:11:52,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 00:11:52,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 00:11:52,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 00:11:52,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 00:11:52,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 00:11:52,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 00:11:52,538 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 00:11:52,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 00:11:52,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 00:11:52,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 00:11:52,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 00:11:52,542 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 00:11:52,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 00:11:52,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 00:11:52,543 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 00:11:52,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 00:11:52,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 00:11:52,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 00:11:52,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 00:11:52,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 00:11:52,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 00:11:52,545 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 00:11:52,545 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 00:11:52,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 00:11:52,546 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 00:11:52,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 00:11:52,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 00:11:52,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 00:11:52,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 00:11:52,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:11:52,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 00:11:52,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 00:11:52,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 00:11:52,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 00:11:52,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 00:11:52,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 00:11:52,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 00:11:52,550 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 00:11:52,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 00:11:52,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 00:11:52,551 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-28 00:11:52,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 00:11:52,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 00:11:52,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 00:11:52,839 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 00:11:52,840 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 00:11:52,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-28 00:11:52,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 00:11:52,934 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 00:11:52,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2024-06-28 00:11:54,120 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 00:11:54,364 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 00:11:54,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2024-06-28 00:11:54,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930610a47/c3b72533834341518d53e6f767e06074/FLAGed5e4abf4 [2024-06-28 00:11:54,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930610a47/c3b72533834341518d53e6f767e06074 [2024-06-28 00:11:54,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 00:11:54,394 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 00:11:54,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 00:11:54,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 00:11:54,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 00:11:54,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:11:52" (1/2) ... [2024-06-28 00:11:54,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3609d27f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:11:54, skipping insertion in model container [2024-06-28 00:11:54,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:11:52" (1/2) ... [2024-06-28 00:11:54,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@724024f7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:11:54, skipping insertion in model container [2024-06-28 00:11:54,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:11:54" (2/2) ... [2024-06-28 00:11:54,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3609d27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:11:54, skipping insertion in model container [2024-06-28 00:11:54,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:11:54" (2/2) ... [2024-06-28 00:11:54,407 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 00:11:54,433 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 00:11:54,434 INFO L97 edCorrectnessWitness]: Location invariant before [L815-L815] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1_used >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )x) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )x) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) [2024-06-28 00:11:54,435 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1_used >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )x) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )x) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) [2024-06-28 00:11:54,435 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 00:11:54,435 INFO L106 edCorrectnessWitness]: ghost_update [L813-L813] multithreaded = 1; [2024-06-28 00:11:54,486 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 00:11:54,847 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:11:54,862 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 00:11:55,090 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:11:55,124 INFO L206 MainTranslator]: Completed translation [2024-06-28 00:11:55,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:11:55 WrapperNode [2024-06-28 00:11:55,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 00:11:55,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 00:11:55,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 00:11:55,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 00:11:55,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:11:55" (1/1) ... [2024-06-28 00:11:55,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:11:55" (1/1) ... [2024-06-28 00:11:55,205 INFO L138 Inliner]: procedures = 174, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2024-06-28 00:11:55,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 00:11:55,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 00:11:55,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 00:11:55,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 00:11:55,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:11:55" (1/1) ... [2024-06-28 00:11:55,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:11:55" (1/1) ... [2024-06-28 00:11:55,222 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:11:55" (1/1) ... [2024-06-28 00:11:55,261 INFO L175 MemorySlicer]: Split 19 memory accesses to 2 slices as follows [2, 17]. 89 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-06-28 00:11:55,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:11:55" (1/1) ... [2024-06-28 00:11:55,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:11:55" (1/1) ... [2024-06-28 00:11:55,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:11:55" (1/1) ... [2024-06-28 00:11:55,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:11:55" (1/1) ... [2024-06-28 00:11:55,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:11:55" (1/1) ... [2024-06-28 00:11:55,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:11:55" (1/1) ... [2024-06-28 00:11:55,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 00:11:55,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 00:11:55,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 00:11:55,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 00:11:55,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:11:55" (1/1) ... [2024-06-28 00:11:55,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:11:55,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 00:11:55,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-28 00:11:55,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-28 00:11:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 00:11:55,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 00:11:55,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 00:11:55,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 00:11:55,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 00:11:55,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 00:11:55,389 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 00:11:55,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 00:11:55,389 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 00:11:55,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 00:11:55,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 00:11:55,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 00:11:55,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 00:11:55,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 00:11:55,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 00:11:55,392 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 00:11:55,640 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 00:11:55,643 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 00:11:56,266 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 00:11:56,266 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 00:11:56,573 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 00:11:56,573 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 00:11:56,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:11:56 BoogieIcfgContainer [2024-06-28 00:11:56,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 00:11:56,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 00:11:56,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 00:11:56,580 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 00:11:56,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:11:52" (1/4) ... [2024-06-28 00:11:56,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bcdb8c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 12:11:56, skipping insertion in model container [2024-06-28 00:11:56,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 12:11:54" (2/4) ... [2024-06-28 00:11:56,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bcdb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 12:11:56, skipping insertion in model container [2024-06-28 00:11:56,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:11:55" (3/4) ... [2024-06-28 00:11:56,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bcdb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 12:11:56, skipping insertion in model container [2024-06-28 00:11:56,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:11:56" (4/4) ... [2024-06-28 00:11:56,586 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2024-06-28 00:11:56,601 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 00:11:56,601 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-28 00:11:56,602 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 00:11:56,681 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 00:11:56,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2024-06-28 00:11:56,755 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-06-28 00:11:56,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:11:56,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-28 00:11:56,759 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 30 transitions, 68 flow [2024-06-28 00:11:56,764 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 50 flow [2024-06-28 00:11:56,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 00:11:56,790 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;@6eb1fdb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 00:11:56,790 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-28 00:11:56,796 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 00:11:56,797 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 00:11:56,797 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:11:56,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:56,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 00:11:56,798 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-28 00:11:56,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:56,804 INFO L85 PathProgramCache]: Analyzing trace with hash 486860762, now seen corresponding path program 1 times [2024-06-28 00:11:56,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:56,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974350995] [2024-06-28 00:11:56,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:56,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:59,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:59,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:59,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974350995] [2024-06-28 00:11:59,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974350995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:59,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:59,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 00:11:59,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074248028] [2024-06-28 00:11:59,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:59,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 00:11:59,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:59,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 00:11:59,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 00:11:59,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-28 00:11:59,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:59,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:59,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-28 00:11:59,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:00,015 INFO L124 PetriNetUnfolderBase]: 113/223 cut-off events. [2024-06-28 00:12:00,016 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-28 00:12:00,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 223 events. 113/223 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 785 event pairs, 61 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 440. Up to 206 conditions per place. [2024-06-28 00:12:00,021 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 21 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-28 00:12:00,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 115 flow [2024-06-28 00:12:00,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 00:12:00,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 00:12:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2024-06-28 00:12:00,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2024-06-28 00:12:00,033 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 3 states and 47 transitions. [2024-06-28 00:12:00,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 115 flow [2024-06-28 00:12:00,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 00:12:00,037 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 69 flow [2024-06-28 00:12:00,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2024-06-28 00:12:00,042 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-06-28 00:12:00,043 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 69 flow [2024-06-28 00:12:00,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:00,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:00,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:00,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 00:12:00,044 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-28 00:12:00,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash -278207367, now seen corresponding path program 1 times [2024-06-28 00:12:00,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:00,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867963361] [2024-06-28 00:12:00,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:00,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:03,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:03,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867963361] [2024-06-28 00:12:03,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867963361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:03,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:03,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 00:12:03,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805712796] [2024-06-28 00:12:03,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:03,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:12:03,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:03,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:12:03,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:12:03,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-28 00:12:03,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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-28 00:12:03,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:03,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-28 00:12:03,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:03,576 INFO L124 PetriNetUnfolderBase]: 110/217 cut-off events. [2024-06-28 00:12:03,576 INFO L125 PetriNetUnfolderBase]: For 44/47 co-relation queries the response was YES. [2024-06-28 00:12:03,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 217 events. 110/217 cut-off events. For 44/47 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 750 event pairs, 46 based on Foata normal form. 4/219 useless extension candidates. Maximal degree in co-relation 494. Up to 190 conditions per place. [2024-06-28 00:12:03,579 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 26 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-28 00:12:03,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 161 flow [2024-06-28 00:12:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 00:12:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 00:12:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2024-06-28 00:12:03,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2024-06-28 00:12:03,581 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 69 flow. Second operand 4 states and 61 transitions. [2024-06-28 00:12:03,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 161 flow [2024-06-28 00:12:03,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 00:12:03,583 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 93 flow [2024-06-28 00:12:03,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2024-06-28 00:12:03,584 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2024-06-28 00:12:03,584 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 93 flow [2024-06-28 00:12:03,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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-28 00:12:03,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:03,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:03,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 00:12:03,585 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-28 00:12:03,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:03,586 INFO L85 PathProgramCache]: Analyzing trace with hash -34492611, now seen corresponding path program 1 times [2024-06-28 00:12:03,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:03,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46393992] [2024-06-28 00:12:03,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:03,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:07,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:07,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46393992] [2024-06-28 00:12:07,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46393992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:07,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:07,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:12:07,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363074703] [2024-06-28 00:12:07,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:07,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:12:07,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:07,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:12:07,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:12:07,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-28 00:12:07,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:07,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:07,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-28 00:12:07,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:08,108 INFO L124 PetriNetUnfolderBase]: 125/242 cut-off events. [2024-06-28 00:12:08,109 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2024-06-28 00:12:08,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 242 events. 125/242 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 837 event pairs, 37 based on Foata normal form. 2/242 useless extension candidates. Maximal degree in co-relation 618. Up to 205 conditions per place. [2024-06-28 00:12:08,114 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 36 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2024-06-28 00:12:08,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 235 flow [2024-06-28 00:12:08,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:12:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:12:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2024-06-28 00:12:08,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2024-06-28 00:12:08,118 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 93 flow. Second operand 5 states and 71 transitions. [2024-06-28 00:12:08,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 235 flow [2024-06-28 00:12:08,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 224 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-28 00:12:08,123 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 137 flow [2024-06-28 00:12:08,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2024-06-28 00:12:08,125 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-06-28 00:12:08,125 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 137 flow [2024-06-28 00:12:08,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:08,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:08,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:08,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 00:12:08,126 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-28 00:12:08,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:08,127 INFO L85 PathProgramCache]: Analyzing trace with hash 352908612, now seen corresponding path program 1 times [2024-06-28 00:12:08,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:08,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853006086] [2024-06-28 00:12:08,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:08,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:12,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:12,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853006086] [2024-06-28 00:12:12,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853006086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:12,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:12,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:12:12,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369161563] [2024-06-28 00:12:12,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:12,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:12:12,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:12,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:12:12,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:12:12,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-28 00:12:12,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:12,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:12,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-28 00:12:12,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:12,500 INFO L124 PetriNetUnfolderBase]: 121/234 cut-off events. [2024-06-28 00:12:12,504 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2024-06-28 00:12:12,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 234 events. 121/234 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 790 event pairs, 18 based on Foata normal form. 4/236 useless extension candidates. Maximal degree in co-relation 674. Up to 175 conditions per place. [2024-06-28 00:12:12,506 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 36 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2024-06-28 00:12:12,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 257 flow [2024-06-28 00:12:12,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:12:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:12:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-06-28 00:12:12,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-28 00:12:12,510 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 137 flow. Second operand 6 states and 78 transitions. [2024-06-28 00:12:12,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 257 flow [2024-06-28 00:12:12,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 257 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 00:12:12,512 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 149 flow [2024-06-28 00:12:12,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2024-06-28 00:12:12,513 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2024-06-28 00:12:12,513 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 149 flow [2024-06-28 00:12:12,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:12,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:12,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:12,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 00:12:12,514 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-28 00:12:12,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:12,515 INFO L85 PathProgramCache]: Analyzing trace with hash 664663670, now seen corresponding path program 1 times [2024-06-28 00:12:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:12,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906380210] [2024-06-28 00:12:12,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:12,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:15,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:15,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906380210] [2024-06-28 00:12:15,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906380210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:15,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:15,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:12:15,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856212714] [2024-06-28 00:12:15,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:15,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:12:15,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:15,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:12:15,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:12:16,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:16,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:16,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:16,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:16,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:16,518 INFO L124 PetriNetUnfolderBase]: 119/231 cut-off events. [2024-06-28 00:12:16,518 INFO L125 PetriNetUnfolderBase]: For 371/371 co-relation queries the response was YES. [2024-06-28 00:12:16,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 231 events. 119/231 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 780 event pairs, 32 based on Foata normal form. 1/230 useless extension candidates. Maximal degree in co-relation 718. Up to 206 conditions per place. [2024-06-28 00:12:16,521 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 29 selfloop transitions, 11 changer transitions 0/43 dead transitions. [2024-06-28 00:12:16,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 277 flow [2024-06-28 00:12:16,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:12:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:12:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2024-06-28 00:12:16,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2024-06-28 00:12:16,526 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 149 flow. Second operand 5 states and 58 transitions. [2024-06-28 00:12:16,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 277 flow [2024-06-28 00:12:16,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 254 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-28 00:12:16,530 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 199 flow [2024-06-28 00:12:16,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2024-06-28 00:12:16,530 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2024-06-28 00:12:16,531 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 199 flow [2024-06-28 00:12:16,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:16,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:16,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:16,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 00:12:16,532 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 00:12:16,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:16,532 INFO L85 PathProgramCache]: Analyzing trace with hash 74411411, now seen corresponding path program 1 times [2024-06-28 00:12:16,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:16,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557082364] [2024-06-28 00:12:16,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:16,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:21,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:21,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:21,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557082364] [2024-06-28 00:12:21,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557082364] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:21,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:21,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:12:21,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839149400] [2024-06-28 00:12:21,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:21,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:12:21,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:21,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:12:21,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:12:21,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:21,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 199 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:21,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:21,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:21,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:21,712 INFO L124 PetriNetUnfolderBase]: 117/228 cut-off events. [2024-06-28 00:12:21,712 INFO L125 PetriNetUnfolderBase]: For 436/436 co-relation queries the response was YES. [2024-06-28 00:12:21,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 228 events. 117/228 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 763 event pairs, 32 based on Foata normal form. 1/227 useless extension candidates. Maximal degree in co-relation 762. Up to 204 conditions per place. [2024-06-28 00:12:21,714 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 29 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2024-06-28 00:12:21,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 289 flow [2024-06-28 00:12:21,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:12:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:12:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2024-06-28 00:12:21,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38 [2024-06-28 00:12:21,716 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 199 flow. Second operand 5 states and 57 transitions. [2024-06-28 00:12:21,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 289 flow [2024-06-28 00:12:21,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 289 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 00:12:21,719 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 227 flow [2024-06-28 00:12:21,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-06-28 00:12:21,720 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2024-06-28 00:12:21,720 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 227 flow [2024-06-28 00:12:21,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:21,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:21,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:21,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 00:12:21,721 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-28 00:12:21,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:21,722 INFO L85 PathProgramCache]: Analyzing trace with hash 254553469, now seen corresponding path program 1 times [2024-06-28 00:12:21,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:21,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915112444] [2024-06-28 00:12:21,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:21,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:28,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:28,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915112444] [2024-06-28 00:12:28,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915112444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:28,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:28,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:12:28,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345556991] [2024-06-28 00:12:28,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:28,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:12:28,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:28,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:12:28,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:12:28,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:28,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 227 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:28,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:28,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:28,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:29,065 INFO L124 PetriNetUnfolderBase]: 120/235 cut-off events. [2024-06-28 00:12:29,065 INFO L125 PetriNetUnfolderBase]: For 600/600 co-relation queries the response was YES. [2024-06-28 00:12:29,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 235 events. 120/235 cut-off events. For 600/600 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 808 event pairs, 30 based on Foata normal form. 1/234 useless extension candidates. Maximal degree in co-relation 824. Up to 181 conditions per place. [2024-06-28 00:12:29,067 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 41 selfloop transitions, 16 changer transitions 0/60 dead transitions. [2024-06-28 00:12:29,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 421 flow [2024-06-28 00:12:29,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:12:29,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:12:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-28 00:12:29,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.362962962962963 [2024-06-28 00:12:29,070 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 227 flow. Second operand 9 states and 98 transitions. [2024-06-28 00:12:29,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 421 flow [2024-06-28 00:12:29,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 406 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 00:12:29,073 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 273 flow [2024-06-28 00:12:29,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=273, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2024-06-28 00:12:29,074 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 27 predicate places. [2024-06-28 00:12:29,074 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 273 flow [2024-06-28 00:12:29,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:29,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:29,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:29,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 00:12:29,075 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-28 00:12:29,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:29,076 INFO L85 PathProgramCache]: Analyzing trace with hash 254673439, now seen corresponding path program 2 times [2024-06-28 00:12:29,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:29,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078750017] [2024-06-28 00:12:29,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:29,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:34,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:34,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078750017] [2024-06-28 00:12:34,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078750017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:34,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:34,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:12:34,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294745649] [2024-06-28 00:12:34,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:34,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:12:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:12:34,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:12:34,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:34,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 273 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:34,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:34,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:34,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:34,890 INFO L124 PetriNetUnfolderBase]: 136/269 cut-off events. [2024-06-28 00:12:34,891 INFO L125 PetriNetUnfolderBase]: For 884/887 co-relation queries the response was YES. [2024-06-28 00:12:34,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 269 events. 136/269 cut-off events. For 884/887 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 982 event pairs, 33 based on Foata normal form. 3/269 useless extension candidates. Maximal degree in co-relation 1017. Up to 211 conditions per place. [2024-06-28 00:12:34,893 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 40 selfloop transitions, 18 changer transitions 0/61 dead transitions. [2024-06-28 00:12:34,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 488 flow [2024-06-28 00:12:34,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:12:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:12:34,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2024-06-28 00:12:34,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-28 00:12:34,895 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 273 flow. Second operand 7 states and 77 transitions. [2024-06-28 00:12:34,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 488 flow [2024-06-28 00:12:34,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 61 transitions, 437 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-28 00:12:34,899 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 349 flow [2024-06-28 00:12:34,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2024-06-28 00:12:34,900 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2024-06-28 00:12:34,900 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 349 flow [2024-06-28 00:12:34,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:34,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:34,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:34,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 00:12:34,901 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-28 00:12:34,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:34,901 INFO L85 PathProgramCache]: Analyzing trace with hash 254673625, now seen corresponding path program 1 times [2024-06-28 00:12:34,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:34,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561238144] [2024-06-28 00:12:34,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:34,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:39,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:39,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561238144] [2024-06-28 00:12:39,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561238144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:39,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:39,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:12:39,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838546814] [2024-06-28 00:12:39,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:39,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:12:39,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:39,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:12:39,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:12:39,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:39,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 349 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:39,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:39,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:39,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:39,759 INFO L124 PetriNetUnfolderBase]: 142/279 cut-off events. [2024-06-28 00:12:39,760 INFO L125 PetriNetUnfolderBase]: For 1041/1044 co-relation queries the response was YES. [2024-06-28 00:12:39,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 279 events. 142/279 cut-off events. For 1041/1044 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1021 event pairs, 32 based on Foata normal form. 4/280 useless extension candidates. Maximal degree in co-relation 1077. Up to 225 conditions per place. [2024-06-28 00:12:39,762 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 43 selfloop transitions, 16 changer transitions 0/62 dead transitions. [2024-06-28 00:12:39,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 503 flow [2024-06-28 00:12:39,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:12:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:12:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2024-06-28 00:12:39,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-06-28 00:12:39,764 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 349 flow. Second operand 7 states and 75 transitions. [2024-06-28 00:12:39,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 503 flow [2024-06-28 00:12:39,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 62 transitions, 484 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-28 00:12:39,769 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 379 flow [2024-06-28 00:12:39,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=379, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-06-28 00:12:39,770 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 34 predicate places. [2024-06-28 00:12:39,770 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 379 flow [2024-06-28 00:12:39,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:39,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:39,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:39,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 00:12:39,771 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-28 00:12:39,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:39,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1988220941, now seen corresponding path program 2 times [2024-06-28 00:12:39,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:39,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720986291] [2024-06-28 00:12:39,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:39,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:43,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:43,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720986291] [2024-06-28 00:12:43,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720986291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:43,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:43,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:12:43,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690792184] [2024-06-28 00:12:43,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:43,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:12:43,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:43,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:12:43,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:12:43,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:43,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 379 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:43,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:43,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:43,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:44,179 INFO L124 PetriNetUnfolderBase]: 148/287 cut-off events. [2024-06-28 00:12:44,179 INFO L125 PetriNetUnfolderBase]: For 1304/1304 co-relation queries the response was YES. [2024-06-28 00:12:44,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 287 events. 148/287 cut-off events. For 1304/1304 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1055 event pairs, 31 based on Foata normal form. 2/287 useless extension candidates. Maximal degree in co-relation 1163. Up to 212 conditions per place. [2024-06-28 00:12:44,182 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 46 selfloop transitions, 21 changer transitions 0/70 dead transitions. [2024-06-28 00:12:44,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 70 transitions, 591 flow [2024-06-28 00:12:44,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:12:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:12:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-28 00:12:44,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2024-06-28 00:12:44,184 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 379 flow. Second operand 7 states and 83 transitions. [2024-06-28 00:12:44,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 70 transitions, 591 flow [2024-06-28 00:12:44,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 70 transitions, 558 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-28 00:12:44,189 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 422 flow [2024-06-28 00:12:44,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=422, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2024-06-28 00:12:44,190 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 36 predicate places. [2024-06-28 00:12:44,190 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 422 flow [2024-06-28 00:12:44,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:44,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:44,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:44,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 00:12:44,191 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-28 00:12:44,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:44,191 INFO L85 PathProgramCache]: Analyzing trace with hash -126855851, now seen corresponding path program 3 times [2024-06-28 00:12:44,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:44,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348586514] [2024-06-28 00:12:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:44,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:47,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-28 00:12:47,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:47,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348586514] [2024-06-28 00:12:47,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348586514] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:47,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:47,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:12:47,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712384075] [2024-06-28 00:12:47,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:47,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:12:47,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:47,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:12:47,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:12:47,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:47,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 422 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:47,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:47,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:47,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:47,785 INFO L124 PetriNetUnfolderBase]: 146/287 cut-off events. [2024-06-28 00:12:47,787 INFO L125 PetriNetUnfolderBase]: For 1580/1589 co-relation queries the response was YES. [2024-06-28 00:12:47,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 287 events. 146/287 cut-off events. For 1580/1589 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1073 event pairs, 35 based on Foata normal form. 7/290 useless extension candidates. Maximal degree in co-relation 1205. Up to 219 conditions per place. [2024-06-28 00:12:47,790 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 40 selfloop transitions, 23 changer transitions 0/66 dead transitions. [2024-06-28 00:12:47,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 602 flow [2024-06-28 00:12:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:12:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:12:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-28 00:12:47,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2024-06-28 00:12:47,792 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 422 flow. Second operand 7 states and 74 transitions. [2024-06-28 00:12:47,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 602 flow [2024-06-28 00:12:47,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 66 transitions, 558 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-28 00:12:47,798 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 454 flow [2024-06-28 00:12:47,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=454, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2024-06-28 00:12:47,799 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 39 predicate places. [2024-06-28 00:12:47,799 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 454 flow [2024-06-28 00:12:47,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:47,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:47,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:47,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 00:12:47,800 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-28 00:12:47,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1526097337, now seen corresponding path program 3 times [2024-06-28 00:12:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:47,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449699162] [2024-06-28 00:12:47,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:47,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:50,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-28 00:12:50,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:50,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449699162] [2024-06-28 00:12:50,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449699162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:50,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:50,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:12:50,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4932275] [2024-06-28 00:12:50,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:50,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:12:50,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:50,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:12:50,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:12:50,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:50,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 454 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:50,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:50,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:50,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:51,188 INFO L124 PetriNetUnfolderBase]: 153/302 cut-off events. [2024-06-28 00:12:51,189 INFO L125 PetriNetUnfolderBase]: For 1781/1790 co-relation queries the response was YES. [2024-06-28 00:12:51,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 302 events. 153/302 cut-off events. For 1781/1790 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1158 event pairs, 35 based on Foata normal form. 10/308 useless extension candidates. Maximal degree in co-relation 1278. Up to 197 conditions per place. [2024-06-28 00:12:51,192 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 40 selfloop transitions, 29 changer transitions 0/72 dead transitions. [2024-06-28 00:12:51,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 72 transitions, 647 flow [2024-06-28 00:12:51,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:12:51,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:12:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-28 00:12:51,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2024-06-28 00:12:51,194 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 454 flow. Second operand 7 states and 79 transitions. [2024-06-28 00:12:51,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 72 transitions, 647 flow [2024-06-28 00:12:51,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 72 transitions, 605 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-28 00:12:51,199 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 539 flow [2024-06-28 00:12:51,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=539, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2024-06-28 00:12:51,200 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 43 predicate places. [2024-06-28 00:12:51,200 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 539 flow [2024-06-28 00:12:51,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:51,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:51,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:51,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 00:12:51,201 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-28 00:12:51,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:51,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1988212013, now seen corresponding path program 1 times [2024-06-28 00:12:51,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:51,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530977839] [2024-06-28 00:12:51,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:51,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:55,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:55,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530977839] [2024-06-28 00:12:55,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530977839] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:55,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:55,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:12:55,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216059916] [2024-06-28 00:12:55,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:55,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:12:55,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:55,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:12:55,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:12:55,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:55,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 539 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:55,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:55,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:55,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:55,783 INFO L124 PetriNetUnfolderBase]: 150/295 cut-off events. [2024-06-28 00:12:55,783 INFO L125 PetriNetUnfolderBase]: For 2107/2107 co-relation queries the response was YES. [2024-06-28 00:12:55,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 295 events. 150/295 cut-off events. For 2107/2107 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1091 event pairs, 35 based on Foata normal form. 2/295 useless extension candidates. Maximal degree in co-relation 1357. Up to 256 conditions per place. [2024-06-28 00:12:55,786 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 56 selfloop transitions, 11 changer transitions 0/70 dead transitions. [2024-06-28 00:12:55,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 70 transitions, 689 flow [2024-06-28 00:12:55,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:12:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:12:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2024-06-28 00:12:55,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32857142857142857 [2024-06-28 00:12:55,788 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 539 flow. Second operand 7 states and 69 transitions. [2024-06-28 00:12:55,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 70 transitions, 689 flow [2024-06-28 00:12:55,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 70 transitions, 637 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-28 00:12:55,793 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 513 flow [2024-06-28 00:12:55,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=513, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2024-06-28 00:12:55,794 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 45 predicate places. [2024-06-28 00:12:55,794 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 513 flow [2024-06-28 00:12:55,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:55,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:55,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:55,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 00:12:55,795 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-28 00:12:55,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:55,795 INFO L85 PathProgramCache]: Analyzing trace with hash -698775573, now seen corresponding path program 1 times [2024-06-28 00:12:55,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:55,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752836387] [2024-06-28 00:12:55,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:55,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:59,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:59,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:59,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752836387] [2024-06-28 00:12:59,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752836387] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:59,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:59,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:12:59,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667666695] [2024-06-28 00:12:59,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:59,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:12:59,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:59,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:12:59,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:12:59,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:59,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 513 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:59,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:59,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:59,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:01,219 INFO L124 PetriNetUnfolderBase]: 156/312 cut-off events. [2024-06-28 00:13:01,220 INFO L125 PetriNetUnfolderBase]: For 2020/2024 co-relation queries the response was YES. [2024-06-28 00:13:01,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1415 conditions, 312 events. 156/312 cut-off events. For 2020/2024 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1205 event pairs, 25 based on Foata normal form. 6/316 useless extension candidates. Maximal degree in co-relation 1377. Up to 188 conditions per place. [2024-06-28 00:13:01,222 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 48 selfloop transitions, 36 changer transitions 0/87 dead transitions. [2024-06-28 00:13:01,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 87 transitions, 757 flow [2024-06-28 00:13:01,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:13:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:13:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2024-06-28 00:13:01,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2024-06-28 00:13:01,225 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 513 flow. Second operand 12 states and 124 transitions. [2024-06-28 00:13:01,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 87 transitions, 757 flow [2024-06-28 00:13:01,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 87 transitions, 726 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-28 00:13:01,231 INFO L231 Difference]: Finished difference. Result has 80 places, 65 transitions, 579 flow [2024-06-28 00:13:01,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=579, PETRI_PLACES=80, PETRI_TRANSITIONS=65} [2024-06-28 00:13:01,232 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2024-06-28 00:13:01,232 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 65 transitions, 579 flow [2024-06-28 00:13:01,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:01,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:01,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:01,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 00:13:01,233 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-28 00:13:01,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:01,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1197382809, now seen corresponding path program 2 times [2024-06-28 00:13:01,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:01,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057873099] [2024-06-28 00:13:01,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:01,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:04,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:04,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057873099] [2024-06-28 00:13:04,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057873099] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:04,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:04,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:13:04,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063125405] [2024-06-28 00:13:04,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:04,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:13:04,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:04,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:13:04,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:13:04,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:13:04,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 65 transitions, 579 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:04,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:04,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:13:04,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:05,570 INFO L124 PetriNetUnfolderBase]: 152/308 cut-off events. [2024-06-28 00:13:05,570 INFO L125 PetriNetUnfolderBase]: For 2266/2270 co-relation queries the response was YES. [2024-06-28 00:13:05,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1454 conditions, 308 events. 152/308 cut-off events. For 2266/2270 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1195 event pairs, 27 based on Foata normal form. 6/312 useless extension candidates. Maximal degree in co-relation 1417. Up to 173 conditions per place. [2024-06-28 00:13:05,573 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 48 selfloop transitions, 37 changer transitions 0/88 dead transitions. [2024-06-28 00:13:05,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 88 transitions, 831 flow [2024-06-28 00:13:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:13:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:13:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-28 00:13:05,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37666666666666665 [2024-06-28 00:13:05,575 INFO L175 Difference]: Start difference. First operand has 80 places, 65 transitions, 579 flow. Second operand 10 states and 113 transitions. [2024-06-28 00:13:05,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 88 transitions, 831 flow [2024-06-28 00:13:05,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 88 transitions, 754 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-28 00:13:05,581 INFO L231 Difference]: Finished difference. Result has 81 places, 67 transitions, 605 flow [2024-06-28 00:13:05,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=605, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2024-06-28 00:13:05,582 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 52 predicate places. [2024-06-28 00:13:05,583 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 605 flow [2024-06-28 00:13:05,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:05,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:05,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:05,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 00:13:05,584 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-28 00:13:05,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:05,584 INFO L85 PathProgramCache]: Analyzing trace with hash -190066692, now seen corresponding path program 1 times [2024-06-28 00:13:05,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:05,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559374640] [2024-06-28 00:13:05,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:05,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:09,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:09,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559374640] [2024-06-28 00:13:09,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559374640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:09,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:09,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:13:09,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670069100] [2024-06-28 00:13:09,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:09,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:13:09,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:09,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:13:09,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:13:09,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:13:09,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 67 transitions, 605 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:09,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:09,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:13:09,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:10,495 INFO L124 PetriNetUnfolderBase]: 156/312 cut-off events. [2024-06-28 00:13:10,496 INFO L125 PetriNetUnfolderBase]: For 2523/2527 co-relation queries the response was YES. [2024-06-28 00:13:10,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 312 events. 156/312 cut-off events. For 2523/2527 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1210 event pairs, 9 based on Foata normal form. 6/316 useless extension candidates. Maximal degree in co-relation 1463. Up to 173 conditions per place. [2024-06-28 00:13:10,499 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 56 selfloop transitions, 30 changer transitions 0/89 dead transitions. [2024-06-28 00:13:10,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 89 transitions, 865 flow [2024-06-28 00:13:10,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:13:10,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:13:10,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-28 00:13:10,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-28 00:13:10,501 INFO L175 Difference]: Start difference. First operand has 81 places, 67 transitions, 605 flow. Second operand 11 states and 110 transitions. [2024-06-28 00:13:10,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 89 transitions, 865 flow [2024-06-28 00:13:10,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 778 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-28 00:13:10,508 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 590 flow [2024-06-28 00:13:10,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=590, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2024-06-28 00:13:10,509 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 55 predicate places. [2024-06-28 00:13:10,509 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 590 flow [2024-06-28 00:13:10,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:10,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:10,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:10,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 00:13:10,510 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-28 00:13:10,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:10,511 INFO L85 PathProgramCache]: Analyzing trace with hash -187209732, now seen corresponding path program 2 times [2024-06-28 00:13:10,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:10,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145878360] [2024-06-28 00:13:10,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:10,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:15,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:15,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145878360] [2024-06-28 00:13:15,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145878360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:15,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:15,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:13:15,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860442137] [2024-06-28 00:13:15,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:15,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:13:15,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:15,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:13:15,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:13:15,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:13:15,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 590 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:15,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:15,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:13:15,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:16,808 INFO L124 PetriNetUnfolderBase]: 160/320 cut-off events. [2024-06-28 00:13:16,809 INFO L125 PetriNetUnfolderBase]: For 2639/2643 co-relation queries the response was YES. [2024-06-28 00:13:16,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 320 events. 160/320 cut-off events. For 2639/2643 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1239 event pairs, 23 based on Foata normal form. 6/324 useless extension candidates. Maximal degree in co-relation 1481. Up to 226 conditions per place. [2024-06-28 00:13:16,813 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 57 selfloop transitions, 28 changer transitions 0/88 dead transitions. [2024-06-28 00:13:16,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 816 flow [2024-06-28 00:13:16,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:13:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:13:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-28 00:13:16,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-28 00:13:16,815 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 590 flow. Second operand 11 states and 110 transitions. [2024-06-28 00:13:16,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 816 flow [2024-06-28 00:13:16,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 88 transitions, 755 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-28 00:13:16,822 INFO L231 Difference]: Finished difference. Result has 87 places, 69 transitions, 601 flow [2024-06-28 00:13:16,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=601, PETRI_PLACES=87, PETRI_TRANSITIONS=69} [2024-06-28 00:13:16,823 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2024-06-28 00:13:16,823 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 69 transitions, 601 flow [2024-06-28 00:13:16,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:16,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:16,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:16,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 00:13:16,824 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-28 00:13:16,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:16,825 INFO L85 PathProgramCache]: Analyzing trace with hash -188615044, now seen corresponding path program 3 times [2024-06-28 00:13:16,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:16,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495475548] [2024-06-28 00:13:16,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:16,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:21,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:21,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495475548] [2024-06-28 00:13:21,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495475548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:21,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:21,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:13:21,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525616838] [2024-06-28 00:13:21,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:21,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:13:21,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:21,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:13:21,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:13:21,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:13:21,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 69 transitions, 601 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:21,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:21,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:13:21,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:22,291 INFO L124 PetriNetUnfolderBase]: 170/342 cut-off events. [2024-06-28 00:13:22,292 INFO L125 PetriNetUnfolderBase]: For 3056/3062 co-relation queries the response was YES. [2024-06-28 00:13:22,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 342 events. 170/342 cut-off events. For 3056/3062 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1395 event pairs, 26 based on Foata normal form. 6/345 useless extension candidates. Maximal degree in co-relation 1561. Up to 258 conditions per place. [2024-06-28 00:13:22,294 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 63 selfloop transitions, 20 changer transitions 0/86 dead transitions. [2024-06-28 00:13:22,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 86 transitions, 825 flow [2024-06-28 00:13:22,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:13:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:13:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-28 00:13:22,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2024-06-28 00:13:22,297 INFO L175 Difference]: Start difference. First operand has 87 places, 69 transitions, 601 flow. Second operand 7 states and 83 transitions. [2024-06-28 00:13:22,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 86 transitions, 825 flow [2024-06-28 00:13:22,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 86 transitions, 765 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-28 00:13:22,304 INFO L231 Difference]: Finished difference. Result has 85 places, 71 transitions, 609 flow [2024-06-28 00:13:22,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=609, PETRI_PLACES=85, PETRI_TRANSITIONS=71} [2024-06-28 00:13:22,305 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 56 predicate places. [2024-06-28 00:13:22,305 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 71 transitions, 609 flow [2024-06-28 00:13:22,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:22,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:22,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:22,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 00:13:22,306 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-28 00:13:22,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:22,306 INFO L85 PathProgramCache]: Analyzing trace with hash -188430346, now seen corresponding path program 1 times [2024-06-28 00:13:22,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:22,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498455742] [2024-06-28 00:13:22,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:22,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:27,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:27,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498455742] [2024-06-28 00:13:27,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498455742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:27,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:27,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:13:27,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038193123] [2024-06-28 00:13:27,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:27,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:13:27,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:27,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:13:27,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:13:27,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:13:27,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 71 transitions, 609 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:27,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:27,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:13:27,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:28,635 INFO L124 PetriNetUnfolderBase]: 174/352 cut-off events. [2024-06-28 00:13:28,635 INFO L125 PetriNetUnfolderBase]: For 3356/3362 co-relation queries the response was YES. [2024-06-28 00:13:28,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 352 events. 174/352 cut-off events. For 3356/3362 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1453 event pairs, 30 based on Foata normal form. 6/355 useless extension candidates. Maximal degree in co-relation 1593. Up to 284 conditions per place. [2024-06-28 00:13:28,638 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 63 selfloop transitions, 18 changer transitions 0/84 dead transitions. [2024-06-28 00:13:28,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 84 transitions, 814 flow [2024-06-28 00:13:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:13:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:13:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-28 00:13:28,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3458333333333333 [2024-06-28 00:13:28,641 INFO L175 Difference]: Start difference. First operand has 85 places, 71 transitions, 609 flow. Second operand 8 states and 83 transitions. [2024-06-28 00:13:28,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 84 transitions, 814 flow [2024-06-28 00:13:28,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 84 transitions, 772 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 00:13:28,649 INFO L231 Difference]: Finished difference. Result has 88 places, 72 transitions, 617 flow [2024-06-28 00:13:28,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=617, PETRI_PLACES=88, PETRI_TRANSITIONS=72} [2024-06-28 00:13:28,649 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 59 predicate places. [2024-06-28 00:13:28,650 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 72 transitions, 617 flow [2024-06-28 00:13:28,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:28,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:28,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:28,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 00:13:28,650 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-28 00:13:28,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:28,651 INFO L85 PathProgramCache]: Analyzing trace with hash 588741682, now seen corresponding path program 2 times [2024-06-28 00:13:28,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:28,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22044814] [2024-06-28 00:13:28,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:28,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:33,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:33,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:33,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22044814] [2024-06-28 00:13:33,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22044814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:33,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:33,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:13:33,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714260165] [2024-06-28 00:13:33,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:33,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:13:33,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:33,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:13:33,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:13:33,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:13:33,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 72 transitions, 617 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:33,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:33,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:13:33,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:33,808 INFO L124 PetriNetUnfolderBase]: 178/362 cut-off events. [2024-06-28 00:13:33,808 INFO L125 PetriNetUnfolderBase]: For 3641/3645 co-relation queries the response was YES. [2024-06-28 00:13:33,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 362 events. 178/362 cut-off events. For 3641/3645 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1514 event pairs, 33 based on Foata normal form. 6/366 useless extension candidates. Maximal degree in co-relation 1637. Up to 247 conditions per place. [2024-06-28 00:13:33,811 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 58 selfloop transitions, 28 changer transitions 0/89 dead transitions. [2024-06-28 00:13:33,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 89 transitions, 877 flow [2024-06-28 00:13:33,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:13:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:13:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-28 00:13:33,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34814814814814815 [2024-06-28 00:13:33,812 INFO L175 Difference]: Start difference. First operand has 88 places, 72 transitions, 617 flow. Second operand 9 states and 94 transitions. [2024-06-28 00:13:33,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 89 transitions, 877 flow [2024-06-28 00:13:33,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 89 transitions, 837 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-28 00:13:33,818 INFO L231 Difference]: Finished difference. Result has 91 places, 73 transitions, 647 flow [2024-06-28 00:13:33,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=647, PETRI_PLACES=91, PETRI_TRANSITIONS=73} [2024-06-28 00:13:33,819 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-28 00:13:33,819 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 73 transitions, 647 flow [2024-06-28 00:13:33,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:33,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:33,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:33,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 00:13:33,820 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-28 00:13:33,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:33,820 INFO L85 PathProgramCache]: Analyzing trace with hash 588445012, now seen corresponding path program 3 times [2024-06-28 00:13:33,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:33,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405204009] [2024-06-28 00:13:33,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:33,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:38,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:38,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405204009] [2024-06-28 00:13:38,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405204009] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:38,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:38,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:13:38,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003958740] [2024-06-28 00:13:38,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:38,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:13:38,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:38,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:13:38,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:13:38,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:13:38,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 73 transitions, 647 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:38,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:38,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:13:38,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:38,675 INFO L124 PetriNetUnfolderBase]: 182/372 cut-off events. [2024-06-28 00:13:38,676 INFO L125 PetriNetUnfolderBase]: For 4034/4038 co-relation queries the response was YES. [2024-06-28 00:13:38,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1759 conditions, 372 events. 182/372 cut-off events. For 4034/4038 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1571 event pairs, 35 based on Foata normal form. 6/376 useless extension candidates. Maximal degree in co-relation 1715. Up to 280 conditions per place. [2024-06-28 00:13:38,679 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 60 selfloop transitions, 25 changer transitions 0/88 dead transitions. [2024-06-28 00:13:38,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 88 transitions, 865 flow [2024-06-28 00:13:38,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:13:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:13:38,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-06-28 00:13:38,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35185185185185186 [2024-06-28 00:13:38,683 INFO L175 Difference]: Start difference. First operand has 91 places, 73 transitions, 647 flow. Second operand 9 states and 95 transitions. [2024-06-28 00:13:38,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 88 transitions, 865 flow [2024-06-28 00:13:38,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 88 transitions, 805 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-28 00:13:38,693 INFO L231 Difference]: Finished difference. Result has 94 places, 74 transitions, 655 flow [2024-06-28 00:13:38,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=655, PETRI_PLACES=94, PETRI_TRANSITIONS=74} [2024-06-28 00:13:38,694 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-28 00:13:38,694 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 74 transitions, 655 flow [2024-06-28 00:13:38,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:38,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:38,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:38,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 00:13:38,695 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-28 00:13:38,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:38,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1649524838, now seen corresponding path program 4 times [2024-06-28 00:13:38,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:38,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465864160] [2024-06-28 00:13:38,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:38,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:41,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:41,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465864160] [2024-06-28 00:13:41,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465864160] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:41,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:41,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:13:41,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046380493] [2024-06-28 00:13:41,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:41,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:13:41,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:41,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:13:41,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:13:42,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:13:42,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 74 transitions, 655 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:42,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:42,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:13:42,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:42,495 INFO L124 PetriNetUnfolderBase]: 185/378 cut-off events. [2024-06-28 00:13:42,496 INFO L125 PetriNetUnfolderBase]: For 3997/4012 co-relation queries the response was YES. [2024-06-28 00:13:42,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 378 events. 185/378 cut-off events. For 3997/4012 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1626 event pairs, 37 based on Foata normal form. 12/386 useless extension candidates. Maximal degree in co-relation 1688. Up to 261 conditions per place. [2024-06-28 00:13:42,499 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 59 selfloop transitions, 24 changer transitions 0/86 dead transitions. [2024-06-28 00:13:42,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 86 transitions, 858 flow [2024-06-28 00:13:42,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:13:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:13:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2024-06-28 00:13:42,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-28 00:13:42,502 INFO L175 Difference]: Start difference. First operand has 94 places, 74 transitions, 655 flow. Second operand 7 states and 77 transitions. [2024-06-28 00:13:42,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 86 transitions, 858 flow [2024-06-28 00:13:42,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 86 transitions, 800 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-28 00:13:42,511 INFO L231 Difference]: Finished difference. Result has 94 places, 75 transitions, 666 flow [2024-06-28 00:13:42,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=666, PETRI_PLACES=94, PETRI_TRANSITIONS=75} [2024-06-28 00:13:42,512 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-28 00:13:42,512 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 75 transitions, 666 flow [2024-06-28 00:13:42,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:42,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:42,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:42,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 00:13:42,514 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-28 00:13:42,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:42,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1995920050, now seen corresponding path program 4 times [2024-06-28 00:13:42,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:42,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779821999] [2024-06-28 00:13:42,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:42,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:46,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:46,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779821999] [2024-06-28 00:13:46,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779821999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:46,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:46,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:13:46,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902954409] [2024-06-28 00:13:46,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:46,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:13:46,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:46,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:13:46,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:13:46,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:13:46,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 75 transitions, 666 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:46,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:46,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:13:46,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:47,366 INFO L124 PetriNetUnfolderBase]: 182/375 cut-off events. [2024-06-28 00:13:47,366 INFO L125 PetriNetUnfolderBase]: For 3866/3881 co-relation queries the response was YES. [2024-06-28 00:13:47,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1690 conditions, 375 events. 182/375 cut-off events. For 3866/3881 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1612 event pairs, 36 based on Foata normal form. 12/383 useless extension candidates. Maximal degree in co-relation 1644. Up to 280 conditions per place. [2024-06-28 00:13:47,369 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 55 selfloop transitions, 24 changer transitions 0/82 dead transitions. [2024-06-28 00:13:47,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 82 transitions, 840 flow [2024-06-28 00:13:47,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:13:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:13:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2024-06-28 00:13:47,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3476190476190476 [2024-06-28 00:13:47,371 INFO L175 Difference]: Start difference. First operand has 94 places, 75 transitions, 666 flow. Second operand 7 states and 73 transitions. [2024-06-28 00:13:47,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 82 transitions, 840 flow [2024-06-28 00:13:47,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 82 transitions, 774 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-28 00:13:47,382 INFO L231 Difference]: Finished difference. Result has 95 places, 75 transitions, 656 flow [2024-06-28 00:13:47,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=656, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2024-06-28 00:13:47,382 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 66 predicate places. [2024-06-28 00:13:47,383 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 656 flow [2024-06-28 00:13:47,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:47,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:47,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:47,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 00:13:47,383 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-28 00:13:47,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:47,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1098770416, now seen corresponding path program 1 times [2024-06-28 00:13:47,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:47,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276140806] [2024-06-28 00:13:47,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:47,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:52,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:52,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276140806] [2024-06-28 00:13:52,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276140806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:52,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:52,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:13:52,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696683978] [2024-06-28 00:13:52,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:52,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:13:52,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:52,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:13:52,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:13:52,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:13:52,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 75 transitions, 656 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:52,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:52,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:13:52,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:53,396 INFO L124 PetriNetUnfolderBase]: 229/475 cut-off events. [2024-06-28 00:13:53,397 INFO L125 PetriNetUnfolderBase]: For 7442/7446 co-relation queries the response was YES. [2024-06-28 00:13:53,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2222 conditions, 475 events. 229/475 cut-off events. For 7442/7446 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2162 event pairs, 30 based on Foata normal form. 12/485 useless extension candidates. Maximal degree in co-relation 2175. Up to 153 conditions per place. [2024-06-28 00:13:53,400 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 55 selfloop transitions, 36 changer transitions 18/112 dead transitions. [2024-06-28 00:13:53,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 112 transitions, 1081 flow [2024-06-28 00:13:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 00:13:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 00:13:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 139 transitions. [2024-06-28 00:13:53,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3564102564102564 [2024-06-28 00:13:53,401 INFO L175 Difference]: Start difference. First operand has 95 places, 75 transitions, 656 flow. Second operand 13 states and 139 transitions. [2024-06-28 00:13:53,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 112 transitions, 1081 flow [2024-06-28 00:13:53,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 112 transitions, 1015 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-28 00:13:53,410 INFO L231 Difference]: Finished difference. Result has 103 places, 72 transitions, 666 flow [2024-06-28 00:13:53,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=666, PETRI_PLACES=103, PETRI_TRANSITIONS=72} [2024-06-28 00:13:53,410 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 74 predicate places. [2024-06-28 00:13:53,410 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 72 transitions, 666 flow [2024-06-28 00:13:53,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:53,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:53,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:53,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 00:13:53,411 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-28 00:13:53,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:53,411 INFO L85 PathProgramCache]: Analyzing trace with hash -831008692, now seen corresponding path program 2 times [2024-06-28 00:13:53,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:53,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658980669] [2024-06-28 00:13:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:58,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:58,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658980669] [2024-06-28 00:13:58,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658980669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:58,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:58,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:13:58,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855658532] [2024-06-28 00:13:58,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:58,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:13:58,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:58,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:13:58,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:13:58,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:13:58,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 72 transitions, 666 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:58,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:58,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:13:58,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:59,576 INFO L124 PetriNetUnfolderBase]: 195/413 cut-off events. [2024-06-28 00:13:59,576 INFO L125 PetriNetUnfolderBase]: For 7181/7185 co-relation queries the response was YES. [2024-06-28 00:13:59,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 413 events. 195/413 cut-off events. For 7181/7185 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1841 event pairs, 40 based on Foata normal form. 14/425 useless extension candidates. Maximal degree in co-relation 1951. Up to 233 conditions per place. [2024-06-28 00:13:59,580 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 47 selfloop transitions, 35 changer transitions 11/96 dead transitions. [2024-06-28 00:13:59,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 96 transitions, 936 flow [2024-06-28 00:13:59,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 00:13:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 00:13:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 134 transitions. [2024-06-28 00:13:59,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.319047619047619 [2024-06-28 00:13:59,582 INFO L175 Difference]: Start difference. First operand has 103 places, 72 transitions, 666 flow. Second operand 14 states and 134 transitions. [2024-06-28 00:13:59,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 96 transitions, 936 flow [2024-06-28 00:13:59,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 96 transitions, 889 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-28 00:13:59,593 INFO L231 Difference]: Finished difference. Result has 104 places, 69 transitions, 670 flow [2024-06-28 00:13:59,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=670, PETRI_PLACES=104, PETRI_TRANSITIONS=69} [2024-06-28 00:13:59,594 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 75 predicate places. [2024-06-28 00:13:59,594 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 69 transitions, 670 flow [2024-06-28 00:13:59,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:59,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:59,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:59,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 00:13:59,595 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-28 00:13:59,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1508532916, now seen corresponding path program 3 times [2024-06-28 00:13:59,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:59,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798705805] [2024-06-28 00:13:59,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:59,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:04,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:04,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798705805] [2024-06-28 00:14:04,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798705805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:04,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:04,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:14:04,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357245640] [2024-06-28 00:14:04,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:04,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:14:04,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:04,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:14:04,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:14:04,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:14:04,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 69 transitions, 670 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:04,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:04,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:14:04,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:05,151 INFO L124 PetriNetUnfolderBase]: 183/395 cut-off events. [2024-06-28 00:14:05,151 INFO L125 PetriNetUnfolderBase]: For 5670/5674 co-relation queries the response was YES. [2024-06-28 00:14:05,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1914 conditions, 395 events. 183/395 cut-off events. For 5670/5674 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1725 event pairs, 30 based on Foata normal form. 12/405 useless extension candidates. Maximal degree in co-relation 1867. Up to 223 conditions per place. [2024-06-28 00:14:05,154 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 40 selfloop transitions, 28 changer transitions 21/92 dead transitions. [2024-06-28 00:14:05,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 92 transitions, 916 flow [2024-06-28 00:14:05,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 00:14:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 00:14:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 126 transitions. [2024-06-28 00:14:05,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3230769230769231 [2024-06-28 00:14:05,155 INFO L175 Difference]: Start difference. First operand has 104 places, 69 transitions, 670 flow. Second operand 13 states and 126 transitions. [2024-06-28 00:14:05,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 92 transitions, 916 flow [2024-06-28 00:14:05,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 92 transitions, 836 flow, removed 5 selfloop flow, removed 13 redundant places. [2024-06-28 00:14:05,162 INFO L231 Difference]: Finished difference. Result has 101 places, 60 transitions, 571 flow [2024-06-28 00:14:05,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=571, PETRI_PLACES=101, PETRI_TRANSITIONS=60} [2024-06-28 00:14:05,162 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 72 predicate places. [2024-06-28 00:14:05,162 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 60 transitions, 571 flow [2024-06-28 00:14:05,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:05,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:05,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:05,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 00:14:05,163 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-28 00:14:05,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:05,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2071003604, now seen corresponding path program 4 times [2024-06-28 00:14:05,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:05,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009047951] [2024-06-28 00:14:05,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:05,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:10,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-28 00:14:10,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:10,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009047951] [2024-06-28 00:14:10,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009047951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:10,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:10,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:14:10,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443630093] [2024-06-28 00:14:10,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:10,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:14:10,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:10,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:14:10,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:14:10,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:14:10,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 60 transitions, 571 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:10,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:10,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:14:10,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:10,834 INFO L124 PetriNetUnfolderBase]: 166/341 cut-off events. [2024-06-28 00:14:10,834 INFO L125 PetriNetUnfolderBase]: For 4315/4327 co-relation queries the response was YES. [2024-06-28 00:14:10,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 341 events. 166/341 cut-off events. For 4315/4327 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1385 event pairs, 33 based on Foata normal form. 14/352 useless extension candidates. Maximal degree in co-relation 1633. Up to 252 conditions per place. [2024-06-28 00:14:10,837 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 49 selfloop transitions, 28 changer transitions 0/80 dead transitions. [2024-06-28 00:14:10,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 80 transitions, 813 flow [2024-06-28 00:14:10,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:14:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:14:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2024-06-28 00:14:10,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3151515151515151 [2024-06-28 00:14:10,840 INFO L175 Difference]: Start difference. First operand has 101 places, 60 transitions, 571 flow. Second operand 11 states and 104 transitions. [2024-06-28 00:14:10,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 80 transitions, 813 flow [2024-06-28 00:14:10,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 80 transitions, 713 flow, removed 5 selfloop flow, removed 16 redundant places. [2024-06-28 00:14:10,847 INFO L231 Difference]: Finished difference. Result has 91 places, 68 transitions, 613 flow [2024-06-28 00:14:10,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=613, PETRI_PLACES=91, PETRI_TRANSITIONS=68} [2024-06-28 00:14:10,848 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-28 00:14:10,848 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 68 transitions, 613 flow [2024-06-28 00:14:10,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:10,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:10,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:10,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 00:14:10,849 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-28 00:14:10,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:10,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1546372136, now seen corresponding path program 1 times [2024-06-28 00:14:10,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:10,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205965713] [2024-06-28 00:14:10,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:10,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:15,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:15,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:15,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205965713] [2024-06-28 00:14:15,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205965713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:15,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:15,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:14:15,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342661710] [2024-06-28 00:14:15,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:15,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:14:15,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:15,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:14:15,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:14:15,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:14:15,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 68 transitions, 613 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:15,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:15,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:14:15,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:17,039 INFO L124 PetriNetUnfolderBase]: 203/420 cut-off events. [2024-06-28 00:14:17,039 INFO L125 PetriNetUnfolderBase]: For 4793/4809 co-relation queries the response was YES. [2024-06-28 00:14:17,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2004 conditions, 420 events. 203/420 cut-off events. For 4793/4809 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1897 event pairs, 50 based on Foata normal form. 22/439 useless extension candidates. Maximal degree in co-relation 1961. Up to 220 conditions per place. [2024-06-28 00:14:17,041 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 55 selfloop transitions, 23 changer transitions 6/87 dead transitions. [2024-06-28 00:14:17,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 87 transitions, 880 flow [2024-06-28 00:14:17,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:14:17,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:14:17,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2024-06-28 00:14:17,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303030303030303 [2024-06-28 00:14:17,043 INFO L175 Difference]: Start difference. First operand has 91 places, 68 transitions, 613 flow. Second operand 11 states and 109 transitions. [2024-06-28 00:14:17,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 87 transitions, 880 flow [2024-06-28 00:14:17,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 87 transitions, 843 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-28 00:14:17,051 INFO L231 Difference]: Finished difference. Result has 98 places, 66 transitions, 604 flow [2024-06-28 00:14:17,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=604, PETRI_PLACES=98, PETRI_TRANSITIONS=66} [2024-06-28 00:14:17,052 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-28 00:14:17,052 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 66 transitions, 604 flow [2024-06-28 00:14:17,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:17,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:17,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:17,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 00:14:17,053 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-28 00:14:17,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:17,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1546581386, now seen corresponding path program 2 times [2024-06-28 00:14:17,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:17,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647096376] [2024-06-28 00:14:17,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:17,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:22,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:22,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647096376] [2024-06-28 00:14:22,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647096376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:22,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:22,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:14:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819139294] [2024-06-28 00:14:22,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:22,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:14:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:22,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:14:22,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:14:22,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:14:22,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 66 transitions, 604 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:22,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:22,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:14:22,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:23,692 INFO L124 PetriNetUnfolderBase]: 204/419 cut-off events. [2024-06-28 00:14:23,692 INFO L125 PetriNetUnfolderBase]: For 5574/5574 co-relation queries the response was YES. [2024-06-28 00:14:23,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2066 conditions, 419 events. 204/419 cut-off events. For 5574/5574 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1908 event pairs, 58 based on Foata normal form. 8/424 useless extension candidates. Maximal degree in co-relation 2021. Up to 297 conditions per place. [2024-06-28 00:14:23,696 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 44 selfloop transitions, 18 changer transitions 17/82 dead transitions. [2024-06-28 00:14:23,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 82 transitions, 831 flow [2024-06-28 00:14:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:14:23,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:14:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2024-06-28 00:14:23,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-28 00:14:23,698 INFO L175 Difference]: Start difference. First operand has 98 places, 66 transitions, 604 flow. Second operand 10 states and 100 transitions. [2024-06-28 00:14:23,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 82 transitions, 831 flow [2024-06-28 00:14:23,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 82 transitions, 795 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-28 00:14:23,707 INFO L231 Difference]: Finished difference. Result has 97 places, 58 transitions, 517 flow [2024-06-28 00:14:23,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=517, PETRI_PLACES=97, PETRI_TRANSITIONS=58} [2024-06-28 00:14:23,708 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 68 predicate places. [2024-06-28 00:14:23,708 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 58 transitions, 517 flow [2024-06-28 00:14:23,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:23,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:23,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:23,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 00:14:23,709 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-28 00:14:23,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:23,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1551949718, now seen corresponding path program 5 times [2024-06-28 00:14:23,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:23,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240833139] [2024-06-28 00:14:23,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:23,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:28,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:28,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240833139] [2024-06-28 00:14:28,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240833139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:28,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:28,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:14:28,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915583054] [2024-06-28 00:14:28,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:28,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:14:28,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:28,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:14:28,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:14:28,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:14:28,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 58 transitions, 517 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:28,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:28,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:14:28,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:29,235 INFO L124 PetriNetUnfolderBase]: 183/382 cut-off events. [2024-06-28 00:14:29,235 INFO L125 PetriNetUnfolderBase]: For 5370/5370 co-relation queries the response was YES. [2024-06-28 00:14:29,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1857 conditions, 382 events. 183/382 cut-off events. For 5370/5370 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1678 event pairs, 61 based on Foata normal form. 10/389 useless extension candidates. Maximal degree in co-relation 1813. Up to 278 conditions per place. [2024-06-28 00:14:29,237 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 42 selfloop transitions, 13 changer transitions 13/71 dead transitions. [2024-06-28 00:14:29,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 71 transitions, 704 flow [2024-06-28 00:14:29,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:14:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:14:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2024-06-28 00:14:29,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2024-06-28 00:14:29,238 INFO L175 Difference]: Start difference. First operand has 97 places, 58 transitions, 517 flow. Second operand 9 states and 87 transitions. [2024-06-28 00:14:29,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 71 transitions, 704 flow [2024-06-28 00:14:29,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 71 transitions, 651 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-28 00:14:29,246 INFO L231 Difference]: Finished difference. Result has 89 places, 52 transitions, 433 flow [2024-06-28 00:14:29,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=433, PETRI_PLACES=89, PETRI_TRANSITIONS=52} [2024-06-28 00:14:29,246 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-28 00:14:29,247 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 52 transitions, 433 flow [2024-06-28 00:14:29,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:29,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:29,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:29,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 00:14:29,247 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-28 00:14:29,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:29,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1552097588, now seen corresponding path program 6 times [2024-06-28 00:14:29,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:29,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838521230] [2024-06-28 00:14:29,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:29,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:38,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:38,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838521230] [2024-06-28 00:14:38,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838521230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:38,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:38,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:14:38,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104549922] [2024-06-28 00:14:38,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:38,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:14:38,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:38,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:14:38,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:14:38,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:14:38,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 52 transitions, 433 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:38,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:38,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:14:38,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:39,285 INFO L124 PetriNetUnfolderBase]: 147/314 cut-off events. [2024-06-28 00:14:39,286 INFO L125 PetriNetUnfolderBase]: For 3614/3614 co-relation queries the response was YES. [2024-06-28 00:14:39,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 314 events. 147/314 cut-off events. For 3614/3614 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1291 event pairs, 37 based on Foata normal form. 8/319 useless extension candidates. Maximal degree in co-relation 1391. Up to 220 conditions per place. [2024-06-28 00:14:39,287 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 36 selfloop transitions, 7 changer transitions 19/65 dead transitions. [2024-06-28 00:14:39,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 65 transitions, 601 flow [2024-06-28 00:14:39,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:14:39,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:14:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2024-06-28 00:14:39,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2024-06-28 00:14:39,289 INFO L175 Difference]: Start difference. First operand has 89 places, 52 transitions, 433 flow. Second operand 9 states and 84 transitions. [2024-06-28 00:14:39,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 65 transitions, 601 flow [2024-06-28 00:14:39,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 65 transitions, 552 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-28 00:14:39,294 INFO L231 Difference]: Finished difference. Result has 83 places, 45 transitions, 326 flow [2024-06-28 00:14:39,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=326, PETRI_PLACES=83, PETRI_TRANSITIONS=45} [2024-06-28 00:14:39,294 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 54 predicate places. [2024-06-28 00:14:39,294 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 45 transitions, 326 flow [2024-06-28 00:14:39,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:39,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:39,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:39,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 00:14:39,295 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-28 00:14:39,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:39,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1061920042, now seen corresponding path program 3 times [2024-06-28 00:14:39,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:39,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484876513] [2024-06-28 00:14:39,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:39,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:44,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:44,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484876513] [2024-06-28 00:14:44,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484876513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:44,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:44,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:14:44,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383794348] [2024-06-28 00:14:44,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:44,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:14:44,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:44,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:14:44,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:14:44,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:14:44,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 45 transitions, 326 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:44,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:44,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:14:44,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:45,560 INFO L124 PetriNetUnfolderBase]: 122/265 cut-off events. [2024-06-28 00:14:45,561 INFO L125 PetriNetUnfolderBase]: For 2861/2861 co-relation queries the response was YES. [2024-06-28 00:14:45,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 265 events. 122/265 cut-off events. For 2861/2861 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1046 event pairs, 34 based on Foata normal form. 10/273 useless extension candidates. Maximal degree in co-relation 1067. Up to 147 conditions per place. [2024-06-28 00:14:45,563 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 34 selfloop transitions, 17 changer transitions 11/65 dead transitions. [2024-06-28 00:14:45,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 65 transitions, 528 flow [2024-06-28 00:14:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:14:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:14:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-28 00:14:45,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2024-06-28 00:14:45,565 INFO L175 Difference]: Start difference. First operand has 83 places, 45 transitions, 326 flow. Second operand 11 states and 114 transitions. [2024-06-28 00:14:45,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 65 transitions, 528 flow [2024-06-28 00:14:45,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 65 transitions, 487 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-28 00:14:45,569 INFO L231 Difference]: Finished difference. Result has 74 places, 42 transitions, 306 flow [2024-06-28 00:14:45,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=306, PETRI_PLACES=74, PETRI_TRANSITIONS=42} [2024-06-28 00:14:45,570 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 45 predicate places. [2024-06-28 00:14:45,570 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 42 transitions, 306 flow [2024-06-28 00:14:45,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:45,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:45,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:45,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 00:14:45,571 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-28 00:14:45,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:45,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1061927482, now seen corresponding path program 4 times [2024-06-28 00:14:45,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:45,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656376523] [2024-06-28 00:14:45,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:45,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:50,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:50,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656376523] [2024-06-28 00:14:50,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656376523] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:50,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:50,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:14:50,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401414606] [2024-06-28 00:14:50,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:50,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:14:50,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:50,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:14:50,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:14:50,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:14:50,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 42 transitions, 306 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:50,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:50,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:14:50,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:51,805 INFO L124 PetriNetUnfolderBase]: 100/223 cut-off events. [2024-06-28 00:14:51,806 INFO L125 PetriNetUnfolderBase]: For 1999/1999 co-relation queries the response was YES. [2024-06-28 00:14:51,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 223 events. 100/223 cut-off events. For 1999/1999 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 816 event pairs, 26 based on Foata normal form. 2/223 useless extension candidates. Maximal degree in co-relation 938. Up to 141 conditions per place. [2024-06-28 00:14:51,807 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 37 selfloop transitions, 19 changer transitions 0/59 dead transitions. [2024-06-28 00:14:51,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 59 transitions, 472 flow [2024-06-28 00:14:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:14:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:14:51,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 114 transitions. [2024-06-28 00:14:51,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2024-06-28 00:14:51,808 INFO L175 Difference]: Start difference. First operand has 74 places, 42 transitions, 306 flow. Second operand 12 states and 114 transitions. [2024-06-28 00:14:51,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 59 transitions, 472 flow [2024-06-28 00:14:51,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 59 transitions, 428 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-28 00:14:51,812 INFO L231 Difference]: Finished difference. Result has 73 places, 43 transitions, 314 flow [2024-06-28 00:14:51,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=314, PETRI_PLACES=73, PETRI_TRANSITIONS=43} [2024-06-28 00:14:51,813 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2024-06-28 00:14:51,813 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 43 transitions, 314 flow [2024-06-28 00:14:51,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:51,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:51,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:51,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 00:14:51,814 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-28 00:14:51,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1071124252, now seen corresponding path program 5 times [2024-06-28 00:14:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:51,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323908037] [2024-06-28 00:14:51,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:51,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:56,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323908037] [2024-06-28 00:14:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323908037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:56,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:56,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:14:56,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531798747] [2024-06-28 00:14:56,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:56,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:14:56,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:56,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:14:56,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:14:56,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:14:56,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 43 transitions, 314 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:56,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:56,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:14:56,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:57,959 INFO L124 PetriNetUnfolderBase]: 130/291 cut-off events. [2024-06-28 00:14:57,959 INFO L125 PetriNetUnfolderBase]: For 2735/2735 co-relation queries the response was YES. [2024-06-28 00:14:57,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 291 events. 130/291 cut-off events. For 2735/2735 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1218 event pairs, 46 based on Foata normal form. 6/295 useless extension candidates. Maximal degree in co-relation 1204. Up to 132 conditions per place. [2024-06-28 00:14:57,961 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 38 selfloop transitions, 16 changer transitions 9/66 dead transitions. [2024-06-28 00:14:57,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 66 transitions, 542 flow [2024-06-28 00:14:57,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:14:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:14:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2024-06-28 00:14:57,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3277777777777778 [2024-06-28 00:14:57,962 INFO L175 Difference]: Start difference. First operand has 73 places, 43 transitions, 314 flow. Second operand 12 states and 118 transitions. [2024-06-28 00:14:57,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 66 transitions, 542 flow [2024-06-28 00:14:57,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 66 transitions, 502 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-28 00:14:57,967 INFO L231 Difference]: Finished difference. Result has 75 places, 40 transitions, 286 flow [2024-06-28 00:14:57,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=286, PETRI_PLACES=75, PETRI_TRANSITIONS=40} [2024-06-28 00:14:57,967 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 46 predicate places. [2024-06-28 00:14:57,967 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 40 transitions, 286 flow [2024-06-28 00:14:57,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:57,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:57,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:57,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 00:14:57,968 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-28 00:14:57,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:57,969 INFO L85 PathProgramCache]: Analyzing trace with hash 404342774, now seen corresponding path program 7 times [2024-06-28 00:14:57,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:57,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171984034] [2024-06-28 00:14:57,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:57,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:01,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:01,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171984034] [2024-06-28 00:15:01,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171984034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:01,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:01,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:15:01,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507887736] [2024-06-28 00:15:01,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:01,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:15:01,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:01,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:15:01,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:15:01,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:15:01,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 40 transitions, 286 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:01,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:01,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:15:01,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:02,353 INFO L124 PetriNetUnfolderBase]: 119/262 cut-off events. [2024-06-28 00:15:02,353 INFO L125 PetriNetUnfolderBase]: For 2783/2787 co-relation queries the response was YES. [2024-06-28 00:15:02,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 262 events. 119/262 cut-off events. For 2783/2787 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1046 event pairs, 51 based on Foata normal form. 6/265 useless extension candidates. Maximal degree in co-relation 1152. Up to 195 conditions per place. [2024-06-28 00:15:02,355 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 28 selfloop transitions, 19 changer transitions 0/50 dead transitions. [2024-06-28 00:15:02,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 50 transitions, 425 flow [2024-06-28 00:15:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:15:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:15:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2024-06-28 00:15:02,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3074074074074074 [2024-06-28 00:15:02,357 INFO L175 Difference]: Start difference. First operand has 75 places, 40 transitions, 286 flow. Second operand 9 states and 83 transitions. [2024-06-28 00:15:02,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 50 transitions, 425 flow [2024-06-28 00:15:02,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 50 transitions, 384 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-28 00:15:02,360 INFO L231 Difference]: Finished difference. Result has 70 places, 43 transitions, 319 flow [2024-06-28 00:15:02,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=319, PETRI_PLACES=70, PETRI_TRANSITIONS=43} [2024-06-28 00:15:02,360 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2024-06-28 00:15:02,361 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 43 transitions, 319 flow [2024-06-28 00:15:02,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:02,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:02,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:02,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 00:15:02,361 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-28 00:15:02,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:02,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1743765498, now seen corresponding path program 8 times [2024-06-28 00:15:02,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:02,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24889468] [2024-06-28 00:15:02,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:02,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:05,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:05,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24889468] [2024-06-28 00:15:05,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24889468] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:05,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:05,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:15:05,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776156156] [2024-06-28 00:15:05,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:05,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:15:05,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:05,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:15:05,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:15:05,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:15:05,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 43 transitions, 319 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:05,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:05,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:15:05,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:06,728 INFO L124 PetriNetUnfolderBase]: 116/257 cut-off events. [2024-06-28 00:15:06,728 INFO L125 PetriNetUnfolderBase]: For 2329/2337 co-relation queries the response was YES. [2024-06-28 00:15:06,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 257 events. 116/257 cut-off events. For 2329/2337 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1021 event pairs, 46 based on Foata normal form. 10/264 useless extension candidates. Maximal degree in co-relation 1132. Up to 190 conditions per place. [2024-06-28 00:15:06,730 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 28 selfloop transitions, 23 changer transitions 0/54 dead transitions. [2024-06-28 00:15:06,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 54 transitions, 471 flow [2024-06-28 00:15:06,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:15:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:15:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2024-06-28 00:15:06,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.296969696969697 [2024-06-28 00:15:06,733 INFO L175 Difference]: Start difference. First operand has 70 places, 43 transitions, 319 flow. Second operand 11 states and 98 transitions. [2024-06-28 00:15:06,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 54 transitions, 471 flow [2024-06-28 00:15:06,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 54 transitions, 431 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-28 00:15:06,736 INFO L231 Difference]: Finished difference. Result has 76 places, 46 transitions, 365 flow [2024-06-28 00:15:06,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=365, PETRI_PLACES=76, PETRI_TRANSITIONS=46} [2024-06-28 00:15:06,737 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 47 predicate places. [2024-06-28 00:15:06,737 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 46 transitions, 365 flow [2024-06-28 00:15:06,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:06,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:06,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:06,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 00:15:06,738 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-28 00:15:06,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:06,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1738409070, now seen corresponding path program 6 times [2024-06-28 00:15:06,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:06,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452190801] [2024-06-28 00:15:06,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:06,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:11,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:11,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452190801] [2024-06-28 00:15:11,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452190801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:11,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:11,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:15:11,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914432116] [2024-06-28 00:15:11,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:11,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:15:11,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:11,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:15:11,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:15:11,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:15:11,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 46 transitions, 365 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:11,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:11,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:15:11,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:12,068 INFO L124 PetriNetUnfolderBase]: 131/292 cut-off events. [2024-06-28 00:15:12,069 INFO L125 PetriNetUnfolderBase]: For 3279/3287 co-relation queries the response was YES. [2024-06-28 00:15:12,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1307 conditions, 292 events. 131/292 cut-off events. For 3279/3287 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1238 event pairs, 50 based on Foata normal form. 16/305 useless extension candidates. Maximal degree in co-relation 1270. Up to 186 conditions per place. [2024-06-28 00:15:12,070 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 26 selfloop transitions, 16 changer transitions 12/57 dead transitions. [2024-06-28 00:15:12,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 57 transitions, 521 flow [2024-06-28 00:15:12,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:15:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:15:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2024-06-28 00:15:12,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2024-06-28 00:15:12,072 INFO L175 Difference]: Start difference. First operand has 76 places, 46 transitions, 365 flow. Second operand 9 states and 87 transitions. [2024-06-28 00:15:12,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 57 transitions, 521 flow [2024-06-28 00:15:12,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 57 transitions, 449 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-28 00:15:12,076 INFO L231 Difference]: Finished difference. Result has 76 places, 42 transitions, 307 flow [2024-06-28 00:15:12,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=307, PETRI_PLACES=76, PETRI_TRANSITIONS=42} [2024-06-28 00:15:12,077 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 47 predicate places. [2024-06-28 00:15:12,077 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 42 transitions, 307 flow [2024-06-28 00:15:12,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:12,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:12,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:12,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 00:15:12,077 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-28 00:15:12,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:12,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1738255248, now seen corresponding path program 9 times [2024-06-28 00:15:12,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:12,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090394952] [2024-06-28 00:15:12,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:12,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:15,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:15,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090394952] [2024-06-28 00:15:15,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090394952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:15,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:15,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:15:15,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382740902] [2024-06-28 00:15:15,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:15,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:15:15,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:15,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:15:15,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:15:15,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:15:15,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 42 transitions, 307 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:15,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:15,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:15:15,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:16,260 INFO L124 PetriNetUnfolderBase]: 104/237 cut-off events. [2024-06-28 00:15:16,260 INFO L125 PetriNetUnfolderBase]: For 2631/2631 co-relation queries the response was YES. [2024-06-28 00:15:16,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 237 events. 104/237 cut-off events. For 2631/2631 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 904 event pairs, 41 based on Foata normal form. 2/236 useless extension candidates. Maximal degree in co-relation 1032. Up to 103 conditions per place. [2024-06-28 00:15:16,262 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 32 selfloop transitions, 18 changer transitions 0/53 dead transitions. [2024-06-28 00:15:16,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 53 transitions, 473 flow [2024-06-28 00:15:16,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:15:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:15:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2024-06-28 00:15:16,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31851851851851853 [2024-06-28 00:15:16,263 INFO L175 Difference]: Start difference. First operand has 76 places, 42 transitions, 307 flow. Second operand 9 states and 86 transitions. [2024-06-28 00:15:16,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 53 transitions, 473 flow [2024-06-28 00:15:16,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 53 transitions, 429 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-28 00:15:16,266 INFO L231 Difference]: Finished difference. Result has 73 places, 43 transitions, 319 flow [2024-06-28 00:15:16,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=319, PETRI_PLACES=73, PETRI_TRANSITIONS=43} [2024-06-28 00:15:16,267 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2024-06-28 00:15:16,267 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 43 transitions, 319 flow [2024-06-28 00:15:16,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:16,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:16,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:16,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 00:15:16,267 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-28 00:15:16,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:16,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1743771450, now seen corresponding path program 7 times [2024-06-28 00:15:16,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:16,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700767936] [2024-06-28 00:15:16,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:16,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:20,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:20,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700767936] [2024-06-28 00:15:20,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700767936] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:20,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:20,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:15:20,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167015007] [2024-06-28 00:15:20,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:20,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:15:20,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:20,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:15:20,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:15:20,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:15:20,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 43 transitions, 319 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:20,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:20,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:15:20,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:21,598 INFO L124 PetriNetUnfolderBase]: 94/219 cut-off events. [2024-06-28 00:15:21,599 INFO L125 PetriNetUnfolderBase]: For 2126/2126 co-relation queries the response was YES. [2024-06-28 00:15:21,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 219 events. 94/219 cut-off events. For 2126/2126 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 815 event pairs, 35 based on Foata normal form. 8/224 useless extension candidates. Maximal degree in co-relation 862. Up to 121 conditions per place. [2024-06-28 00:15:21,600 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 25 selfloop transitions, 11 changer transitions 13/52 dead transitions. [2024-06-28 00:15:21,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 52 transitions, 445 flow [2024-06-28 00:15:21,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:15:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:15:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2024-06-28 00:15:21,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2024-06-28 00:15:21,601 INFO L175 Difference]: Start difference. First operand has 73 places, 43 transitions, 319 flow. Second operand 9 states and 84 transitions. [2024-06-28 00:15:21,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 52 transitions, 445 flow [2024-06-28 00:15:21,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 52 transitions, 405 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-28 00:15:21,604 INFO L231 Difference]: Finished difference. Result has 75 places, 36 transitions, 252 flow [2024-06-28 00:15:21,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=252, PETRI_PLACES=75, PETRI_TRANSITIONS=36} [2024-06-28 00:15:21,604 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 46 predicate places. [2024-06-28 00:15:21,604 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 36 transitions, 252 flow [2024-06-28 00:15:21,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:21,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:21,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:21,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 00:15:21,605 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-28 00:15:21,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:21,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1743980700, now seen corresponding path program 8 times [2024-06-28 00:15:21,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:21,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459524453] [2024-06-28 00:15:21,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:21,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:26,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:26,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:26,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459524453] [2024-06-28 00:15:26,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459524453] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:26,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:26,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:15:26,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5330680] [2024-06-28 00:15:26,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:26,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:15:26,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:26,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:15:26,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:15:26,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:15:26,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 36 transitions, 252 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:26,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:26,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:15:26,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:26,839 INFO L124 PetriNetUnfolderBase]: 69/174 cut-off events. [2024-06-28 00:15:26,839 INFO L125 PetriNetUnfolderBase]: For 1906/1906 co-relation queries the response was YES. [2024-06-28 00:15:26,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 174 events. 69/174 cut-off events. For 1906/1906 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 587 event pairs, 28 based on Foata normal form. 6/177 useless extension candidates. Maximal degree in co-relation 652. Up to 98 conditions per place. [2024-06-28 00:15:26,840 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 22 selfloop transitions, 9 changer transitions 10/44 dead transitions. [2024-06-28 00:15:26,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 44 transitions, 350 flow [2024-06-28 00:15:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:15:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:15:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2024-06-28 00:15:26,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2962962962962963 [2024-06-28 00:15:26,841 INFO L175 Difference]: Start difference. First operand has 75 places, 36 transitions, 252 flow. Second operand 9 states and 80 transitions. [2024-06-28 00:15:26,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 44 transitions, 350 flow [2024-06-28 00:15:26,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 44 transitions, 322 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-28 00:15:26,843 INFO L231 Difference]: Finished difference. Result has 70 places, 31 transitions, 208 flow [2024-06-28 00:15:26,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=208, PETRI_PLACES=70, PETRI_TRANSITIONS=31} [2024-06-28 00:15:26,844 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2024-06-28 00:15:26,844 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 31 transitions, 208 flow [2024-06-28 00:15:26,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:26,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:26,844 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-28 00:15:26,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 00:15:26,845 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-28 00:15:26,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:26,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1948660649, now seen corresponding path program 1 times [2024-06-28 00:15:26,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:26,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312581658] [2024-06-28 00:15:26,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:26,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:31,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:31,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312581658] [2024-06-28 00:15:31,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312581658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:31,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:31,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:15:31,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537884443] [2024-06-28 00:15:31,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:31,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:15:31,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:31,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:15:31,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:15:31,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:15:31,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 31 transitions, 208 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-28 00:15:31,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:31,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:15:31,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:31,923 INFO L124 PetriNetUnfolderBase]: 46/121 cut-off events. [2024-06-28 00:15:31,923 INFO L125 PetriNetUnfolderBase]: For 1080/1080 co-relation queries the response was YES. [2024-06-28 00:15:31,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 121 events. 46/121 cut-off events. For 1080/1080 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 322 event pairs, 13 based on Foata normal form. 6/124 useless extension candidates. Maximal degree in co-relation 406. Up to 47 conditions per place. [2024-06-28 00:15:31,923 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 16 selfloop transitions, 6 changer transitions 14/39 dead transitions. [2024-06-28 00:15:31,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 39 transitions, 296 flow [2024-06-28 00:15:31,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:15:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:15:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2024-06-28 00:15:31,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29259259259259257 [2024-06-28 00:15:31,925 INFO L175 Difference]: Start difference. First operand has 70 places, 31 transitions, 208 flow. Second operand 9 states and 79 transitions. [2024-06-28 00:15:31,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 39 transitions, 296 flow [2024-06-28 00:15:31,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 39 transitions, 245 flow, removed 6 selfloop flow, removed 14 redundant places. [2024-06-28 00:15:31,926 INFO L231 Difference]: Finished difference. Result has 61 places, 23 transitions, 130 flow [2024-06-28 00:15:31,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=130, PETRI_PLACES=61, PETRI_TRANSITIONS=23} [2024-06-28 00:15:31,927 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 32 predicate places. [2024-06-28 00:15:31,927 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 23 transitions, 130 flow [2024-06-28 00:15:31,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-28 00:15:31,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:31,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:31,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 00:15:31,927 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-28 00:15:31,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1689863815, now seen corresponding path program 1 times [2024-06-28 00:15:31,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:31,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931858898] [2024-06-28 00:15:31,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:31,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:38,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:38,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931858898] [2024-06-28 00:15:38,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931858898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:38,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:38,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 00:15:38,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342957843] [2024-06-28 00:15:38,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:38,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 00:15:38,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:38,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 00:15:38,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 00:15:38,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:15:38,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 23 transitions, 130 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:38,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:38,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:15:38,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:38,685 INFO L124 PetriNetUnfolderBase]: 21/61 cut-off events. [2024-06-28 00:15:38,685 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2024-06-28 00:15:38,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 61 events. 21/61 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 1 based on Foata normal form. 4/64 useless extension candidates. Maximal degree in co-relation 178. Up to 16 conditions per place. [2024-06-28 00:15:38,685 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 0 selfloop transitions, 0 changer transitions 29/29 dead transitions. [2024-06-28 00:15:38,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 29 transitions, 172 flow [2024-06-28 00:15:38,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:15:38,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:15:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2024-06-28 00:15:38,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26296296296296295 [2024-06-28 00:15:38,686 INFO L175 Difference]: Start difference. First operand has 61 places, 23 transitions, 130 flow. Second operand 9 states and 71 transitions. [2024-06-28 00:15:38,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 29 transitions, 172 flow [2024-06-28 00:15:38,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 29 transitions, 127 flow, removed 2 selfloop flow, removed 17 redundant places. [2024-06-28 00:15:38,687 INFO L231 Difference]: Finished difference. Result has 42 places, 0 transitions, 0 flow [2024-06-28 00:15:38,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=42, PETRI_TRANSITIONS=0} [2024-06-28 00:15:38,688 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2024-06-28 00:15:38,688 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 0 transitions, 0 flow [2024-06-28 00:15:38,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:38,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-28 00:15:38,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-28 00:15:38,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-28 00:15:38,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-28 00:15:38,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 00:15:38,693 INFO L445 BasicCegarLoop]: Path program histogram: [9, 8, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:38,696 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 00:15:38,696 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 00:15:38,699 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 00:15:38,700 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 00:15:38,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 12:15:38 BasicIcfg [2024-06-28 00:15:38,701 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 00:15:38,701 INFO L158 Benchmark]: Toolchain (without parser) took 224306.83ms. Allocated memory was 153.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 108.2MB in the beginning and 716.2MB in the end (delta: -608.0MB). Peak memory consumption was 520.9MB. Max. memory is 16.1GB. [2024-06-28 00:15:38,701 INFO L158 Benchmark]: Witness Parser took 0.19ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 89.6MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 00:15:38,702 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory was 85.8MB in the beginning and 85.8MB in the end (delta: 76.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 00:15:38,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 729.65ms. Allocated memory is still 153.1MB. Free memory was 108.2MB in the beginning and 74.7MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-06-28 00:15:38,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.54ms. Allocated memory is still 153.1MB. Free memory was 74.7MB in the beginning and 68.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-28 00:15:38,702 INFO L158 Benchmark]: Boogie Preprocessor took 99.91ms. Allocated memory is still 153.1MB. Free memory was 68.4MB in the beginning and 64.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 00:15:38,703 INFO L158 Benchmark]: RCFGBuilder took 1267.74ms. Allocated memory is still 153.1MB. Free memory was 64.2MB in the beginning and 49.2MB in the end (delta: 15.0MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2024-06-28 00:15:38,703 INFO L158 Benchmark]: TraceAbstraction took 222123.27ms. Allocated memory was 153.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 49.2MB in the beginning and 716.2MB in the end (delta: -666.9MB). Peak memory consumption was 462.3MB. Max. memory is 16.1GB. [2024-06-28 00:15:38,704 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.19ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 89.6MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory was 85.8MB in the beginning and 85.8MB in the end (delta: 76.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 729.65ms. Allocated memory is still 153.1MB. Free memory was 108.2MB in the beginning and 74.7MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.54ms. Allocated memory is still 153.1MB. Free memory was 74.7MB in the beginning and 68.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.91ms. Allocated memory is still 153.1MB. Free memory was 68.4MB in the beginning and 64.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1267.74ms. Allocated memory is still 153.1MB. Free memory was 64.2MB in the beginning and 49.2MB in the end (delta: 15.0MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * TraceAbstraction took 222123.27ms. Allocated memory was 153.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 49.2MB in the beginning and 716.2MB in the end (delta: -666.9MB). Peak memory consumption was 462.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 815]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 816]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 222.0s, OverallIterations: 42, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 29.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1087 SdHoareTripleChecker+Valid, 9.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 980 mSDsluCounter, 287 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 496 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6883 IncrementalHoareTripleChecker+Invalid, 7379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 496 mSolverCounterUnsat, 136 mSDtfsCounter, 6883 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 415 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 412 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 45.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=670occurred in iteration=25, InterpolantAutomatonStates: 369, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 189.6s InterpolantComputationTime, 637 NumberOfCodeBlocks, 637 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 80866 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-28 00:15:38,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE